III/IV B.Tech, (Regular/Supplementary) DEGREE EXAMINATION
|
|
- Marybeth Carter
- 6 years ago
- Views:
Transcription
1 November, 2016 Fifth Semester Time: Three Hours Answer Question No.1 compulsorily. Answer ONE question from each unit. III/IV B.Tech, (Regular/Supplementary) DEGREE EXAMINATION 14CS506/A Computer Science &Engineering Artificial Intelligence Maximum : 60 Marks (1X12 = 12 Marks) (4X12=48 Marks) 1. Answer all questions (1X12=12 Marks) a) Define state space. State space is a set of legal positions. Starting at the initial state using the set of rules to move from one state to another. Attempting to end up in a goal state Problem solving = Searching for a goal state. b) Define Constraint Satisfaction Problem. Constraint Satisfaction Problem is a goal to discover some problem state using given set of constraints. c) What is heuristic search technique. Heuristic technique improves the efficiency of a search process, possibly by sacrificing claims of completeness or optimality.heuristics are like tour guide d) State the fundamental goal of Knowledge Representation. The fundamental goal is to represent knowledge in a manner that facilitates inferencing (i.e. drawing conclusions) from knowledge. e) What is ridge? Ridge is a special kind of local maxima.it is an area of search space that is higher than surrounding areas and that itself has a slope. f) What are the three levels in describing knowledge based agent? Knowledge Level Logical Level Implementation Level g) List the components of a script. Entry Conditions Results Props Track Roles Scenes h) What are the different types of planning? Goal Stack Planning Non Linear Planning Hierarchical Planning i) What is goal stack planning? Goal Stack Planning is used to handle interactive compound goals. Here the stack contains goals, operators. j) What is meant by learning? Learning is a an area of AI that focusses on processes of self-improvement. k) Write are the Applications of Expert System? MYCIN DENDRAL
2 DEVICE ADVISOR PROSPECTOR EMYCIN l) Give the classification of learning process. Learning by Induction Learning by taking advice Skill Refinement Problem Solving UNIT I 2. a) Explain Artificial Intelligence with suitable example. Artificial Intelligence: The study of how to make computers do things which at the moment people do better. Any Example b) Discuss in detail about the characteristics of various categories of problems. 1)Is the problem decomposable into a set of independent smaller or easier sub problems? At each step it checks to see whether the problem it is working on is immediately solvable. Is so, the answer is returned directly. If the problem is not easily solvable, the integrator checks to see whether it can decompose the problem into smaller problems. If it can, it creates those problems and calls itself recursively on them, using this technique of problem decomposition. 2)Can solution steps be ignored or at least undone if they prove unwise? It illustrates the differences between 3 important problems: Ignorable, in which solution steps can be ignored. Recoverable, in which solution steps can be undone. Irrecoverable, in which solution steps cannot be undone. 3)Is the problem universe predictable? For solving certain-outcome problems, open-loop approach will work fine since the result of an action can be predicted perfectly. For uncertain-outcome problems, planning can at best generate a sequence of operators that has a good probability of leading to a solution. 4)Is a good solution to the problem obvious without comparison to all other possible solutions? For a question we follow one path successfully to an answer, there is no reason to go back and see if some other path might also lead to a solution. 5)Is the desired solution a state of the world or a path to a state? A statement of the solution to the problem must be a sequence of operations that produce a final state. 6)Is a large amount of knowledge absolutely required to solve the problem, or is knowledge important only to constraint the search? A lot knowledge is important only to constrain the search for a solution and those for which a lot of knowledge is required even to be able to recognize a solution 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? (OR) 3. a) Given an example of a problem for which breadth-first search would work better than depth-first search. BFS:
3 BFS starts traversal from the root node and then explore the search in the level by level manner i.e. as close as possible from the root node. It can be done with the help of queue i.e. FIFO implementation. This algorithm works in single stage. The visited vertices are removed from the queue and then displayed at once. BFS is useful in finding shortest path.bfs can be used to find the shortest distance between some starting node and the remaining nodes of the graph. DFS: DFS starts the traversal from the root node and explore the search as far as possible from the root node i.e. depth wise. It can be done with the help of Stack i.e. LIFO implementations. This algorithm works in two stages in the first stage the visited vertices are pushed onto the stack and later on when there is no vertex further to visit those are popped-off. DFS in not so useful in finding shortest path. It is used to perform a traversal of a general graph and the idea of DFS is to make a path as long as possible, and then go back (backtrack) to add branches also as long as possible. b) Explain the algorithm for steepest hill climbing. 1. Evaluate the initial state. If it is also a goal state, then return it and quit. Otherwise, continue with the initial state as the current state. 2. Loop until a solution is found or until a complete iteration produces no change to current state: a) Let SUCC be a state such that any possible successor of the current state will be better then SUCC. b) For each operator that applies to the current state do: i. Apply the operator and generate a new state. ii.evaluate the new state. If it is goal state, then return it and quit. If not, compare it to SUCC. If it is better, then set SUCC to this state. If it is not better, leave SUCC alone. c) If the SUCC is better than current state, then set current state to SUCC. UNIT II 4. a) Discuss various approaches in knowledge Representation Declarative Knowledge:It is the simplest way of storing facts by using a relational method where each fact about a set of objects is set out systematically in columns. This representation gives little opportunity for inference but it can be used as the knowledge basis for inference engines. A simple way to store facts. Each fact about a set of objects is set out systematically in columns. Little opportunity for inference. Knowledge basis for inference engines. Procedural Knowledge: The basic idea of procedural knowledge is to encode the knowledge in some procedures. These procedures may include small programs that know how to do specific things
4 and how to proceed. b) Briefly discuss about different matching techniques. INDEXING The one way to select applicable rules is to do a simple search through all the rules,comparing each ones predictions to the current state and extracting all the ones that match. But there 2 problems with the simple solutions. To solve very interesting problems,it will be necessary to use a large number of rules. Scanning through all of them at every step of the search would be hopelessly inefficient. It is not always immediately obvious whether a rules predictions of satisfied by a particular state. MATCHING WITH VARIABLES The temporal nature of data.rules usually do not alter the state description radically. Instead,a rule will typically add one or two elements,or perhaps delete one or two,but most of state description remains the same. Full matching is only pursued for candidates that could be affected by incoming or outgoing data. Structural similarity in rules.different rules may share a large number of preconditions. Persistence of variable binding consistence while all the individual preconditions of a rule might be met, there may be variable binding conflicts that prevent the rule from firing. Son(x,y) ^ son(y,z) -> grandparent(x,y) COMPLEX AND APPROPRIATE MATCHING A more complex matching process is required when the predictions of rule specify required properties that are not stated explicitly in description of the current state. In this case, a separate set of rules must be used to describe how some properties can be inferred from others. An even more complex matching process is required if rules should be applied if their predictions approximately match the current situation. CONFLICT RESOLUTION The result of the matching process is a list of rules whose antecedents have matched the current state description along with whatever variable binding where generated by the matching process. But sometimes it is useful to incorporate some of that decision making into the matching process. This is the phase of the matching process. This phase of the matching process is then call conflict resolution. preference based on the rule that matched. preference based on the object that matched. preference based on the state (OR) 5. a) Convert the following sentences into predicate logic i)marcus was a man ii) Everyone is loyal to someone iii)marcus was tried to assassinate Caesar I)Marcus was a man. Man(Marcus) II) Everyone is loyal to someone. x: y: loyalto(x, y) III)Marcus was tried to assassinate Caesar tryassassinate(marcus,caesar) b) Explain forward and Backward chaining with an example. Backward Chaining: Backward chaining rule systems,of which PROLOG as an example,are good for goal directed problem solving.
5 For Example:A query system would probably use Backward chaining to reason about and answer user questions. In PROLOG rules are restricted to HORN clauses.rules are matched with unification procedure.unification tries to find set of bindings for variables to equate a goal with head of some rules.rules in PROLOG program are matched in the order in which they appear. Forward Chaining: Instead of being directed by goals we sometimes want to be directed by incoming data. For Example:Suppose you sense heat near your hand.you are likely to jerk your hand away. While this could be constructed as a goal directed behavior,it is modelled more naturally by the recognize-act cycle characteristics of Forward chaining rule system.in forward rule chaining system,left side rules are matched with right side assertions into the state and the process repeats. UNIT III 6. a) What is a semantic Net? Draw and explain the semantic net for the following statement: Every dog has bitten the constable Semantic Nets: The information is stored by interconnecting nodes with labelled arcs Every dog has bitten the constable b) Explain about Goal stack Planning Basic Idea to handle interactive compound goals uses goal stacks, Here the stack contains : goals, operators -- ADD, DELETE and PREREQUISITE lists a database maintaining the current situation for each operator used. Consider the following where wish to proceed from the start to goal state. Fig. Goal Stack Planning Example We can describe the start state: ON(B, A) ONTABLE(A) ONTABLE(C) ONTABLE(D) ARMEMPTY and goal state: ON(C, A) ON(B,D) ONTABLE(A) ONTABLE(D) After solving the problem: 1. UNSTACK(B,A) 2. STACK (B,D) 3. PICKUP(C)
6 4. STACK (C,A) This method produces a plan using good Artificial Intelligence techniques such as heuristics to find matching goals and the A* algorithm to detect unpromising paths which can be discarded. (OR) 7. a) What is script? Write a script for writing an examination and Explain. A script is a structure that describes the stereotyped sequence of events in a particular context. Example: b) Describe the hierarchical planning with an Example. In order to solve a problem efficiently we have to eliminate some of the details Of the problem. But in this approach no details are eliminated from the operator. Hierarchial planning involves aapproach called hierarchy abstraction space In which preconditions at low level of abstracton are ignored.
7 ABSTRIPS to the problem solving as follows: First solve the problem completely,considering the pre conditions whose critically Value is highest possible. STRIPS then ignore the preconditions lower then peak criticality. Continue this process of considering low preconditions untill all the rules of Preconditions have been condsider. Ex:PUSH-THROUGH-DOOR. UNIT IV 8. a) What is rote learning? Specify the components of expert system. Rote Learning is basically memorisation. Saving knowledge so it can be used again. Components of Expert Systems: Representing and using domain knowledge. Expert system shells. Explanation. Knowledge Acquisition. b) Discuss the MYCIN Expert system focusing on the certainty factor used. MYClN attempts to solve its goal of recommending a therapy for a particular patient by first finding the cause of the patient s illness. It uses its production rules to reason backward from goals to clinical observations. To solve the top-level diagnostic goal, it looks for rules whose right sides suggest diseases. It then uses the left sides of those rules (the preconditions) to set up subgoals whose success would enable the rules to be invoked. These subgoals are again matched against rules, and their preconditions are used to set up additional subgoals. Whenever a precondition describes a specific piece of clinical evidence, MYCIN uses that evidence if it already has access to it. Otherwise, it asks the user to provide the information. In order that MYCIN s requests for information will appear coherent to the user, the actual goals that MYCIN sets up are often more general than they need be to satisfy the preconditions of an individual rule. For example, if a precondition specifies that the identity of an organism is X, MYCIN will set up the goal infer identity. This approach also means that if another rule mentions the organism s identity, no further work will be required, since the identity will be known. (OR) 9. a) Explain inductive Learning with an Example. Classification is the process of assigning, to a particular input, the name of the class to
8 which it belongs. The classes from which the classification procedure can choose can be described in a variety of ways. Classification is an important component of many problem-sloving tasks. Consider a problem-sloving system that contains the following production rules: If : the current goal is to get from place A to place B, and there is a WALL separating the two places then : look for a DOORWAY in the WALL and go through it. Any one of the three examples. Examples: 1.Winston s Learning Program. 2.Version Spaces. 3.Decision Trees. b) Write notes on knowledge acquisition technique in Expert system. After the initial system is built, it must be iteratively refineduntil it approximates expertlevel performance. This process is expensive and time-consuming, so it isworthwhile to look for more automatic ways of constructing expert knowledge bases. While no totally automatic knowledge acquisition systems yet exist, there are many programs that interact with domain experts to extract expert knowledge efficiently. These programs provide support for the following activities: Entering knowledge. Maintaining knowledge base consistency. Ensuring knowledge base completeness MOLE [Eshelmam 1988] is a knowledge acquisition system for heuristic classification problems, such as diagnosing diseases. In particular, it is used in conjunction with the cover-and-differentiate problem-solving method. MOLE interacts with a domain expert to produce a knowledge base that a system called MOLE-p (for MOLE-performance) uses to solve problems. The acquisition proceeds through several steps: 1. Initial knowledge base construction. MOLE asks the expert to list common symptoms or complaints that might require diagnosis, For each symptom, MOLE prompts for a list of possible explanations. MOLE then iteratively seeks out higher a level explanations until it comes up with a set of ultimate causes. During this process, MOLE builds an influence network similar to the belief networks. Whenever an event has multiple explanations, MOLE tries to determine the conditions under which one explanation is correct. The expert provides covering knowledge, that is, the knowledge that a hypothesized event might be the cause of a certain symptom. MOLE then tries to infer anticipatory knowledge, which says that if the hypothesized event does occur, then the symptom will definitely appear. This knowledge allows the system to rule out certain hypotheses on the basis that specific symptoms are absent. 2. Refinement of the knowledge base. MOLE now tries to identify the weaknesses of the knowledgebase- One approach is to find holes and prompt the expert to fill them. It is difficult, in general, to know whether a knowledge base is complete, so instead MOLE lets the expert watch MOLE-p solving sample problems. Whenever MOLE-p makes an incorrect diagnosis, the expert adds new knowledge here are several ways in which MOLE-p can reach the wrong conclusion. It may incorrectly reject a hypothesis because it does not feel that the hypothesis is needed to explain any symptom. It may advance a hypothesis because it is needed to explain some otherwise inexplicable
9 hypothesis. Or it may lack differentiating knowledge for choosing between alternative hypotheses.
MYCIN. The MYCIN Task
MYCIN Developed at Stanford University in 1972 Regarded as the first true expert system Assists physicians in the treatment of blood infections Many revisions and extensions over the years The MYCIN Task
More informationCognitive Modeling. Tower of Hanoi: Description. Tower of Hanoi: The Task. Lecture 5: Models of Problem Solving. Frank Keller.
Cognitive Modeling Lecture 5: Models of Problem Solving Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk January 22, 2008 1 2 3 4 Reading: Cooper (2002:Ch. 4). Frank Keller
More informationKnowledge based expert systems D H A N A N J A Y K A L B A N D E
Knowledge based expert systems D H A N A N J A Y K A L B A N D E What is a knowledge based system? A Knowledge Based System or a KBS is a computer program that uses artificial intelligence to solve problems
More informationMYCIN. The embodiment of all the clichés of what expert systems are. (Newell)
MYCIN The embodiment of all the clichés of what expert systems are. (Newell) What is MYCIN? A medical diagnosis assistant A wild success Better than the experts Prototype for many other systems A disappointing
More informationMultimedia Application Effective Support of Education
Multimedia Application Effective Support of Education Eva Milková Faculty of Science, University od Hradec Králové, Hradec Králové, Czech Republic eva.mikova@uhk.cz Abstract Multimedia applications have
More informationMaximizing Learning Through Course Alignment and Experience with Different Types of Knowledge
Innov High Educ (2009) 34:93 103 DOI 10.1007/s10755-009-9095-2 Maximizing Learning Through Course Alignment and Experience with Different Types of Knowledge Phyllis Blumberg Published online: 3 February
More informationPOLA: a student modeling framework for Probabilistic On-Line Assessment of problem solving performance
POLA: a student modeling framework for Probabilistic On-Line Assessment of problem solving performance Cristina Conati, Kurt VanLehn Intelligent Systems Program University of Pittsburgh Pittsburgh, PA,
More informationRule-based Expert Systems
Rule-based Expert Systems What is knowledge? is a theoretical or practical understanding of a subject or a domain. is also the sim of what is currently known, and apparently knowledge is power. Those who
More informationObjectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition
Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic
More informationReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology
ReinForest: Multi-Domain Dialogue Management Using Hierarchical Policies and Knowledge Ontology Tiancheng Zhao CMU-LTI-16-006 Language Technologies Institute School of Computer Science Carnegie Mellon
More informationStudy and Analysis of MYCIN expert system
www.ijecs.in International Journal Of Engineering And Computer Science ISSN: 2319-7242 Volume 4 Issue 10 Oct 2015, Page No. 14861-14865 Study and Analysis of MYCIN expert system 1 Ankur Kumar Meena, 2
More informationConsultation skills teaching in primary care TEACHING CONSULTING SKILLS * * * * INTRODUCTION
Education for Primary Care (2013) 24: 206 18 2013 Radcliffe Publishing Limited Teaching exchange We start this time with the last of Paul Silverston s articles about undergraduate teaching in primary care.
More informationUC Merced Proceedings of the Annual Meeting of the Cognitive Science Society
UC Merced Proceedings of the nnual Meeting of the Cognitive Science Society Title Multi-modal Cognitive rchitectures: Partial Solution to the Frame Problem Permalink https://escholarship.org/uc/item/8j2825mm
More informationVisual CP Representation of Knowledge
Visual CP Representation of Knowledge Heather D. Pfeiffer and Roger T. Hartley Department of Computer Science New Mexico State University Las Cruces, NM 88003-8001, USA email: hdp@cs.nmsu.edu and rth@cs.nmsu.edu
More informationAn Investigation into Team-Based Planning
An Investigation into Team-Based Planning Dionysis Kalofonos and Timothy J. Norman Computing Science Department University of Aberdeen {dkalofon,tnorman}@csd.abdn.ac.uk Abstract Models of plan formation
More informationLearning goal-oriented strategies in problem solving
Learning goal-oriented strategies in problem solving Martin Možina, Timotej Lazar, Ivan Bratko Faculty of Computer and Information Science University of Ljubljana, Ljubljana, Slovenia Abstract The need
More informationWe are strong in research and particularly noted in software engineering, information security and privacy, and humane gaming.
Computer Science 1 COMPUTER SCIENCE Office: Department of Computer Science, ECS, Suite 379 Mail Code: 2155 E Wesley Avenue, Denver, CO 80208 Phone: 303-871-2458 Email: info@cs.du.edu Web Site: Computer
More informationChapter 2 Rule Learning in a Nutshell
Chapter 2 Rule Learning in a Nutshell This chapter gives a brief overview of inductive rule learning and may therefore serve as a guide through the rest of the book. Later chapters will expand upon the
More informationGACE Computer Science Assessment Test at a Glance
GACE Computer Science Assessment Test at a Glance Updated May 2017 See the GACE Computer Science Assessment Study Companion for practice questions and preparation resources. Assessment Name Computer Science
More informationKnowledge-Based - Systems
Knowledge-Based - Systems ; Rajendra Arvind Akerkar Chairman, Technomathematics Research Foundation and Senior Researcher, Western Norway Research institute Priti Srinivas Sajja Sardar Patel University
More informationHow to analyze visual narratives: A tutorial in Visual Narrative Grammar
How to analyze visual narratives: A tutorial in Visual Narrative Grammar Neil Cohn 2015 neilcohn@visuallanguagelab.com www.visuallanguagelab.com Abstract Recent work has argued that narrative sequential
More informationUniversity of Groningen. Systemen, planning, netwerken Bosman, Aart
University of Groningen Systemen, planning, netwerken Bosman, Aart IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from it. Please check the document
More informationFUZZY EXPERT. Dr. Kasim M. Al-Aubidy. Philadelphia University. Computer Eng. Dept February 2002 University of Damascus-Syria
FUZZY EXPERT SYSTEMS 16-18 18 February 2002 University of Damascus-Syria Dr. Kasim M. Al-Aubidy Computer Eng. Dept. Philadelphia University What is Expert Systems? ES are computer programs that emulate
More informationModule 12. Machine Learning. Version 2 CSE IIT, Kharagpur
Module 12 Machine Learning 12.1 Instructional Objective The students should understand the concept of learning systems Students should learn about different aspects of a learning system Students should
More informationPlanning with External Events
94 Planning with External Events Jim Blythe School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 blythe@cs.cmu.edu Abstract I describe a planning methodology for domains with uncertainty
More informationIntegrating Meta-Level and Domain-Level Knowledge for Task-Oriented Dialogue
Advances in Cognitive Systems 3 (2014) 201 219 Submitted 9/2013; published 7/2014 Integrating Meta-Level and Domain-Level Knowledge for Task-Oriented Dialogue Alfredo Gabaldon Pat Langley Silicon Valley
More informationDeveloping True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability
Developing True/False Test Sheet Generating System with Diagnosing Basic Cognitive Ability Shih-Bin Chen Dept. of Information and Computer Engineering, Chung-Yuan Christian University Chung-Li, Taiwan
More informationNotes on The Sciences of the Artificial Adapted from a shorter document written for course (Deciding What to Design) 1
Notes on The Sciences of the Artificial Adapted from a shorter document written for course 17-652 (Deciding What to Design) 1 Ali Almossawi December 29, 2005 1 Introduction The Sciences of the Artificial
More informationComputerized Adaptive Psychological Testing A Personalisation Perspective
Psychology and the internet: An European Perspective Computerized Adaptive Psychological Testing A Personalisation Perspective Mykola Pechenizkiy mpechen@cc.jyu.fi Introduction Mixed Model of IRT and ES
More informationWriting Research Articles
Marek J. Druzdzel with minor additions from Peter Brusilovsky University of Pittsburgh School of Information Sciences and Intelligent Systems Program marek@sis.pitt.edu http://www.pitt.edu/~druzdzel Overview
More informationOn the Combined Behavior of Autonomous Resource Management Agents
On the Combined Behavior of Autonomous Resource Management Agents Siri Fagernes 1 and Alva L. Couch 2 1 Faculty of Engineering Oslo University College Oslo, Norway siri.fagernes@iu.hio.no 2 Computer Science
More informationUsing the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the SAT
The Journal of Technology, Learning, and Assessment Volume 6, Number 6 February 2008 Using the Attribute Hierarchy Method to Make Diagnostic Inferences about Examinees Cognitive Skills in Algebra on the
More informationMajor Lessons from This Work
PART TWELVE Conclusions 36 Major Lessons from This Work In this book we have presented experimental evidence at many levels of detail for a diverse set of hypotheses. As indicated by the chapter and section
More informationKnowledge Elicitation Tool Classification. Janet E. Burge. Artificial Intelligence Research Group. Worcester Polytechnic Institute
Page 1 of 28 Knowledge Elicitation Tool Classification Janet E. Burge Artificial Intelligence Research Group Worcester Polytechnic Institute Knowledge Elicitation Methods * KE Methods by Interaction Type
More informationSOFTWARE EVALUATION TOOL
SOFTWARE EVALUATION TOOL Kyle Higgins Randall Boone University of Nevada Las Vegas rboone@unlv.nevada.edu Higgins@unlv.nevada.edu N.B. This form has not been fully validated and is still in development.
More informationCOMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS
COMPUTER-ASSISTED INDEPENDENT STUDY IN MULTIVARIATE CALCULUS L. Descalço 1, Paula Carvalho 1, J.P. Cruz 1, Paula Oliveira 1, Dina Seabra 2 1 Departamento de Matemática, Universidade de Aveiro (PORTUGAL)
More informationCONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS
CONCEPT MAPS AS A DEVICE FOR LEARNING DATABASE CONCEPTS Pirjo Moen Department of Computer Science P.O. Box 68 FI-00014 University of Helsinki pirjo.moen@cs.helsinki.fi http://www.cs.helsinki.fi/pirjo.moen
More informationA Case Study: News Classification Based on Term Frequency
A Case Study: News Classification Based on Term Frequency Petr Kroha Faculty of Computer Science University of Technology 09107 Chemnitz Germany kroha@informatik.tu-chemnitz.de Ricardo Baeza-Yates Center
More informationReinforcement Learning by Comparing Immediate Reward
Reinforcement Learning by Comparing Immediate Reward Punit Pandey DeepshikhaPandey Dr. Shishir Kumar Abstract This paper introduces an approach to Reinforcement Learning Algorithm by comparing their immediate
More informationStacks Teacher notes. Activity description. Suitability. Time. AMP resources. Equipment. Key mathematical language. Key processes
Stacks Teacher notes Activity description (Interactive not shown on this sheet.) Pupils start by exploring the patterns generated by moving counters between two stacks according to a fixed rule, doubling
More informationNo Parent Left Behind
No Parent Left Behind Navigating the Special Education Universe SUSAN M. BREFACH, Ed.D. Page i Introduction How To Know If This Book Is For You Parents have become so convinced that educators know what
More informationClouds = Heavy Sidewalk = Wet. davinci V2.1 alpha3
Identifying and Handling Structural Incompleteness for Validation of Probabilistic Knowledge-Bases Eugene Santos Jr. Dept. of Comp. Sci. & Eng. University of Connecticut Storrs, CT 06269-3155 eugene@cse.uconn.edu
More informationA GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING
A GENERIC SPLIT PROCESS MODEL FOR ASSET MANAGEMENT DECISION-MAKING Yong Sun, a * Colin Fidge b and Lin Ma a a CRC for Integrated Engineering Asset Management, School of Engineering Systems, Queensland
More informationRadius STEM Readiness TM
Curriculum Guide Radius STEM Readiness TM While today s teens are surrounded by technology, we face a stark and imminent shortage of graduates pursuing careers in Science, Technology, Engineering, and
More informationWhat is PDE? Research Report. Paul Nichols
What is PDE? Research Report Paul Nichols December 2013 WHAT IS PDE? 1 About Pearson Everything we do at Pearson grows out of a clear mission: to help people make progress in their lives through personalized
More informationAQUA: An Ontology-Driven Question Answering System
AQUA: An Ontology-Driven Question Answering System Maria Vargas-Vera, Enrico Motta and John Domingue Knowledge Media Institute (KMI) The Open University, Walton Hall, Milton Keynes, MK7 6AA, United Kingdom.
More informationStudent Handbook 2016 University of Health Sciences, Lahore
Student Handbook 2016 University of Health Sciences, Lahore 1 Welcome to the Certificate in Medical Teaching programme 2016 at the University of Health Sciences, Lahore. This programme is for teachers
More informationSoftware Maintenance
1 What is Software Maintenance? Software Maintenance is a very broad activity that includes error corrections, enhancements of capabilities, deletion of obsolete capabilities, and optimization. 2 Categories
More informationCAAP. Content Analysis Report. Sample College. Institution Code: 9011 Institution Type: 4-Year Subgroup: none Test Date: Spring 2011
CAAP Content Analysis Report Institution Code: 911 Institution Type: 4-Year Normative Group: 4-year Colleges Introduction This report provides information intended to help postsecondary institutions better
More informationEvolution of Collective Commitment during Teamwork
Fundamenta Informaticae 56 (2003) 329 371 329 IOS Press Evolution of Collective Commitment during Teamwork Barbara Dunin-Kȩplicz Institute of Informatics, Warsaw University Banacha 2, 02-097 Warsaw, Poland
More informationWhat s in a Step? Toward General, Abstract Representations of Tutoring System Log Data
What s in a Step? Toward General, Abstract Representations of Tutoring System Log Data Kurt VanLehn 1, Kenneth R. Koedinger 2, Alida Skogsholm 2, Adaeze Nwaigwe 2, Robert G.M. Hausmann 1, Anders Weinstein
More informationOn-Line Data Analytics
International Journal of Computer Applications in Engineering Sciences [VOL I, ISSUE III, SEPTEMBER 2011] [ISSN: 2231-4946] On-Line Data Analytics Yugandhar Vemulapalli #, Devarapalli Raghu *, Raja Jacob
More informationWhat is a Mental Model?
Mental Models for Program Understanding Dr. Jonathan I. Maletic Computer Science Department Kent State University What is a Mental Model? Internal (mental) representation of a real system s behavior,
More informationMathematics process categories
Mathematics process categories All of the UK curricula define multiple categories of mathematical proficiency that require students to be able to use and apply mathematics, beyond simple recall of facts
More informationCLASSIFICATION OF PROGRAM Critical Elements Analysis 1. High Priority Items Phonemic Awareness Instruction
CLASSIFICATION OF PROGRAM Critical Elements Analysis 1 Program Name: Macmillan/McGraw Hill Reading 2003 Date of Publication: 2003 Publisher: Macmillan/McGraw Hill Reviewer Code: 1. X The program meets
More informationParsing of part-of-speech tagged Assamese Texts
IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal
More informationPredicting Students Performance with SimStudent: Learning Cognitive Skills from Observation
School of Computer Science Human-Computer Interaction Institute Carnegie Mellon University Year 2007 Predicting Students Performance with SimStudent: Learning Cognitive Skills from Observation Noboru Matsuda
More informationAP Calculus AB. Nevada Academic Standards that are assessable at the local level only.
Calculus AB Priority Keys Aligned with Nevada Standards MA I MI L S MA represents a Major content area. Any concept labeled MA is something of central importance to the entire class/curriculum; it is a
More informationLecture 1: Basic Concepts of Machine Learning
Lecture 1: Basic Concepts of Machine Learning Cognitive Systems - Machine Learning Ute Schmid (lecture) Johannes Rabold (practice) Based on slides prepared March 2005 by Maximilian Röglinger, updated 2010
More informationAn Interactive Intelligent Language Tutor Over The Internet
An Interactive Intelligent Language Tutor Over The Internet Trude Heift Linguistics Department and Language Learning Centre Simon Fraser University, B.C. Canada V5A1S6 E-mail: heift@sfu.ca Abstract: This
More informationAUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS
AUTOMATED TROUBLESHOOTING OF MOBILE NETWORKS USING BAYESIAN NETWORKS R.Barco 1, R.Guerrero 2, G.Hylander 2, L.Nielsen 3, M.Partanen 2, S.Patel 4 1 Dpt. Ingeniería de Comunicaciones. Universidad de Málaga.
More informationLearning Methods for Fuzzy Systems
Learning Methods for Fuzzy Systems Rudolf Kruse and Andreas Nürnberger Department of Computer Science, University of Magdeburg Universitätsplatz, D-396 Magdeburg, Germany Phone : +49.39.67.876, Fax : +49.39.67.8
More informationScience Fair Project Handbook
Science Fair Project Handbook IDENTIFY THE TESTABLE QUESTION OR PROBLEM: a) Begin by observing your surroundings, making inferences and asking testable questions. b) Look for problems in your life or surroundings
More informationMillersville University Degree Works Training User Guide
Millersville University Degree Works Training User Guide Page 1 Table of Contents Introduction... 5 What is Degree Works?... 5 Degree Works Functionality Summary... 6 Access to Degree Works... 8 Login
More informationRicochet Robots - A Case Study for Human Complex Problem Solving
Ricochet Robots - A Case Study for Human Complex Problem Solving Nicolas Butko, Katharina A. Lehmann, Veronica Ramenzoni September 15, 005 1 Introduction At the beginning of the Cognitive Revolution, stimulated
More informationGiven a directed graph G =(N A), where N is a set of m nodes and A. destination node, implying a direction for ow to follow. Arcs have limitations
4 Interior point algorithms for network ow problems Mauricio G.C. Resende AT&T Bell Laboratories, Murray Hill, NJ 07974-2070 USA Panos M. Pardalos The University of Florida, Gainesville, FL 32611-6595
More informationLinking Task: Identifying authors and book titles in verbose queries
Linking Task: Identifying authors and book titles in verbose queries Anaïs Ollagnier, Sébastien Fournier, and Patrice Bellot Aix-Marseille University, CNRS, ENSAM, University of Toulon, LSIS UMR 7296,
More informationSeminar - Organic Computing
Seminar - Organic Computing Self-Organisation of OC-Systems Markus Franke 25.01.2006 Typeset by FoilTEX Timetable 1. Overview 2. Characteristics of SO-Systems 3. Concern with Nature 4. Design-Concepts
More informationA Version Space Approach to Learning Context-free Grammars
Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)
More informationLearning Lesson Study Course
Learning Lesson Study Course Developed originally in Japan and adapted by Developmental Studies Center for use in schools across the United States, lesson study is a model of professional development in
More informationA student diagnosing and evaluation system for laboratory-based academic exercises
A student diagnosing and evaluation system for laboratory-based academic exercises Maria Samarakou, Emmanouil Fylladitakis and Pantelis Prentakis Technological Educational Institute (T.E.I.) of Athens
More informationLife and career planning
Paper 30-1 PAPER 30 Life and career planning Bob Dick (1983) Life and career planning: a workbook exercise. Brisbane: Department of Psychology, University of Queensland. A workbook for class use. Introduction
More informationIntroduction to Simulation
Introduction to Simulation Spring 2010 Dr. Louis Luangkesorn University of Pittsburgh January 19, 2010 Dr. Louis Luangkesorn ( University of Pittsburgh ) Introduction to Simulation January 19, 2010 1 /
More informationVersion Space. Term 2012/2013 LSI - FIB. Javier Béjar cbea (LSI - FIB) Version Space Term 2012/ / 18
Version Space Javier Béjar cbea LSI - FIB Term 2012/2013 Javier Béjar cbea (LSI - FIB) Version Space Term 2012/2013 1 / 18 Outline 1 Learning logical formulas 2 Version space Introduction Search strategy
More informationWhy Pay Attention to Race?
Why Pay Attention to Race? Witnessing Whiteness Chapter 1 Workshop 1.1 1.1-1 Dear Facilitator(s), This workshop series was carefully crafted, reviewed (by a multiracial team), and revised with several
More informationProof Theory for Syntacticians
Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax
More informationSome Principles of Automated Natural Language Information Extraction
Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract
More informationConstraining X-Bar: Theta Theory
Constraining X-Bar: Theta Theory Carnie, 2013, chapter 8 Kofi K. Saah 1 Learning objectives Distinguish between thematic relation and theta role. Identify the thematic relations agent, theme, goal, source,
More informationTransfer Learning Action Models by Measuring the Similarity of Different Domains
Transfer Learning Action Models by Measuring the Similarity of Different Domains Hankui Zhuo 1, Qiang Yang 2, and Lei Li 1 1 Software Research Institute, Sun Yat-sen University, Guangzhou, China. zhuohank@gmail.com,lnslilei@mail.sysu.edu.cn
More informationCooking Matters at the Store Evaluation: Executive Summary
Cooking Matters at the Store Evaluation: Executive Summary Introduction Share Our Strength is a national nonprofit with the goal of ending childhood hunger in America by connecting children with the nutritious
More informationAbstractions and the Brain
Abstractions and the Brain Brian D. Josephson Department of Physics, University of Cambridge Cavendish Lab. Madingley Road Cambridge, UK. CB3 OHE bdj10@cam.ac.uk http://www.tcm.phy.cam.ac.uk/~bdj10 ABSTRACT
More informationLevel 6. Higher Education Funding Council for England (HEFCE) Fee for 2017/18 is 9,250*
Programme Specification: Undergraduate For students starting in Academic Year 2017/2018 1. Course Summary Names of programme(s) and award title(s) Award type Mode of study Framework of Higher Education
More informationThe Good Judgment Project: A large scale test of different methods of combining expert predictions
The Good Judgment Project: A large scale test of different methods of combining expert predictions Lyle Ungar, Barb Mellors, Jon Baron, Phil Tetlock, Jaime Ramos, Sam Swift The University of Pennsylvania
More informationIntegrating derivational analogy into a general problem solving architecture
Integrating derivational analogy into a general problem solving architecture Jaime Carbonell Manuela Veloso Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 March 1988 Abstract
More informationOCR for Arabic using SIFT Descriptors With Online Failure Prediction
OCR for Arabic using SIFT Descriptors With Online Failure Prediction Andrey Stolyarenko, Nachum Dershowitz The Blavatnik School of Computer Science Tel Aviv University Tel Aviv, Israel Email: stloyare@tau.ac.il,
More informationTHE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS ASSESSING THE EFFECTIVENESS OF MULTIPLE CHOICE MATH TESTS
THE PENNSYLVANIA STATE UNIVERSITY SCHREYER HONORS COLLEGE DEPARTMENT OF MATHEMATICS ASSESSING THE EFFECTIVENESS OF MULTIPLE CHOICE MATH TESTS ELIZABETH ANNE SOMERS Spring 2011 A thesis submitted in partial
More informationLiquid Narrative Group Technical Report Number
http://liquidnarrative.csc.ncsu.edu/pubs/tr04-004.pdf NC STATE UNIVERSITY_ Liquid Narrative Group Technical Report Number 04-004 Equivalence between Narrative Mediation and Branching Story Graphs Mark
More informationLearning and Transferring Relational Instance-Based Policies
Learning and Transferring Relational Instance-Based Policies Rocío García-Durán, Fernando Fernández y Daniel Borrajo Universidad Carlos III de Madrid Avda de la Universidad 30, 28911-Leganés (Madrid),
More informationAxiom 2013 Team Description Paper
Axiom 2013 Team Description Paper Mohammad Ghazanfari, S Omid Shirkhorshidi, Farbod Samsamipour, Hossein Rahmatizadeh Zagheli, Mohammad Mahdavi, Payam Mohajeri, S Abbas Alamolhoda Robotics Scientific Association
More informationEdexcel GCSE. Statistics 1389 Paper 1H. June Mark Scheme. Statistics Edexcel GCSE
Edexcel GCSE Statistics 1389 Paper 1H June 2007 Mark Scheme Edexcel GCSE Statistics 1389 NOTES ON MARKING PRINCIPLES 1 Types of mark M marks: method marks A marks: accuracy marks B marks: unconditional
More informationECE-492 SENIOR ADVANCED DESIGN PROJECT
ECE-492 SENIOR ADVANCED DESIGN PROJECT Meeting #3 1 ECE-492 Meeting#3 Q1: Who is not on a team? Q2: Which students/teams still did not select a topic? 2 ENGINEERING DESIGN You have studied a great deal
More informationIntroduction and Motivation
1 Introduction and Motivation Mathematical discoveries, small or great are never born of spontaneous generation. They always presuppose a soil seeded with preliminary knowledge and well prepared by labour,
More informationFeature-oriented vs. Needs-oriented Product Access for Non-Expert Online Shoppers
Feature-oriented vs. Needs-oriented Product Access for Non-Expert Online Shoppers Daniel Felix 1, Christoph Niederberger 1, Patrick Steiger 2 & Markus Stolze 3 1 ETH Zurich, Technoparkstrasse 1, CH-8005
More informationGCSE. Mathematics A. Mark Scheme for January General Certificate of Secondary Education Unit A503/01: Mathematics C (Foundation Tier)
GCSE Mathematics A General Certificate of Secondary Education Unit A503/0: Mathematics C (Foundation Tier) Mark Scheme for January 203 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge and RSA)
More informationMathematics Scoring Guide for Sample Test 2005
Mathematics Scoring Guide for Sample Test 2005 Grade 4 Contents Strand and Performance Indicator Map with Answer Key...................... 2 Holistic Rubrics.......................................................
More informationPre-Processing MRSes
Pre-Processing MRSes Tore Bruland Norwegian University of Science and Technology Department of Computer and Information Science torebrul@idi.ntnu.no Abstract We are in the process of creating a pipeline
More informationInstructor: Matthew Wickes Kilgore Office: ES 310
MATH 1314 College Algebra Syllabus Instructor: Matthew Wickes Kilgore Office: ES 310 Longview Office: LN 205C Email: mwickes@kilgore.edu Phone: 903 988-7455 Prerequistes: Placement test score on TSI or
More informationMath 96: Intermediate Algebra in Context
: Intermediate Algebra in Context Syllabus Spring Quarter 2016 Daily, 9:20 10:30am Instructor: Lauri Lindberg Office Hours@ tutoring: Tutoring Center (CAS-504) 8 9am & 1 2pm daily STEM (Math) Center (RAI-338)
More informationCourses in English. Application Development Technology. Artificial Intelligence. 2017/18 Spring Semester. Database access
The courses availability depends on the minimum number of registered students (5). If the course couldn t start, students can still complete it in the form of project work and regular consultations with
More informationFacing our Fears: Reading and Writing about Characters in Literary Text
Facing our Fears: Reading and Writing about Characters in Literary Text by Barbara Goggans Students in 6th grade have been reading and analyzing characters in short stories such as "The Ravine," by Graham
More information