الذكاء الصناعي

2012-2012

University of Technology

Computer Sciences Department

Artificial Intelligence Branch 2012 - 2013

First Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour Tutorial

No. of

Units

1 Structured Programming 2 2 0 4

2 Mathematics 2 - 0 2

3 Discrete Structures 2 - 0 2

4 Computer Organization and Logic Design

2 2 0 2

5 Principles of Artificial Intelligence

2 2 0 2

6 Introduction to statistics theory

2 - 0 2

7 English Language 2 - - Pass

Total 01 6 6 06

( : 16 ) Total No. of Unit for One Semester: (16)Units

: (23 ) Total No. of Unit for Year: ( 32 ) Units

Second Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour Tutorial

No. of

Units

1 Object Oriented Programming

2 2 0 2

2 Data Structures and Algorithms

2 2 0 2

3 Fuzzy logic 2 - 0 2

4

AI strategies and

algorithms 2 2 0 2

5

Micro-Processors and Assembly

Programming

2 2 0 2

6

Advanced Mathematics

and numerical analysis 2 2 0 2

7 Computation Theory 2 - 0 2

8 Human Rights and

Democracy 0 - - 1

Total 01 01 7 21

( :32 ) Total No. of Unit for One Semester: (20)Units

: (40) Total No. of Unit for Year: (40) Units




Third Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Computer Graphics 2 2 1 3

2 Compilers 2 2 1 3

3 2 Data warehouse 2 2 1 3

4 Computer Architecture 2 - 1 2

5 Natural Language

Processing 2 2 1 3

6 Expert Systems 2 2 1 3

7 Machine learning 2 2 1 3

8 Operations Researches 2 - 1 2 Total 16 12 8 22

( : 33 ) Total No. of Unit for One Semester: (22)Units


Forth Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour Tutorial

No. of

Units

0 Planning & Robotics 2 - 0 2

2

Communications and

Computer Networks 2 2 0 2

2 )(

Computer and Data

Security 2 - 0 2

4 Operating Systems 2 2 0 2

1

Advanced Intelligent

Systems 2 2 0 2

6 ()

Web programming 2 2 0 2

7 Machine Vision 2 2 - 2

8 Project 0 4 - 2

Total 01 04 6 22

( : 22 ) Total No. of Unit for One Semester: (22)Units : (44) Total No. of Unit for Year: (44) Units




First Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Structured Programming 3 2 1 4

2 Mathematics 2 - 1 2

3 Discrete Structures 2 - 1 2

4

Computer Organization

and Logic Design 2 2 1 3

5 Principles of Artificial Intelligence

2 2 1 3

6 Introduction to the statistics theory

2 - 1 2

7 English Language 2 - - Pass

Total 15 6 6 16

: ( 16 ) Total No. of Unit for One Semester: (16)Units : (23 ) Total No. of Unit for Year: ( 32 ) Units

1- Structured Programming (with C++ Programming Language):

Introduction, Procedural Programming Principles, Algorithm , Algorithm

properties , Examples, Flowcharts, Flowchart Figure, Examples ,C++ Language

Basics (Character set, Identifiers, Getting Started with C++, Variables

Declaration, Variables, Constants, Arithmetic Operations,The math.h Library, Unary Minus, Increment and /decrement Operators, Operational Assignment

Operators, Relational Operators, Logical Operators, Bitwise Operator), Selection

Statements (Selection Statements, The Single If Statement Structure, The Single If

Statement Structure (Blocks), The If/else Statement Structure, Nested If and

If/else Statements, The Switch Selection Statement (Selector), Conditional

Statement), Iteration Statements (Selection Statements, While Repetition

Structure, Do/While Statement, For Statement, More about For Statement, Nested

Loops, Break and Continue Control Statements), Functions (Function, Passing

Parameters (Passing by Value, Passing by Reference)), Arrays (Array of One

Dimension (Declaration of Arrays, Initializing Array Elements, Accessing Array

Elements, Read / Write / Process Array Elements), Array of Two Dimension

(Declaration of 2D-Arrays, Initializing 2D-Array Elements, Read / Write / Process

Array Elements)), String (Read / Write / Process Array Elements, Member

Function of String, stdlib Library), Structures (The Three Ways for Declare the

Structure, Array of Structures).

References:

Mastering c++ by sorhan sami & oqeli saleh 2002

2- Mathematics:




Functions, Transcendental Functions, Sequence and Series, Differentiation and

Applications, Integration and Applications, Multiple Integrals, Polar Plane, Complex

Numbers, Matrices, Vector Analysis.

References:

Thomas calculus ,1989

3- Discrete Structures

Set theory -sets & subsets - how to specify sets - , sequences -Operations on sets-, Algebra of sets & its proves, sets of numbers- Finite sets, Mathematical induction & recursion, Matrices, Logic and propositions- Equivalency, Tautology& Contradiction,

Relations- Computer representation of relations & Digraph, Manipulation of relations,

Properties of relations, Composition of relations (Functions-types of functions,

Graphs-definition-graphs & multigraphs- subgraph degree of graph), Walk length of walk- trail- path- cycle- the bridges of konnisberg, Traversable multigraphs- Euler

theorem- special graph- bipartite graph matrices & graph, Labeled graphs trees- rooted tree- ordered rooted tree- polish notation, Spanning tree- directed graph- matrix

of digraph, Minimal path, Finite state machines, Language & pattern recognition

machines, Optimistic approach to construct FSM, Finite automata, Finite automata

(Contd).

References:

1. Discrete mathematics by Seymour Lipschutz 2. Discrete mathematical structures for computer science by Bernard Kolman &

Robert C. Busby 2004

4- Computer Organization and Logic Design:

Digital systems conversion, Digital system arithmetic, Complement scheme,

Subtraction with complement, Logic gates, Addition digital system, The basic

postulation, Prove the theorem, Simplification by map, Combinational circuits,

Sequential circuits, Flip-flops, Multilevel logic implementation, Encoder and decoder,

Multiplexer and de-multiplexer, Msl and vlsc, Computer definition, Computer

generation, Computer architecture, CPU operation, Fetch cycle, Execution cycle,

Memory representation, Memory types, Primary storage, Secondary storage,

Computer classification, Language classification, Translators program, Operating

systems, Networking, Internet.

References:

1. Computer System Architecture, M. Morris Mano, Third Edition, 1993. 2. Digital Fundamental, Floyd, Eight Edition, 2003. 3. Principle Of Computer Architecture, Murdocca. M. J., Heuring .V.P.,

Prentice-Hall, Inc.

4. Computer Communications and Information, Hutchinson .S.E., Sawyer .S.C. ,with Contribution by Coulthard G.J. .

5- Principles of Artificial Intelligence :

Propositional logic, Predicate Logic,First-Order- Predicate,Production rules,

Problem Characteristics, Search Strategies (Problem state space and search space




,Problem Solving ,Blind Search , Search Space Problems, Monkey &Banana , 8-

puzzle , 2-jug ) , Forward & Backward , Matching , Prolog (Terms, List, String)

References:

1. Artificial Intelligence structures and strategies for complex problem solving by George F. Luger.

2. Elin Rich, Artificial Intelligence,1991. 3. Matt Carter , "Mind and Computers" "An Introduction to the Philosophy of

Artificial Intelligence " , Edinbwgh University press , 2007.

4. Max Bramer, " Logic Programming with prolog ", Spring ,2005. 5. prolog

3225. 6. . prolog

1991.

6- Introduction to the statistics theory

Set theory, Binary operations on set , Permutation, Combination , Sample

space, events, random variable , Addition theorem, multiplication theorem,

Conditional probability , Bays theorem, Independent of events , Birnolli trails ,

Introduction to the theory of statistics ,Descriptive statistics, Measure of central

tendency , Measure of dispersion , Binominal distribution , Exponential

distribution , Normal (Gaussian) distribution , Correlation of Coefficient , The

Chi-square test, the Goodness of Fit test, test of homogeneity, Regression , Regression analysis.

References:

1. Statistics: theories and applications, Joseph Inungo, 2006.

2. Probability and statistics, theory and applications, Gunnar Blom, 1989.

7- English Language

Toofl lectures for first stage students in the department of computer sciences, UOT.

Part One: Structure and written expression

1. Nouns, Pronoun, part of sentence, verbs, prepositions, articles, noun class, adjectives class, adverb

classes, prepositional phrases

Part Two: Reading

1. Reading of detail, reading of reference and vocabulary, reading of main idea, reading of inference

Part Three: Listening

1. Short conversation, longer conversions, talks and lectures.

Part Four: writing

1. Strategies, topics.




Second Year Syllabus

Subject

No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Object Oriented

Programming 2 2 1 3

2 Data Structures and

Algorithms 2 2 1 3

3 Fuzzy logic 2 - 1 2 4

AI strategies and

algorithms 2 2 1 3

5

Micro-Processors and

Assembly Programming 2 2 1 3

6 Advanced Mathematics

and numerical analysis 2 2 1 3

7 Computation Theory 2 - 1 2 8 Human Rights and

Democracy 1 - - 1

Total 15 11 7 21

( : 02 )

Total No. of Unit for One Semester: (20)Units


1- Object Oriented Programming and Visual C++

Overview for functions and parameter transmission in C++ , Introduction of OOP

and its main features , Defining a Simple Class with Inline Member Functions,

Constructors and destructors functions, Friends functions, Constant Members, Static

Members, Default Arguments and Implicit Member Argument, Function and

operators Overloading, Inheritance and Derived Classes, Virtual Functions and

Multiple Inheritance, Function Template Definition and Function Template

Instantiation, Class Template Definition and Class Template Instantiation,

Introduction to Visual Studio. NET C++, Starting Visual C++ MDE, Starting

Developer studio to implement a simple program, Concepts and tools for Windows

Application, Microsoft Foundation Class Library Fundamentals, Explore the

Microsoft Foundation Class (MFC) Library and the Visual C++ IDE (Integrated

Development Environment), Create the standard MFC Application Architectures, use

the Graphical Output features of MFC, Explore Message Maps, Message Handlers,

and Command Routing, and add standard User Interface Elements to an MFC

Application, Create Modal and Modeless Dialog Boxes for user interaction,

implement Exception Handling, and use MFC Debugging Support and Visual C++

Debugging Tools, Add Data Access Services with MFC, build and use MFC-based

ActiveX Controls, develop Internet applications with MFC, add Persistence using

MFC Serialization Support, create multithreaded MFC Applications, and implement

regular and extension MFC DLLs.

References:




1. Mastering C++, Prof. Oqeili Saleh and others, Dar Al-Shorok, Amman-Jordan,

2004.

2. Object Oriented Programming Language with C++, Bjarne Stroustrup, Addison-

Wesley Publication, 2003.

2- Data Structures and Algorithms:

Introduction to Data Structures, Memory representation for 1D and 2D arrays, Linear

list, Linear list types, Stack: (Stack Operations, Applications of stack), Queue: (Queue

Operations, Applications of queue), Circular Queue: (CQueue Operations,

Applications of CQueue), Linked List, Linked-Stack, Linked-Queue, Linked-CQueue,

Recursion, Graph, Trees: (Types of Tree, Binary tree, Binary tree scan, Represent

Regulars expression using trees, convert tree to binary tree, Binary Search Tree),

Sorting: (Sorting Algorithms, Types of Sorting algorithms, Bubble Sort, Insertion

Sort, Quick Sort), Searching: (Searching Algorithm, Sequential Search, Binary

Search).

References:

1- Data structures and Algorithms with Object- Oriented design Patterns in C++ by:

Bruno R. Preiss, B.A.Sc., M.A.Sc.Ph.D., P.Eng. Associate Professor, Department

of electronic and computer engineering, university of waterloo.

2- Data Structures and algorithm analysis in C, By: Mark Allen Weiss.

3- Data Structures and algorithms in Java PDF file.

4- Data Structures using C and C++, Yedidyah language, Moshe J. augenstein, Aaeon

M.

Tenenbaum, Brooklyn College.

3- Fuzzy Logic

Fuzzy sets, the operations of fuzzy sets, fuzzy relationsand compositions,

fuzzy graph and relation, fuzzy number, fuzzy functions, probability and

uncertainty, fuzzy logic, fuzzy inference, fuzzy control and fuzzy expert systems,

real applications.

References:

1. First course on fuzzy theory and application ", Kwang H. Le , spring 2005. 2. Introduction to fuzzy logic , and fuzzy control system ,Gauanrony Chen

,Trung Tat Pham, 2001 by CRC press LLC.

4- Artificial Intelligence Strategies and algorithms:

More complex Search Space ( More Problems Solving Approach Used ) , Heuristic

Search ( Heuristic Functions , Hill Climbing , Best-First Search , A Algorithm , A* - Algorithm , -Heuristic Search Examples , - 8-puzzle , Salesman Problem ,

2-Jug , Monkey & Banana , Tic-Tac- Toe , Minimax , Alpha Beta , -Problem Reduction (and \ or) , Constraint satisfactions , Mean- Ends analysis) , Knowledge

Representation ( Semantic Net , Conceptual Graph ,Frame) , Theorem Proving Using




Resolution ( Predicate Logic , Clause Form ) , Statistical Reasoning ( Probability ,

Bayser Network ,Dempster Shafer Theory).

References:

1. Elin Rich, Artificial Intelligence,1991. 2. Luger E.George,Artificial Intelligence structure and strategies , 2005. 3 Stwart Russel and Peter Norvig , "Artificial Intelligent ,A modern approach ,2003.

4 Amit Konar, " Artificial Intelligence and soft computing , Behavior and cognitive

modeling of the Human Brain ", CRC press ,1991.

5- Dimitris Varkas and Ioannis Pl. Vlashavos, " Artificial Intelligence for Advanced

problem solving technique", published in the USA by Information science reference

(an imprint of "IGI" Global),2008.

5- Micro-Processors and Assembly Programming:

CPU Architecture, Register Transfer, Memory, Peripheral Control Chips, Data

Transfer, Fetch and Execute Cycles, Address and Data and Control Busses, Brief

Introduction to Machine Code, Instruction Sets (Form, Othogonality, Number of

Addresses), and Decoding. Assembly Language Programming: Addressing Modes of

the 808, Data Registers, Flags, The Status Register, and Implementing Control

Structures in Assembly Language, Structured Assembly Language Programming

using Procedures, Arithmetic and Logic Instructions Stack (Concepts and

Applications), String Processing, Tools for Preparing and Debugging and Translating

Programs. MS-DOS Operating System Structure: MS-DOS and BIOS Disk and

Keyboard System Architecture. Advanced Features of Processors: Segments and

Segment Registers, Interrupts and Interrupt Service Routines, I/O Port Addressing,

Instruction Pipelining, Cache Memory.

References:

1- Abel P., "IBM PC Assembly Language and Programming", 4th Edition, Prentice Hall, 1998..

2- Thorne M., "Computer Organization and Assembly Language Programming", 2nd Edition, Benjamin/Cummings, 1990.

6- Advanced Mathematic and Numeric Analysis: Partial differentiation, ( partial differentiation for first and higher order of derivative,

chain rule, directional derivative),first order equations, (solution of differential

equation by direct integration, separating the variables, homogeneous

equation,.),Second and higher order differential equations, linear second order differential equation with constant) ,Lap Transform (Laplace transform for standard

important function, multiplication by tn,division by t, Inverse Laplace transform of

derivatives, Partial differential equations ( formation of partial differential equations,

types of partial differential equations,.),Fourier series ( periodic functions, Fourier series for odd and even function, half range Fourier sin and cosine series, change of

interval ),Numerical analysis ( solving sets of equation, elimination and iterative




methods, interpolating polynomials, Lagrange polynomial ),solving non-liner

equation, numerical differentiation and numerical integration, numerical solution of

ordinary differential equations, curve-fitting and approximations.

References:

1- Thomas, G. Calculus and Analytic Geometry, 5th Edition, Addison Wesly, 1999.

2- Numerical Methods Using Matlab, Prentice Hall.

7- Computation Theory:

Regular Expression, Finite Automata, DFA and NFA, Equivalence of NFA and DFA,

Equivalence of NFA and DFA with E-moves, Introduction to Crammers, Phrase

Structure Grammar, Context sensitive Grammar, Context Free grammar, Chomsky

Normal Form, Greibach Normal Form, Tree, The empty string in context free

grammar ambiguity, Regular grammar, Left linear grammar, Right linear grammar,

Kleen theorem, Two way finite automata with output (mealy machine, moor

machine), The equivalence of mealy and moor machine, Push down automata, Top

down bottom up derivation, Turing machine. References:

1. H.R.Lewis And G.H Papadimitiou,"Elements Of The Theory Of Computation", Prentig-Hall, 1981.

2. R.W.Floyd And R.Beigel,"The Languae Of Machine:An Introduction To Computability And Formal Languages"Computer Science Press, Network,

1994.

3. M.Sipser."Introduction To The Theory Of Computation" ,Boston Pws Pub ,1996.

8- :

- .

- - - - - )( - - - -

.

1-

2- -




Third Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Computer Graphics 2 2 1 3

2 Compilers 2 2 1 3

3 Data warehouse 2 2 1 3

4 Computer Architecture 2 - 1 2

5 Natural Language

Processing 2 2 1 3

6 Expert Systems 2 2 1 3

7 Machine learning 2 2 1 3

8 Operations Researches 2 - 1 2 Total 16 12 8 22

: (33 ) Total No. of Unit for One Semester: (22)Units : (44) Total No. of Unit for Year: (44) Units

1- Computer Graphics:

Introduction ( Display devices , Cathode Ray Tube (CRT) , Liquid Crystal Display

(LCD) ,frame Buffer,Coordinate System), Basic Shaping Drawing (Line ,Circle) ,

Two Dimension Transformation ( translation ,Scaling ,Rotation ,Reflection) ,

Clipping , Three Dimension Transformations (Translation , Scaling ,Rotation

,Reflection) , Projection ( Orthographic projection ,Perspective Projection ) , Directx (

Initializing ,Loading the Background ,Drawing Sprites ) ,Graphic Representation of

robot parts ( Forward kinematics, Calculate where the robot end effecter (e.g.,hand)

will be if all joint variables are known , E.g.,(x,y,z) coordinate of end effecter, Inverse

kinematics,Calculate joint variables if we wantthe end effect or to be located at

particular place ,e.g,(x,y,z) coordinate.

References:

1. computer graphics mathematics, first steps , P. A. Egerton and W.S. Hall, 1998.

2. Visual basic game programming for teens, Jonathan S. Harboor, 2005.

2- Compilers:

Programming Language, Introduction to Compiler, Type of Errors, One Pass

Compiler, Syntax Definition, Context Free Grammar, Parsing Tree & leftmost and

rightmost derivations, Transition Graph, Lexical analysis, Syntax of Analysis,

Problems of Compiler, First and Follow, Top down Parsing, Predictive Parsing

Method, Bottom up Parsing, Operation Precedence Parser, Simple Left to Right

Parser, Canonical LR Parser, Look Ahead LR, Semantic Analysis, Intermediate Code

Generation, Code Optimization, Examples of Code Optimization, Code Generation,

Build Simple Compiler.

References:

3. Principles of Compiler Design ,Alfred V. Aho, Jeffry D. Ulman.




3- Data warehouse:

Introduction ( What is data ware house , Differences btw. Operation database ,

system and data warehouse, Why have a separate data warehouse) ,

Multidimensional data model ( Tables and spread sheets to data cubes , data cubes

, Multidimensional data model , Hierarchies Concept ), On line analyses types (

OLAP ,MOLAP , ROLAP ,HOLAP) , Data warehouse Architecture ( Step of

design and construction of data warehouse , Tier data warehouse , Advantage of

data warehouse ) , Data warehouse implementation ( Meta data repository , data

ware house back end tools and utilities , data warehouse usage ) , Data

preprocessing to constructed data warehouse ( Why preprocess the data , Clean

data , Data integration and transformation , Data reduction , Form data ware

house to DM) , Data Mining ( Data mining definition , Data mining functionalities

, Data mining to association rules , Classification , Predication , clustering)

References:

1. Data mining concepts and techniques, Jiawei Han , Micheline Kamber , 20001.

2. Discovering data mining ,from concept to implementation, Peter Cabena, Pablo Hadjinian, Jeap Verhees and Alessandro Tanasi, 1998.

4- Computer Architecture:

1. The Computer System: (System Buses: Computer Components, Computer

Function, Interconnection Structures, Bus Interconnection, PCI.), (Internal Memory:

Computer Memory System Overview, Semiconductor Main Memory, Cache

Memory, Advanced DRAM Organization), (Input/Output: External Devices, I/O

Modules, Programmed I/O, Interrupt-Driven I/O, Direct Memory Access, I/O

Channels and Producers, The External Interface), Operating System Overview.

2. The Central Processing Unit (CPU): (Computer Arithmetic: The Arithmetic and

Logic Unit(ALU), Integer Arithmetic, Floating-Point Representation, Floating-Point

Arithmetic), (Instruction Sets: Characteristics and Function, Machine Instruction

Characteristics, Types of Operands, Types Operations, Addressing Modes and

Formats, Register Organization, The Instruction Cycle, Instruction Pipelining),

Assembly Language, (The Control Unit: Micro-Operations, Control of the CPU,

Hardwired Implementation, Microporgram Controller, Microinstructions,

Sequencing, Microinstruction Execution), (Reduce Instruction Set Computer: An

Introduction).

References:

1- M. Mano, Computer System Architecture, 3rd Edition, Prentice-Hall India. 2- W.Stallings, Computer Organization and Architecture, 4th Edition, Prentice

Hall India.

3- Harry, Jordan, Computer Systems Design and Architecture, Edition, Addison Wesley.

4- J.D. Carpinelli, Computer Systems Organization and Architecture, Addison Wesley.

5- J.P. Hayes, Computer Architecture and Organization, McGraw Hill.




6- M.M. Mano and Charles, Logic and Computer Design Fundamentals, 2nd Edition Updated, Pearson Education Asia.

5- Natural Language Processing (NLP):

Introduction to NLP: (Definition of NLP, NLP Goal, The advantage of NLP, Example of Intelligent Robot), Understanding: (What is Understanding?, What makes understanding hard?, The complexity of the target representation, Type of mapping, Level of interactive among components), Types of Languages & Grammars: (Type 0: Phrase Structure Grammar (PSG), Type 1: Context Sensitive Grammar (CSG), Type

2: Context Free Grammar (CFG), Type 3: The Dictionary & the Morphology,

Regular Grammar (RG), Written Text Processing (Formal Method), Lexical analysis, Syntax analysis: (Rules of Grammar, Parse Tree and Transition Network

Parser), Semantic analysis, Syntax Analysis (Formal Method): Rules of English

Grammar, Example of PROLOG program of English Grammar solved in: Append

Mechanism.Syntax Analysis, Formal Method, Append Mechanism with Singular & Plural Consideration. Syntax Analysis (Formal Method): Difference Pair Idea, Semantic Analysis (Formal Method): Augmented Transition Network (ATN).

Analyzing the semantic structure of a sentence: (object case, Agent case, Co-agent

case, Beneficiary case, Location case, Time case, Instrument case, Source and

destination cases ), C: The Case Analysis Parser. Written Text Processing (Informal Method), Extracting meaning from keywords, Example of PROLOG program

(DOCSYS) for a manual of a company. Machine Translation (MT): (Definition of MT and its usage, Computer-Aided Human Translation (CAHT), Language

Similarities & Differences), Machine Translation Methods: (Direct Translation Method, Transfer Metaphor Model, The Interlingua Idea: Using Meaning),

Translation Dictionary: (Types of dictionary, Dictionary structure), Spoken language

Processing: (Speech definition, Problem areas in speech recognition system, Text-

Dependent & text Independent SR, Continuous & Isolated SR), SR System model,

From talk to text: Dual purpose speech (medical report), From talk to text: (Dual

purpose speech (schedule appointment), Multiple pronunciations lexicons (Using

Hidden Markov Model (HMM), Speech Recognition Grammar: Using XML Data

Structure, Application on SR system: (Understanding speech without recognizing words)), Application on SR system, Speech Compression (Lossless compression,

Lossy compression), Application on SR system: Distributed speech recognition

system, The relationship between NL & SR, Compares between Written text

processing & Speech processing, Natural Language Generation: Example and

Program.

References:

1. Elian Rich, Artificial Intelligence,1989. 2. William A. Stubblefield & Luger E.George,Artificial Intelligence and the

Design of Expert Systems, 1998. 3. Daniel Jurafsky and James H. Martin Speech and language processing :

Introduction to natural language processing , computational linguistics and

speech recognition second edition 2006. 4. Daniel H. Marcellus Artificial Intelligence and the design of expert systems

1998




6- Expert Systems :

Introduction to Expert System ( - Expert System Components , - Expert System

Architecture , Expert System Life cycle ), Rule Based Expert Systems (Design

and Architecture) (Chemical Synthesis System, Forward Chaining,- Backward

Chaining

, Pattern Recognition System , Text Recognition) , System that depend under

uncertainty( Probability method, Approximation method, Fuzzy net method),

Systems that Explain their Actions( How Facility, Why Facility, Shell Facility,

Method Based Expert Systems(Design, Architecture and

characteristics),Classification Systems(Backward Chaining , Forward Chaining,

Prediction System( Weather Forecasting System), Case Based Expert System

(Design, Architecture and Expert System),Heuristic Rule (principles and Used)

(Embedded Systems based on heuristic rule, Student Advisor system,- Traffic light

system).

References:

1. Daniel H. Marcellus, Expert Systems Programming in Turbo Prolog, Prentice Hall (New Jersey) 1992.

2. George F. Luger,Artificial Intelligence (structures and strategies for complex problem solving), 2005.

3- Daniel Borrajo , " Current Topics in Artificial Intelligence ", Springer ,2007.

4- Joseph C. Giarratano and Gray D. Riley, "Expert systems, principles and

programming ", Thomson, 2005.

7- Machine Learning

Introduction ( Definition of learning system , Goals and Application of machine

learning , Aspect of developing a learning system: training data, concept

representation , function approximation) , Inductive classification

- The concept learning talk( Concept learning as search through a hypothesis space,

General to specific ordering of hypothesis, Finding maximally specific hypothesis , Version space and the candidate elimination algorithm, Learning conjunctive

concepts, The importance of inductive bais), Decision Tree Learning ( Representing

Concepts as decision tree (Recursive inductive of decision tree, Picking the best

splitting attribute: entropy and information gain,Search for simple trees and

computational complexity, Occam's razor,Over filtering, noising data, and pruning),

Instance Based Learning ( Constructing explicit generalization versus comparing the past specific example, K- Nearest- neighbor algorithm,Case based learning), Neural Networks(Artificial neuron concepts, NN Architecture, Supervised

&Unsupervised , Activation Functions, learning Rules, Hebbian Learning rule , Basic

Delta Rule,ANN taxonomy, Hopfield NN, Back Propagation NN, BAM,- Adeline,

Kohonen NN, (ART), Auto& Hetero Associative, Genetic Algorithms ( GA

concepts,GA Operators, GA Parameters, GA Fitness Function, Genetic Programming,

GA Application, Support Vector Machine( Maximum margin linear separation,

Quadractic programming solution to find maximum margin separator).

References:




1- Fundamentals of Neural Networks: Architecture, Algorithms, and application. By Laurene Fausett

2- Neural Networks. By Phil Picton 3- Neural Networks. Fundamentals, Application, Examples. By Werner

Kinnebrock

4- Neural network for identification, prediction and control. By D. T. Pham and X. Liu.

5- Genetic Algorithms. By Gross berg 6- Introduction to neural system. by- Zurada 7- Elian Rich, Artificial Intelligence,1989. 8- William A. Stubblefield & Luger E.George,Artificial Intelligence and the

Design of Expert Systems, 1998.

8- Operations Researches:

Probability( The concept of probability,- Discrete probability distribution,

Continuous probability distribution ), Operation Research(- Operation Research

Definition, Linear programming formulation,-Graphical solution, Simplex

method, Duality and sensitivity analysis, Transportation model, Networking

analysis, Games theory, Queuing Theory, Simulation).

References:

1. Operation Research: An Introduction, Hamdy A. Taha.

Elective Subjects for Third Year

Subject No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Moulding and Simulation 2 2 1 3

2 Predicted and Decision

Making 2 - 1 2




Forth Year Syllabus

Subject No. Of

Theory

hour

No. of

Lab.

hour

Tutorial No. of

Units

1 Planning & Robotics

2 - 1 2

2 Communications and

Computer Networks 2 2 1 3

3 Computer and Data

Security 2 - 1 2

4 Operating Systems 2 2 1 3

5

Advanced Intelligent

systems

2 2 1 3

6 Web programming 2 2 1 3

7 Machine vision

2 2 - 3

8 Project 1 4 - 3 Total 15 14 6 22

: 22) ) Total No. of Unit for One Semester: (22)Units : (44) Total No. of Unit for Year: (44) Units

1- Planning & Robotics:

Planning and Navigation( path planning, Planning with if-Add Delete

Operators, Least commitment planning, Hierarchical task network planning),

Motion Planning( Basic concepts, robot? What Robot?, Space objects,- Input

Information sensing, Egress of freedom. Coordinate systems,- Motion control,

Robot programming, Motion Planning), Major Issues in Robotics( Kinematics,

Static, Feedback Control, Complaint Motion,- Trajectory modification,- Collision

Avoidance,- Motion Planning with Complete information, Motion planning with

incomplete information), Motion Planning for a Mobile Robot , Basic methods,

from a point robot to a physical robot , Which algorithm to choose), Motion

planning for Two Dimensional arm manipulator

References:

1- 'Robot Motion Planning and Control',J.-P. Laumond (Ed.),Springer-Verlag London

Limited 1998 .

2- 'Introduction to Autonomous Mobile Robots Intelligent Robotics and Autonomous

Agents ', Siegwart, Roland.; Nourbakhsh, Illah Reza ,MIT Press ,2004.

3- Elin Rich, Artificial Intelligence,1991. 4. Luger E.George,Artificial Intelligence structure and strategies, 2005.




2- Communications and Computer Networks

Data Communication, Physical Topology, Basic Network Technology, LAN Devices,

Collision and Collision Domains in Shared Layer Environments, Network Devices,

Network Layer Addressing, Network Layer Field & Datagram, IP address Class,

Subnet NW, Private Addresses, Transmission of Digital Data Interfaces and Modems,

Transmission Media, Unguided Media, Satellite Communication, Error Detection and

Correction, Data Link Control, Multiplexing, De Multiplexing, Data Link Protocols,

ARP, FTP, TELNET, DNS, UDP, TCP, NFS and RPC, SMTP, TFTP, HTTP, WAIS,

Gopher, SNMP, WWW, Browser Architecture, Methods for Assigning IP Address,

Advance ARP, DHCP, Dynamic Addressing, Routable and non Routable Protocols,

RIP Features.

References:

1- Computer Networks, 3rd Edition, A. Tannenbaum, Prentice-Hall, 1996. 2- Data Communications, Computer Networks and OSI, 4th Edition, F. Halsall,

Addison-Wesley, 1995.

3- Computer Communications and Networks, J. R. Freer, USL Press, 1996.

3- Computer and Data Security:

Introduction of Data security:-terminology, Steganography, substitution and

transposition cipher, Simple XOR, One time Pads, Computer Algorithms.

Protocol Building Blocks:- Introduction to protocols, communication using

symmetric cryptography, one way functions, one way hash functions,

communication using public key cryptography, digital signature, digital

signature with encryption random and pseudo random sequence generation

Basic Protocols:- Key Exchange, Authentication, Multiple key Public key

cryptography, secret splitting, secret sharing, cryptographic protection of data

base.

Key Length:- Symmetric key length, public key key length, comparing

Symmetric and public key key length, public key key management

Algorithm types and Modes:- electronic Code Book Mode, Block replay,

cipher block chaining mode, stream cipher, self synchronize stream cipher,

cipher-feedback mode, counter mode, other block cipher mode, choosing a

cipher mode, interleaving , block cipher vs. stream ciphers

Using Algorithms:- choosing an algorithm, public key cryptography vs.

symmetric cryptography, encrypting communication channels, encrypting data

for storage, hard ware encryption v. software encryption, compression,

encoding and encryption, detecting encryption, Hiding cipher text in cipher

text, destroying information.




Data encryption standards:- background, description of DES, security of DES.

Pseudo random sequence generator and stream:- linear congruential

generators, linear feedback shift registers, stream cipher using LFSRs, A5.

Public Key Algorithms:- Background, knapsack algorithm, RSA, Pohilig

Hellman, Rabin, ElGamal, McEliece, Elliptic Curve Cryptosystems

Public key Digital Signature Algorithm :- Digital Signature Algorithm (DSA),

DSA variants, GOST

References:

1. Cryptography and Network Security, William Stalling , 2003

4- Operating Systems:

Operating system overview , Operating system History and types:- Main frame

systems, Desktop systems, Multiprocessor systems, Distributed systems,

Clustered systems, Real time systems, Handheld systems, Computing

environment , Computer system structure , Hardware protection , operating

system structure , operating system components ,operating system services ,

processes ,process concepts , cooperating process , threads , CPU

scheduling(concepts, Scheduling Criteria, Scheduling Algorithms, First Come

First Served and Shortest Job First, Priority Scheduling algorithm and Round

Robin Algorithm, Multi level queue scheduling, multiprocessor scheduling, real

time scheduling , Introduction to Deadlocks handling , threads , Introduction to

process synchronization , Memory Management , Storage management ,

Protection and Security

References

1. Operating System Concepts by Silberschatz, Galvin and Gagne, 2003.

5- Advanced Intelligent Systems

Complexity Theory Concepts, Optimization Methods Concept, Some

Problems, Concepts of Metaheuristic, Constraint Handling, Analysis of Metaheuristic,

Single Solution Metaheuristic ( Local Search, Simulated Annealing, Tabu Search,

Iterated Local Search, Variable Neighborhood Search, Guided Local Search,

GRASP), Population Solution Metaheuristic (Evolutionary Strategy, Evolutionary

Algorithm, Scatter Search, Cultural Algorithm, Memetic Algorithm), Swarm

Intelligent (Bees Colony Algorithm, Ant Colony Algorithm, Particle Swarm

Optimization). Petri Nets Concepts, Petri Nets Components, Petri Nets Applications,

Petri Net Case Study.

References

1- Computational Intelligent by Andries P. Engelbrecht 2- Metaheuristic by Talibi Elghazali, 2006.




3- Soft Computing by Amit Konar, 2004. 4- Clever Algorithms by Bronili K., 2010.

6- Web Programming :

Introduction to Web, Introduction to the Internet, The World Wide Web, The

Internet and Web, The History and Growth of the Web, The Purpose of the Web,

The Web Concepts, The Web Site Generations, Classifying the Web Sites,

Programming Technologies, ASP Principles, Web Programming with ASP ,Web

based Applications.

References:

1. World Wide Web Consortium (W3C) ,http://www.w3c.org

2. Tim Berners-Lee Web Page,http://www.w3.org/People/Berners-Lee

3. Weaving the Web Book ,http://www.w3.org/ People/Berners- Lee/Weaving/Overview.html

4. Web Site Engineering Book , http://www.geocities.com/website_engineering/chapter01.htm

7- Machine Vision

Image Acquisition( Image representation , Image Processing , Image Analysis ,

Image Classification) , Machine Vision Techniques ( Elementary Image

processing Functions ,- Monadic Point by point operators , Intensity histogram , Look-up-table (LUT), Dyadic , point- by point ,Local operator (Neighborhood operation), Linear local operator, non-linear local operator, Edge Detections,

N- tuple operators (templates), Gray Scale Corner Detection, Segmentation , Non-

contextual technique thredsholding, Contextual technique, Pixel Connectivity, Region Similarity, Region growing, The split and merge algorithm), Mathematical

Morphology( Dila/tion and Erosion, Opening and Closing, Skeletonisation),

Pattern Recognition ( Pattern Recognition System Design, Feature Selection,

Boolean Operators, Binary object features (object measurements) , Size

management,- Shape measurement , Location measurement ,Pattern Classification

, Template matching, Distance measure, Similarity measures, Optical character

Recognition (OCR),Content Based Image Retrieval (CBIR)

References:

a. machin vision : theory, algorithms, practicalities, E. R. davies, 2004. b. computer imaging : Digital image analysis and processing, Scott E.

Umbauugh, 2005.

3. Algorithms for image processing and computer vision, J. R. parker , 1996.

8- Project.

Description for Research Project

Research project is an study proposed by teacher (supervisor) and developed by

student (fourth class only), this study aim to train the student on it is specialization of

scientific (the scientific branch in computer sciences).




Time for Research Project

The Student given full academic year for accomplishes his study.

Exam for Research Project

Research project will be evaluated by a supervisor and Committee of Experts.

Format for Research Projects

Research projects are written up in standardized format. Be formal & objective in

English language, & cite all sources. The format includes the following sections:

Title

Title would normally include the major variables of student study. For example:

A protection system for an Internet site

Abstract

Begin with a brief Abstract of the study, which summarizes the entire study into one

paragraph. The reader should be able to tell from Abstract what theory and hypothesis

were, who you studied and how, what your findings were, and what they meant for

the theory.

Introduction

The introduction includes a brief (~2-3 page) review of current theory & research in

the area of your topic. In presenting this material, paraphrase it into your own words,

but always cite the source of the information. Referencing must be complete &

correct, or you are plagiarizing, which is a serious academic offence. End with an

introduction to your study, including your hypothesis.

Method

1. Materials/Instruments , Describe any instruments employed to measure the variables

of your study. (e.g. questionnaires, tests, etc.)

2. Procedure , The Procedure section reviews exactly how you did your study, & should

include enough detail that anyone could repeat your procedure. Include your

methodology (e.g. whether you did an experiment, or observation, etc.); a review of

how you carried out the study; & any data analysis that you did.

Results

Include your results, summarized & presented in a way that is easy to follow & to

understand. If possible, these results should be presented both in a table (which would

include descriptive & inferential statistics) & in a written description of the results.




The results section should not include conclusions or interpretations; these would be

in the Discussion section.

Discussion

Use the discussion to relate your results to the theory you described in the

introduction. The "why" of your results are discussed here, & what they mean in

terms of theory & research. Add a discussion of the limitations of your study.

References

All references in the introduction are included in the reference section at the end of

the research report, in alphabetical order.

Appendix

Any information that is relevant to the study, but not needed within the body of the

paper, should be included at the end of the report. These appendices would include

further details of the research instructions, materials, results, psychological measures,

etc., if needed. Your instructor may also wish you to attach the raw data of your

project.

Elective Subjects for Forth Year

Subject No. Of

Theory

hour

No. of

Lab.

Hour

Tutorial No. of

Units

1 Intelligent Databases 2 2 1 3

2 Internet Architecture 2 - 1 2

3 Advance Intelligent

System 2 2 1 3

Date post:	14-Sep-2015
Category:	Documents
Upload:	sammy-khaleel
View:	67 times
Download:	8 times

الذكاء الصناعي

Documents