Test-1 Solution. Date: Marks: 50. Subject & Code: Artificial Intelligence and Agent technology (14SCS24)
|
|
- Alban Jenkins
- 7 years ago
- Views:
Transcription
1 Test-1 Solution Date: Marks: 50 Subject & Code: Artificial Intelligence and Agent technology (14SCS24) Name of faculty: Dr.Srikanta Murthy. K Sec: II Sem M.Tech Time: 8.30 to 10.00AM Q1). What is AI? Explain the term rationality with respect to AI Ans. AI is the study of how to make computers do things which, at the moment, people do better. But it provides a good outline of what constitutes artificial intelligence and it avoids the philosophical issues that dominate attempts to define the meaning of either artificial or intelligence. A System is rational if it performs Right Things based on the information provided to it. Thought processes & reasoning Human performance Thinking humanly Acting humanly Thinking rationally Acting rationally Ideal concept of intelligence Behavior Thinking Humanly: (The cognitive modeling approach) Most of the time it is a black box where we are not clear about our thought process. One has to know functioning of brain and its mechanism for possessing information. It is an area of cognitive science.
2 The stimuli are converted into mental representation. Cognitive processes manipulate representation to build new representations that are used to generate actions. Acting Humanly: (The Turing test approach) The overall behavior of the system should be human like. It could be achieved by observation. The Turing test proposed by Alan Turing was designed to provide a satisfactory optimal or operational definition of intelligence. Natural language processing. Knowledge representation. Automated reasoning. Machine learning. Thinking Rationally: (The laws of thought approach) Such systems rely on logic rather than human to measure correctness. For thinking rationally or logically, logic formulas and theories are used for synthesizing outcomes. For example, given John is a human and all humans are mortal then one can conclude logically that John is mortal Not all intelligent behaviors are mediated by logical deliberation. Acting Humanly: (The rational agent approach) An agent is just something that acts. Computer agents are not just programs. Computer agents acts(or)operates under autonomous control, perceive from their environment, adapts to change etc., Rational agents that acts to achive the best outcome.
3 Making correct inferences is a part of being a rational agent. A way to act rationally is to reason logically. Q2). Describe a well-defined problem? Explain the same for 8 queen problem Ans. A well-defined problem can be described by: Initial state: that the agent starts in. Operator or successor function: for any state x returns s(x), the set of states reachable from x with one action. State space: all states reachable from initial by any sequence of actions. Path: sequence through state space. Path cost: function that assigns a cost to a path. Cost of a path is the sum of costs of individual actions along the path. Goal test: test to determine if at goal state. The step cost: of taking action a to go from state x to state y is denoted by c(x,a,y). Solution to the problem is a path from the initial state to a goal state. Optimal solution has the lowest path cost among all solutions. The goal of 8-queens problem is to place 8-queens on the chessboard such that no queen attacks any other. (Queen moves Row or Column or Diagonal)
4 Fig.1 In the above Fig.1 8-Queens are on the board and none attacked. We can say this as a Goal State or Final State. There are many possible ways of arranging 8-Queens, Fig.1 is one among them. An Incremental formulation involves for 8-queens problem, each action adds a queen to the state. A complete-state formulation starts with all 8 queens on the board and moves them around. In either case the path cost is of no interest because only the final state counts. States: Any arrangement of 0 to 8 queens on board is a state. Initial state: No queen on the board. Successor function: Add a queen to any empty square. Goal Test: 8 queens are on the board, none attacked.
5 Q3). What are problem characteristics? Explain the DFS and BFS Ans. The problem characteristics are: 1. Is the problem decomposable into a set of nearly independent smaller or easier sub problems? 2. Can the solution steps be ignored or at least undone if they prove unwise? 3. Is the problem's universe predictable? 4. Is a good solution to the problem obvious without comparison to all other possible solutions? 5. Is the desired solution a state of the world or a path to a state? 6. Is a large amount of knowledge absolutely required to solve this problem or is knowledge important only to constrain the search? 7. Can a computer that is simply given the problem return the solution or will the solution of the problem require interaction between the computer and a person? ALGORITHM: BREADTH-FIRST SEARCH 1. Create a variable called NODE-LIST and set it to the initial state. 2. Loop until the goal state is found or NODE-LIST is empty. a. Remove the first element, say E, from the NODE-LIST. If NODE- LIST was empty then quit. b. For each way that each rule can match the state described in E do: i) Apply the rule to generate a new state. ii) If the new state is the goal state, quit and return this state. iii) Otherwise add this state to the end of NODE-LIST ADVANTAGES OF BREADTH-FIRST SEARCH 1. Breadth first search will never get trapped exploring the useless path forever. 2. If there is a solution, BFS will definitely find it out. 3. If there is more than one solution then BFS can find the minimal one that requires less number of steps. DISADVANTAGES OF BREADTH-FIRST SEARCH 1. The main drawback of Breadth first search is its memory requirement. Since each level of the tree must be saved in order to generate the next level, and the amount
6 of memory is proportional to the number of nodes stored, the space complexity of BFS is O(b d ). As a result, BFS is severely space-bound in practice so will exhaust the memory available on typical computers in a matter of minutes. 2. If the solution is farther away from the root, breath first search will consume lot of time. ALGORITHM: DEPTH FIRST SEARCH 1. If the initial state is a goal state, quit and return success. 2. Otherwise, loop until success or failure is signaled. a. Generate a state, say E, and let it be the successor of the initial state. If there is no successor, signal failure. b. Call Depth-First Search with E as the initial state. c. If success is returned, signal success. Otherwise continue in this loop. ADVANTAGES OF DEPTH-FIRST SEARCH The advantage of depth-first Search is that memory requirement is only linear with respect to the search graph. This is in contrast with breadth-first search which requires more space. The reason is that the algorithm only needs to store a stack of nodes on the path from the root to the current node. The time complexity of a depth-first Search to depth d is O(b^d) since it generates the same set of nodes as breadth-first search, but simply in a different order. Thus practically depth-first search is time-limited rather than space-limited. If depth-first search finds solution without exploring much in a path then the time and space it takes will be very less. DISADVANTAGES OF DEPTH-FIRST SEARCH The disadvantage of Depth-First Search is that there is a possibility that it may go down the left-most path forever. Even a finite graph can generate an infinite tree. Depth-First Search is not guaranteed to find the solution. And there is no guarantee to find a minimal solution, if more than one solution exists.
7 Q4). Explain production systems. Write the production rules for water-jug problem Ans. Knowledge representation formalism consists of collections of condition-action rules (Production Rules or Operators), a database which is modified in accordance with the rules, and a Production System Interpreter which controls the operation of the rules i.e., the 'control mechanism' of a Production System, determining the order in which Production Rules are fired. A system that uses this form of knowledge representation is called a production system. Components of an AI production system are: 1. A set of production rules each consisting of a left side the applicability of the rule and the right side the operations to be performed; 2. One or more knowledge bases containing the required information for each task; 3. A control strategy that specifies the order in which the rules will be compared to the database and ways of resolving conflict; 4. Rule applier Control Strategy or Control Structure. Production Rules for water-jug: S.No Condition Action Explanation 1 (x, y) If x<4 2 (x, y) If y<3 3 (x, y) If x>0 4 (x, y) If y>0 5 (x, y) If x>0 (4, y) (x, 3) (x-d, y) (x, y-d) (0, y) Fill the 4-gallon jug. Fill the 3-gallon jug. Pour some water out of the 4-gallon jug Pour some water out of the 3-gallon jug Empty the 4-gallon jug on the ground
8 6 (x, y) If y>0 7 (x, y) If x+y 4 & y>0 8 (x, y) If x+y 3 & x>0 (x, 0) (4, y-(4-x)) (x-(3-y), 3) Empty the 3-gallon jug on the ground Pour water from the 3-gallon jug into the 4-gallon jug until the 4-gallon jug is full Pour water from the 4-gallon jug into the 3-gallon jug until the 3-gallon jug is full Pour all the water from the 3-gallon jug 9 (x, y) (x+y, 0) If x+y 4 & y>0 into the 4-gallon jug 10 (x, y) (0, x+y) Pour all the water from the 4-gallon jug If x+y 3 & x>0 into the 3-gallon jug 11 (0, 2) (2, 0) Pour the 2-gallons from the 3-gallon jug into the 4-gallon jug 12 (2, y) (0, y) Empty the 2-gallons in the 4-gallon jug on the ground Q5). What is an Agent? What does Task Environment means? Give PEAS description for an automated taxi. Ans. "An agent is anything that can be viewed as perceiving its environment through sensors and acting upon that environment through effectors." Agent Sensors Environment? Actuators
9 Example: A human agent has eyes, ears, and other organs for sensors and hands, legs, mouth, and other body parts for actuators. A robotic agent might have cameras and infrared range finders for sensors and various motors for actuators. A software agent receives keystrokes, file contents, and network packets as sensory inputs and acts on the environment by displaying on the screen, writing files, and sending network packets. Vacuum-Cleaner World This world has two locations only A & B. The vacuum agent perceives where it is( in A or B) and whether there is dirt or not. Percepts: location and contents, e.g., [A,Dirty] Actions: Left, Right, Suck, NoOp. Simplest agent function: if current location( say A) is dirty then suck else move to location B In the simple vacuum-cleaner agent, we had to specify the performance measure, the environment, and the agent s actuators and sensors. By grouping these we can call as Task Environment. Task Environments are the problems and rational agents are solution to it. Properties of task environment: Fully observable vs. partially observable Deterministic vs. stochastic Episodic vs. sequential Static vs. dynamic
10 Discrete vs. continuous Single agent vs. multi-agent PEAS description for automated taxi: Agent Type Taxi driver Performance Measure Safe, fast, legal, comfortable trip, maximize profits Environment Actuators Sensors Roads, other traffic, pedestrians, customers Steering, accelerator, break, signal, horn, display Cameras, sonar, speedometer, GPS, odometer, accelerometer, engine, sensors, keyboard
Artificial Intelligence
Artificial Intelligence ICS461 Fall 2010 Nancy E. Reed nreed@hawaii.edu 1 Lecture #2- Intelligent Agents What is an intelligent? Agents and s Rationality PEAS (Performance measure, Environment, Actuators,
More informationChapter 2: Intelligent Agents
Chapter 2: Intelligent Agents Outline Last class, introduced AI and rational agent Today s class, focus on intelligent agents Agent and environments Nature of environments influences agent design Basic
More informationChapter 2 Intelligent Agents
1 Chapter 2 Intelligent Agents CS 461 Artificial Intelligence Pinar Duygulu Bilkent University, Spring 2008 Slides are mostly adapted from AIMA Outline 2 Agents and environments Rationality PEAS (Performance
More informationIntroduction to Artificial Intelligence. Intelligent Agents
Introduction to Artificial Intelligence Intelligent Agents Bernhard Beckert UNIVERSITÄT KOBLENZ-LANDAU Winter Term 2004/2005 B. Beckert: KI für IM p.1 Outline Agents and environments PEAS (Performance,
More informationMeasuring the Performance of an Agent
25 Measuring the Performance of an Agent The rational agent that we are aiming at should be successful in the task it is performing To assess the success we need to have a performance measure What is rational
More informationIntelligent Agents. Chapter 2. Chapter 2 1
Intelligent Agents Chapter 2 Chapter 2 1 Reminders Assignment 0 (lisp refresher) due 1/28 Lisp/emacs/AIMA tutorial: 11-1 today and Monday, 271 Soda Chapter 2 2 Outline Agents and environments Rationality
More informationcs171 HW 1 - Solutions
1. (Exercise 2.3 from RN) For each of the following assertions, say whether it is true or false and support your answer with examples or counterexamples where appropriate. (a) An agent that senses only
More informationAgents: Rationality (2)
Agents: Intro Agent is entity that perceives and acts Perception occurs via sensors Percept is one unit of sensory input Percept sequence is complete history of agent s percepts In general, agent s actions
More informationAI: A Modern Approach, Chpts. 3-4 Russell and Norvig
AI: A Modern Approach, Chpts. 3-4 Russell and Norvig Sequential Decision Making in Robotics CS 599 Geoffrey Hollinger and Gaurav Sukhatme (Some slide content from Stuart Russell and HweeTou Ng) Spring,
More informationCourse Outline Department of Computing Science Faculty of Science. COMP 3710-3 Applied Artificial Intelligence (3,1,0) Fall 2015
Course Outline Department of Computing Science Faculty of Science COMP 710 - Applied Artificial Intelligence (,1,0) Fall 2015 Instructor: Office: Phone/Voice Mail: E-Mail: Course Description : Students
More informationCSC384 Intro to Artificial Intelligence
CSC384 Intro to Artificial Intelligence What is Artificial Intelligence? What is Intelligence? Are these Intelligent? CSC384, University of Toronto 3 What is Intelligence? Webster says: The capacity to
More information6.099, Spring Semester, 2006 Assignment for Week 13 1
6.099, Spring Semester, 2006 Assignment for Week 13 1 MASSACHVSETTS INSTITVTE OF TECHNOLOGY Department of Electrical Engineering and Computer Science 6.099 Introduction to EECS I Spring Semester, 2006
More informationActing humanly: The Turing test. Artificial Intelligence. Thinking humanly: Cognitive Science. Outline. What is AI?
Acting humanly: The Turing test Artificial Intelligence Turing (1950) Computing machinery and intelligence : Can machines think? Can machines behave intelligently? Operational test for intelligent behavior:
More informationCPSC 211 Data Structures & Implementations (c) Texas A&M University [ 313]
CPSC 211 Data Structures & Implementations (c) Texas A&M University [ 313] File Structures A file is a collection of data stored on mass storage (e.g., disk or tape) Why on mass storage? too big to fit
More informationProblem solving and search
Problem solving and search hapter 3 hapter 3 1 eminders ssignment 0 due 5pm today ssignment 1 posted, due 2/9 ection 105 will move to 9-10am starting next week hapter 3 2 Outline Problem-solving agents
More informationIntroduction to Artificial Intelligence
Introduction to Artificial Intelligence Kalev Kask ICS 271 Fall 2014 http://www.ics.uci.edu/~kkask/fall-2014 CS271/ Course requirements Assignments: There will be weekly homework assignments, a project,
More information2 SYSTEM DESCRIPTION TECHNIQUES
2 SYSTEM DESCRIPTION TECHNIQUES 2.1 INTRODUCTION Graphical representation of any process is always better and more meaningful than its representation in words. Moreover, it is very difficult to arrange
More informationRegular Languages and Finite Automata
Regular Languages and Finite Automata 1 Introduction Hing Leung Department of Computer Science New Mexico State University Sep 16, 2010 In 1943, McCulloch and Pitts [4] published a pioneering work on a
More information5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.
1. The advantage of.. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. [A] Lists [B] Linked Lists [A] Trees [A] Queues 2. The
More informationFall 2012 Q530. Programming for Cognitive Science
Fall 2012 Q530 Programming for Cognitive Science Aimed at little or no programming experience. Improve your confidence and skills at: Writing code. Reading code. Understand the abilities and limitations
More informationSmart Graphics: Methoden 3 Suche, Constraints
Smart Graphics: Methoden 3 Suche, Constraints Vorlesung Smart Graphics LMU München Medieninformatik Butz/Boring Smart Graphics SS2007 Methoden: Suche 2 Folie 1 Themen heute Suchverfahren Hillclimbing Simulated
More informationSimulation-based traffic management for autonomous and connected vehicles
Simulation-based traffic management for autonomous and connected vehicles Paweł Gora Faculty of Mathematics, Informatics and Mechanics University of Warsaw ITS Kraków, 3-4.12.2015 Axioms Vehicles may communicate
More informationWhat is Artificial Intelligence?
CSE 3401: Intro to Artificial Intelligence & Logic Programming Introduction Required Readings: Russell & Norvig Chapters 1 & 2. Lecture slides adapted from those of Fahiem Bacchus. 1 What is AI? What is
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationDefinitions. A [non-living] physical agent that performs tasks by manipulating the physical world. Categories of robots
Definitions A robot is A programmable, multifunction manipulator designed to move material, parts, tools, or specific devices through variable programmed motions for the performance of a variety of tasks.
More informationBy: M.Habibullah Pagarkar Kaushal Parekh Jogen Shah Jignasa Desai Prarthna Advani Siddhesh Sarvankar Nikhil Ghate
AUTOMATED VEHICLE CONTROL SYSTEM By: M.Habibullah Pagarkar Kaushal Parekh Jogen Shah Jignasa Desai Prarthna Advani Siddhesh Sarvankar Nikhil Ghate Third Year Information Technology Engineering V.E.S.I.T.
More informationNetwork (Tree) Topology Inference Based on Prüfer Sequence
Network (Tree) Topology Inference Based on Prüfer Sequence C. Vanniarajan and Kamala Krithivasan Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai 600036 vanniarajanc@hcl.in,
More informationAUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS
TKK Reports in Information and Computer Science Espoo 2009 TKK-ICS-R26 AUTOMATED TEST GENERATION FOR SOFTWARE COMPONENTS Kari Kähkönen ABTEKNILLINEN KORKEAKOULU TEKNISKA HÖGSKOLAN HELSINKI UNIVERSITY OF
More informationSOLVING PROBLEMS BY SEARCHING
3 SOLVING PROBLEMS BY SEARCHING In which we see how an agent can find a sequence of actions that achieves its goals, when no single action will do. PROBLEM SOLVING AGENT The simplest agents discussed in
More information6.080/6.089 GITCS Feb 12, 2008. Lecture 3
6.8/6.89 GITCS Feb 2, 28 Lecturer: Scott Aaronson Lecture 3 Scribe: Adam Rogal Administrivia. Scribe notes The purpose of scribe notes is to transcribe our lectures. Although I have formal notes of my
More informationSYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis
SYSM 6304: Risk and Decision Analysis Lecture 5: Methods of Risk Analysis M. Vidyasagar Cecil & Ida Green Chair The University of Texas at Dallas Email: M.Vidyasagar@utdallas.edu October 17, 2015 Outline
More informationProceedings of the 9th WSEAS International Conference on APPLIED COMPUTER SCIENCE
Automated Futures Trading Environment Effect on the Decision Making PETR TUCNIK Department of Information Technologies University of Hradec Kralove Rokitanskeho 62, 500 02 Hradec Kralove CZECH REPUBLIC
More informationAutomata-based Verification - I
CS3172: Advanced Algorithms Automata-based Verification - I Howard Barringer Room KB2.20: email: howard.barringer@manchester.ac.uk March 2006 Supporting and Background Material Copies of key slides (already
More informationA Review of Intelligent Agents
A Review of Intelligent Agents K.Suganya 1 1 Associate Professor, Department of Software Engineering & IT(PG), A.V.C College of Engineering, Mayiladuthurai Email- ksuganya2002@yahoo.com ABSTRACT An intelligent
More informationPROG0101 Fundamentals of Programming PROG0101 FUNDAMENTALS OF PROGRAMMING. Chapter 3 Algorithms
PROG0101 FUNDAMENTALS OF PROGRAMMING Chapter 3 1 Introduction to A sequence of instructions. A procedure or formula for solving a problem. It was created mathematician, Mohammed ibn-musa al-khwarizmi.
More informationCSE 135: Introduction to Theory of Computation Decidability and Recognizability
CSE 135: Introduction to Theory of Computation Decidability and Recognizability Sungjin Im University of California, Merced 04-28, 30-2014 High-Level Descriptions of Computation Instead of giving a Turing
More informationGame playing. Chapter 6. Chapter 6 1
Game playing Chapter 6 Chapter 6 1 Outline Games Perfect play minimax decisions α β pruning Resource limits and approximate evaluation Games of chance Games of imperfect information Chapter 6 2 Games vs.
More informationINTRUSION PREVENTION AND EXPERT SYSTEMS
INTRUSION PREVENTION AND EXPERT SYSTEMS By Avi Chesla avic@v-secure.com Introduction Over the past few years, the market has developed new expectations from the security industry, especially from the intrusion
More informationCost Model: Work, Span and Parallelism. 1 The RAM model for sequential computation:
CSE341T 08/31/2015 Lecture 3 Cost Model: Work, Span and Parallelism In this lecture, we will look at how one analyze a parallel program written using Cilk Plus. When we analyze the cost of an algorithm
More informationAdvanced Programming with LEGO NXT MindStorms
Advanced Programming with LEGO NXT MindStorms Presented by Tom Bickford Executive Director Maine Robotics Advanced topics in MindStorms Loops Switches Nested Loops and Switches Data Wires Program view
More informationSYSTEMS, CONTROL AND MECHATRONICS
2015 Master s programme SYSTEMS, CONTROL AND MECHATRONICS INTRODUCTION Technical, be they small consumer or medical devices or large production processes, increasingly employ electronics and computers
More informationINTELLIGENT AGENTS 2.1 INTRODUCTION 2.2 HOW AGENTS SHOULD ACT
2 INTELLIGENT AGENTS In which we discuss what an intelligent agent does,how it is related to its environment, how it is evaluated, and how we might go about building one. 2.1 INTRODUCTION An agent is anything
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationProfessor, D.Sc. (Tech.) Eugene Kovshov MSTU «STANKIN», Moscow, Russia
Professor, D.Sc. (Tech.) Eugene Kovshov MSTU «STANKIN», Moscow, Russia As of today, the issue of Big Data processing is still of high importance. Data flow is increasingly growing. Processing methods
More informationRobotics. Chapter 25. Chapter 25 1
Robotics Chapter 25 Chapter 25 1 Outline Robots, Effectors, and Sensors Localization and Mapping Motion Planning Motor Control Chapter 25 2 Mobile Robots Chapter 25 3 Manipulators P R R R R R Configuration
More informationWhy? A central concept in Computer Science. Algorithms are ubiquitous.
Analysis of Algorithms: A Brief Introduction Why? A central concept in Computer Science. Algorithms are ubiquitous. Using the Internet (sending email, transferring files, use of search engines, online
More informationSupplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 1 Section 1 Real Numbers
Supplemental Worksheet Problems To Accompany: The Pre-Algebra Tutor: Volume 1 Please watch Section 1 of this DVD before working these problems. The DVD is located at: http://www.mathtutordvd.com/products/item66.cfm
More informationAbout the Author. The Role of Artificial Intelligence in Software Engineering. Brief History of AI. Introduction 2/27/2013
About the Author The Role of Artificial Intelligence in Software Engineering By: Mark Harman Presented by: Jacob Lear Mark Harman is a Professor of Software Engineering at University College London Director
More information5. Binary objects labeling
Image Processing - Laboratory 5: Binary objects labeling 1 5. Binary objects labeling 5.1. Introduction In this laboratory an object labeling algorithm which allows you to label distinct objects from a
More informationFormal Verification and Linear-time Model Checking
Formal Verification and Linear-time Model Checking Paul Jackson University of Edinburgh Automated Reasoning 21st and 24th October 2013 Why Automated Reasoning? Intellectually stimulating and challenging
More informationContinuous vs. Discontinuous Nature vs. Nurture
Piaget s Theory The first cognitive theory, developed by Jean Piaget beginning about 1920. Piaget observed and described children at different ages. His theory is very broad, from birth adolescence, and
More informationDevelopment of a Network Configuration Management System Using Artificial Neural Networks
Development of a Network Configuration Management System Using Artificial Neural Networks R. Ramiah*, E. Gemikonakli, and O. Gemikonakli** *MSc Computer Network Management, **Tutor and Head of Department
More informationAlgorithms and Data S tructures Structures Stack, Queues, and Applications Applications Ulf Leser
Algorithms and Data Structures Stack, Queues, and Applications Ulf Leser Content of this Lecture Stacks and Queues Tree Traversal Towers of Hanoi Ulf Leser: Alg&DS, Summer semester 2011 2 Stacks and Queues
More informationTesting LTL Formula Translation into Büchi Automata
Testing LTL Formula Translation into Büchi Automata Heikki Tauriainen and Keijo Heljanko Helsinki University of Technology, Laboratory for Theoretical Computer Science, P. O. Box 5400, FIN-02015 HUT, Finland
More informationArtificial Intelligence
Artificial Intelligence Chapter 1 Chapter 1 1 Outline What is AI? A brief history The state of the art Chapter 1 2 What is AI? Systems that think like humans Systems that think rationally Systems that
More informationKS3 Computing Group 1 Programme of Study 2015 2016 2 hours per week
1 07/09/15 2 14/09/15 3 21/09/15 4 28/09/15 Communication and Networks esafety Obtains content from the World Wide Web using a web browser. Understands the importance of communicating safely and respectfully
More informationFast Sequential Summation Algorithms Using Augmented Data Structures
Fast Sequential Summation Algorithms Using Augmented Data Structures Vadim Stadnik vadim.stadnik@gmail.com Abstract This paper provides an introduction to the design of augmented data structures that offer
More information(Refer Slide Time: 2:03)
Control Engineering Prof. Madan Gopal Department of Electrical Engineering Indian Institute of Technology, Delhi Lecture - 11 Models of Industrial Control Devices and Systems (Contd.) Last time we were
More informationIntelligent Agents. Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge
Intelligent Agents Based on An Introduction to MultiAgent Systems and slides by Michael Wooldridge Denition of an Agent An agent is a computer system capable of autonomous action in some environment, in
More informationRobot coined by Karel Capek in a 1921 science-fiction Czech play
Robotics Robot coined by Karel Capek in a 1921 science-fiction Czech play Definition: A robot is a reprogrammable, multifunctional manipulator designed to move material, parts, tools, or specialized devices
More informationDATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
More informationCognitive Development
LP 9C Piaget 1 Cognitive Development Piaget was intrigued by the errors in thinking children made. To investigate how these errors and how thinking changes as we grow older, Jean Piaget carefully observed
More informationY. Xiang, Constraint Satisfaction Problems
Constraint Satisfaction Problems Objectives Constraint satisfaction problems Backtracking Iterative improvement Constraint propagation Reference Russell & Norvig: Chapter 5. 1 Constraints Constraints are
More informationReading 13 : Finite State Automata and Regular Expressions
CS/Math 24: Introduction to Discrete Mathematics Fall 25 Reading 3 : Finite State Automata and Regular Expressions Instructors: Beck Hasti, Gautam Prakriya In this reading we study a mathematical model
More informationAppendices master s degree programme Artificial Intelligence 2014-2015
Appendices master s degree programme Artificial Intelligence 2014-2015 Appendix I Teaching outcomes of the degree programme (art. 1.3) 1. The master demonstrates knowledge, understanding and the ability
More informationWorking with whole numbers
1 CHAPTER 1 Working with whole numbers In this chapter you will revise earlier work on: addition and subtraction without a calculator multiplication and division without a calculator using positive and
More informationMulti-ultrasonic sensor fusion for autonomous mobile robots
Multi-ultrasonic sensor fusion for autonomous mobile robots Zou Yi *, Ho Yeong Khing, Chua Chin Seng, and Zhou Xiao Wei School of Electrical and Electronic Engineering Nanyang Technological University
More informationRobotics and Automation Blueprint
Robotics and Automation Blueprint This Blueprint contains the subject matter content of this Skill Connect Assessment. This Blueprint does NOT contain the information one would need to fully prepare for
More informationOmega Automata: Minimization and Learning 1
Omega Automata: Minimization and Learning 1 Oded Maler CNRS - VERIMAG Grenoble, France 2007 1 Joint work with A. Pnueli, late 80s Summary Machine learning in general and of formal languages in particular
More informationMANAGING QUEUE STABILITY USING ART2 IN ACTIVE QUEUE MANAGEMENT FOR CONGESTION CONTROL
MANAGING QUEUE STABILITY USING ART2 IN ACTIVE QUEUE MANAGEMENT FOR CONGESTION CONTROL G. Maria Priscilla 1 and C. P. Sumathi 2 1 S.N.R. Sons College (Autonomous), Coimbatore, India 2 SDNB Vaishnav College
More informationSolving Linear Systems, Continued and The Inverse of a Matrix
, Continued and The of a Matrix Calculus III Summer 2013, Session II Monday, July 15, 2013 Agenda 1. The rank of a matrix 2. The inverse of a square matrix Gaussian Gaussian solves a linear system by reducing
More informationParticles, Flocks, Herds, Schools
CS 4732: Computer Animation Particles, Flocks, Herds, Schools Robert W. Lindeman Associate Professor Department of Computer Science Worcester Polytechnic Institute gogo@wpi.edu Control vs. Automation Director's
More informationTuring Machines: An Introduction
CIT 596 Theory of Computation 1 We have seen several abstract models of computing devices: Deterministic Finite Automata, Nondeterministic Finite Automata, Nondeterministic Finite Automata with ɛ-transitions,
More informationMECE 102 Mechatronics Engineering Orientation
MECE 102 Mechatronics Engineering Orientation Mechatronic System Components Associate Prof. Dr. of Mechatronics Engineering Çankaya University Compulsory Course in Mechatronics Engineering Credits (2/0/2)
More informationAnalysis of Micromouse Maze Solving Algorithms
1 Analysis of Micromouse Maze Solving Algorithms David M. Willardson ECE 557: Learning from Data, Spring 2001 Abstract This project involves a simulation of a mouse that is to find its way through a maze.
More informationIntroduction to Learning & Decision Trees
Artificial Intelligence: Representation and Problem Solving 5-38 April 0, 2007 Introduction to Learning & Decision Trees Learning and Decision Trees to learning What is learning? - more than just memorizing
More informationIntroduction to MATLAB IAP 2008
MIT OpenCourseWare http://ocw.mit.edu Introduction to MATLAB IAP 2008 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. Introduction to Matlab Ideas for
More informationBUSINESS RULES CONCEPTS... 2 BUSINESS RULE ENGINE ARCHITECTURE... 4. By using the RETE Algorithm... 5. Benefits of RETE Algorithm...
1 Table of Contents BUSINESS RULES CONCEPTS... 2 BUSINESS RULES... 2 RULE INFERENCE CONCEPT... 2 BASIC BUSINESS RULES CONCEPT... 3 BUSINESS RULE ENGINE ARCHITECTURE... 4 BUSINESS RULE ENGINE ARCHITECTURE...
More informationArtificial Neural Networks and Support Vector Machines. CS 486/686: Introduction to Artificial Intelligence
Artificial Neural Networks and Support Vector Machines CS 486/686: Introduction to Artificial Intelligence 1 Outline What is a Neural Network? - Perceptron learners - Multi-layer networks What is a Support
More informationWhitepaper. Image stabilization improving camera usability
Whitepaper Image stabilization improving camera usability Table of contents 1. Introduction 3 2. Vibration Impact on Video Output 3 3. Image Stabilization Techniques 3 3.1 Optical Image Stabilization 3
More informationChapter 5. The Sensual and Perceptual Theories of Visual Communication
Chapter 5. The Sensual and Perceptual Theories of Visual Communication Sensual Theories of Visual Communication Gestalt & Constructivism Gestalt=form or shape Max Wertheimer (1910) the whole is different
More informationLecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs
CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like
More informationData Structure [Question Bank]
Unit I (Analysis of Algorithms) 1. What are algorithms and how they are useful? 2. Describe the factor on best algorithms depends on? 3. Differentiate: Correct & Incorrect Algorithms? 4. Write short note:
More information2) Write in detail the issues in the design of code generator.
COMPUTER SCIENCE AND ENGINEERING VI SEM CSE Principles of Compiler Design Unit-IV Question and answers UNIT IV CODE GENERATION 9 Issues in the design of code generator The target machine Runtime Storage
More informationEastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
More informationMATHEMATICS: CONCEPTS, AND FOUNDATIONS Vol. III - Logic and Computer Science - Phokion G. Kolaitis
LOGIC AND COMPUTER SCIENCE Phokion G. Kolaitis Computer Science Department, University of California, Santa Cruz, CA 95064, USA Keywords: algorithm, Armstrong s axioms, complete problem, complexity class,
More informationMEng, BSc Computer Science with Artificial Intelligence
School of Computing FACULTY OF ENGINEERING MEng, BSc Computer Science with Artificial Intelligence Year 1 COMP1212 Computer Processor Effective programming depends on understanding not only how to give
More informationFPGA area allocation for parallel C applications
1 FPGA area allocation for parallel C applications Vlad-Mihai Sima, Elena Moscu Panainte, Koen Bertels Computer Engineering Faculty of Electrical Engineering, Mathematics and Computer Science Delft University
More information3515ICT Theory of Computation Turing Machines
Griffith University 3515ICT Theory of Computation Turing Machines (Based loosely on slides by Harald Søndergaard of The University of Melbourne) 9-0 Overview Turing machines: a general model of computation
More informationReliability Guarantees in Automata Based Scheduling for Embedded Control Software
1 Reliability Guarantees in Automata Based Scheduling for Embedded Control Software Santhosh Prabhu, Aritra Hazra, Pallab Dasgupta Department of CSE, IIT Kharagpur West Bengal, India - 721302. Email: {santhosh.prabhu,
More information. 0 1 10 2 100 11 1000 3 20 1 2 3 4 5 6 7 8 9
Introduction The purpose of this note is to find and study a method for determining and counting all the positive integer divisors of a positive integer Let N be a given positive integer We say d is a
More informationAlgorithm & Flowchart & Pseudo code. Staff Incharge: S.Sasirekha
Algorithm & Flowchart & Pseudo code Staff Incharge: S.Sasirekha Computer Programming and Languages Computers work on a set of instructions called computer program, which clearly specify the ways to carry
More informationSymbol Tables. Introduction
Symbol Tables Introduction A compiler needs to collect and use information about the names appearing in the source program. This information is entered into a data structure called a symbol table. The
More informationOperation Count; Numerical Linear Algebra
10 Operation Count; Numerical Linear Algebra 10.1 Introduction Many computations are limited simply by the sheer number of required additions, multiplications, or function evaluations. If floating-point
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationGame Theory 1. Introduction
Game Theory 1. Introduction Dmitry Potapov CERN What is Game Theory? Game theory is about interactions among agents that are self-interested I ll use agent and player synonymously Self-interested: Each
More informationE190Q Lecture 5 Autonomous Robot Navigation
E190Q Lecture 5 Autonomous Robot Navigation Instructor: Chris Clark Semester: Spring 2014 1 Figures courtesy of Siegwart & Nourbakhsh Control Structures Planning Based Control Prior Knowledge Operator
More informationSimplex method summary
Simplex method summary Problem: optimize a linear objective, subject to linear constraints 1. Step 1: Convert to standard form: variables on right-hand side, positive constant on left slack variables for
More informationCOMP 250 Fall 2012 lecture 2 binary representations Sept. 11, 2012
Binary numbers The reason humans represent numbers using decimal (the ten digits from 0,1,... 9) is that we have ten fingers. There is no other reason than that. There is nothing special otherwise about
More informationModule 3: Correlation and Covariance
Using Statistical Data to Make Decisions Module 3: Correlation and Covariance Tom Ilvento Dr. Mugdim Pašiƒ University of Delaware Sarajevo Graduate School of Business O ften our interest in data analysis
More information