# CogSysI Lecture 4: Human Problem Solving and Production Systems p. 103

Save this PDF as:

Size: px
Start display at page:

Download "CogSysI Lecture 4: Human Problem Solving and Production Systems p. 103"

## Transcription

1 CogSysI Lecture 4: Human Problem Solving and Production Systems Intelligent Agents WS 2004/2005 Part I: Acting Goal-Oriented I.4 Human Problem Solving and Production Systems CogSysI Lecture 4: Human Problem Solving and Production Systems p. 103

2 Problem decomposition Besides using heuristics, problem solving can be guided by knowledge about the problem structure. Problem decomposition: Dividing a problem in sub-problems More complex production rules Advantage: dealing with smaller sub-problems and generating the soluution by composition ( divide and conquer ) Representation: AND-OR Trees standard tree: each arc which exits a node represents an alternative ( or ); extension: specially mark edges which lead to sub-trees which must be all fulfilled for the current node to be fulfilled ( and ) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 104

3 Example: MOVER (Winston, 1992) PUT ON (put block1 on block2) GET SPACE (create space on goal block) MAKE SPACE (move away blocks) GRASP (grasp a block) CLEAR TOP (remove all blocks on top of a block) GET RID OF (put blocks on table) MOVE (move block) UNGRASP (let go of block) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 105

4 AND-OR Tree for MOVER PUT-ON A B "UND" GET-SPACE A B GRASP A MOVE A B UNGRASP A MAKE-SPACE A B CLEAR-TOP A GET-RID-OF D GET-RID-OF C PUT-ON D Table PUT-ON C Table GET-SPACE D Table GRASP D GET-SPACE C Table GRASP C C A D B F E MOVE D Table MOVE C Table UNGRASP D UNGRASP C CogSysI Lecture 4: Human Problem Solving and Production Systems p. 106

5 Example: Route Finding Problems OR -node: X - F (go from X to F), X - F is primitive, if F can be reached from X in one step (there exists an applicable operation) primitive sub-problems are leafs in the tree AND -node: X - Z via Y (go from X to Z via Y) constraint Problem solving: extracting an (optimal) AND-Tree Using costs: Each leaf is associated with its cost, the costs are propagated upwards in the tree, the AND-tree with the lowest costs is returned Algorithm: AO* (Nilsson) In planning: hierarchical planning CogSysI Lecture 4: Human Problem Solving and Production Systems p. 107

6 Example cont. 2 a 3 a z b 3 c 1 2 e 2 2 d 4 1 g f j i h 3 2 k 3 z 3 a z via f a f Two of many possible decompositions. 9 a z via g 12 f z a g g z a f via d 5 f z via i 4 a g via c 5 g z via j 7 a d d f f i i z a c c g g j j z via k a d via b 4 i k k z 3 3 a b b d 2 2 CogSysI Lecture 4: Human Problem Solving and Production Systems p. 108

7 Human problem solving Humans often use greedy strategies for solving problems ( bounded rationality, Herbert Simon) The means-end (MEA) strategy which is the search algorithm used in the GPS (General problem solver) is such a greedy strategy As we will see in the lecture on planning, MEA is not complete! (Sussman Anomaly) Empirical evidence: Greeno (1974) for the Hobbits-and-Orcs problem, a simulation with a production system by Schmalhofer & Polson (1986) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 109

8 Hobbits and Orcs Subjects have problems with the transformation from state (6) to (7). Here 2 and not only 1 passenger must be transported back to the left river bank. That is, there must be created a situation which is further removed from the goal state than the situation before. (1) b H H H O O O (2) H H O O b H O (3) b H H H O O (4) O b H H H O O O (5) b H H H O (6) H O O O b H H O O (7) b H H O O (8) H O b O O H H H O (9) b O O O (10) O H H H b H H H O O (11) b O O (12) H H H O b H H H O O O CogSysI Lecture 4: Human Problem Solving and Production Systems p. 110

9 Means-End-Analysis Transform: Compare current state with goal state IF the current state fulfills the goal THEN stop and announce success ELSE Reduce the difference between the current state and the goal. Reduce: Find operator which reduces the difference between current state and goal IF there is no such operator THEN stop and announce failure ELSE Apply the operator to the current state. Apply: Apply an operator to the current state IF the operator is applicable to the current state THEN apply it and transform the resulting state into the goal. ELSE Reduce the difference between the current state and the application conditions of the operator CogSysI Lecture 4: Human Problem Solving and Production Systems p. 111

10 MEA Example Transform: initial state (discs 1, 2, 3 on peg A) to goal state (discs 1, 2, 3 on peg C) Reduce: 3 is not on C Apply: Move 3 to C Reduce: 3 is not free, because of 2 Apply: Remove 2 Reduce: 2 is not free,because of 1 Apply: Remove 1; 1 can be moved to C 2 is free 2 can be moved to B 3 is free Reduce: 3 cannot be moved to C, because of 1 Apply: Remove 1; 1 can be moved to B 3 can be moved to C CogSysI Lecture 4: Human Problem Solving and Production Systems p. 112

11 MEA Example cont. Transform: State (1 and 2 on B, 3 on C) to goal state Reduce: 2 is not on C Apply: Move 2 to C Reduce: 2 is not free because of 1 Apply: Remove 1; 1 can be moved to A 2 is free 2 can be moved to C Transform: State (1 is on A, 2 and 3 on C) to goal Reduce: 1 is not on C Apply: Move 1 to C; 1 can be moved to C 1 is on 3 Transform: State (1, 2 and 3 on C) to goal success CogSysI Lecture 4: Human Problem Solving and Production Systems p. 113

12 Cognitive Architectures Cognitive Architecture: unified theory of cognition explicit definition of basic mechanisms of information processing assumption that these mechanisms are constant over all domains (problem solving, language understanding, pattern recognition etc.) basic mechanisms: control of interaction with environment, representation of information in memory, strategy to select rules Advantage: different models realized in the same architecture get comparable Alternative: special purpose cognitive models (such as SME for analogical reasoning, see below) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 114

13 Cognitive Architectures cont. Prominent Architectures: The ACT-family (J.R. Anderson et al.), Soar (based on GPS) ACT and Soar are production systems ACT: long-term memory is divided in a declarative memory ( know what, activation net) and a procedural memory ( know how ) Example strategies for selecting rules: most specific first, most recently used, priority values (updated in dependence of success) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 115

14 Production System INTERPRETER Match Input Select Apply Output DATA Production Rules ("working memory") ("long term memory") CogSysI Lecture 4: Human Problem Solving and Production Systems p. 116

15 Finding a good representation In human problem solving, there is an interaction between constructing a suitable representation and solving the problem. In AI systems, typically the representation needs to be fixed before problem solving (see Kaplan & Simon, 1990). Exceptions: approaches to solving proportional analogies using re-representation (Copycat, Hofstadter et al. 1995, PAN, O Hara 1992, Indurkhya 1992) Empirical studies: Plötzner & van Lehn, 1997 Examples: Mutilated checkerboard, nine-dots problem CogSysI Lecture 4: Human Problem Solving and Production Systems p. 117

16 Re-Representation : :: : : :: : GLUE GLUE GLUE ROT[p,60] ROT[p,60] ROT[p,60] ROT[p,60] ROT[p,60] ROT[p,60] CogSysI Lecture 4: Human Problem Solving and Production Systems p. 118

17 Context Effects Since human problem solving is typically guided by knowledge, search for a solution might be misled by preconceptions Gestalt-Theory: functional fixation (Duncker 1945) Examples: Candle, matches, and box with pushpins; pendulum problem A related phenomenon: set-effect (Luchins & Luchins, 1950) Water jug problems CogSysI Lecture 4: Human Problem Solving and Production Systems p. 119

18 Analogical Problem Solving A problem solving strategy alternative to heuristic search is using analogical reasoning. Retrieve a suitable source problem. Map the entities of the source with the entities of the target problem in a structure preserving way. Carry-over known parts of the source to target (possibly perform necessary adaptations) Gentner (1983) Cognitive Models: SME (Falkenhainer et al. 1989), LISA (Hummel & Holyoak, 1998) Empirical investigation of analogical transfer (Schmid et al., 1999) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 120

19 Learning by Doing A problem solving system has no memory. Therefore, it might recalculate solutions which it already had achieved in another problem solving episode. The power law of learning (Anzai & Simon, 1979): learning curve, speed-up effect Humans acquire skills (procedural knowledge) when solving problem Cognitive Models, based on production systems: ACT (Anderson et al.), SOAR (Newell et al.): Declarative knowledge is compiled into rules But: these models do not cover strategy learning/control rule learning (see Schmid et al. 2000) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 121

20 The Running Gag of CogSysI Question: How many AI people does it take to change a lightbulb? Answer: At least 67. 2nd part of the solution: The Problem Space Group (5) One to define the goal state One to define the operators One to describe the universal problem solver One to hack the production system One to indicate about how it is a model of human lightbulb-changing behavior ( Artificial Intelligence, Rich & Knight) CogSysI Lecture 4: Human Problem Solving and Production Systems p. 122

### Chapter 12 Problem Solving. Definitions. What is a Problem?

Chapter 12 Problem Solving Definitions Thinking: formation of a new mental representation through the transformation of information by complex interaction of the mental attributes of judging, abstracting,

### COGNITION. Chapter 9: Problem Solving. Fundamentals of Cognitive Psychology (Kellogg)

Mark Van Selst San Jose State University COGNITION Chapter 9: Problem Solving Fundamentals of Cognitive Psychology (Kellogg) Fall 2013 Defining a problem There is a problem when a goal is not immediately

### PROBLEM SOLVING Kevin Dunbar

PROBLEM SOLVING Kevin Dunbar Department of Psychology, McGill University Published in Dunbar, K. (1998). Problem solving. In W. Bechtel, & G. Graham (Eds.). A companion to Cognitive Science. London, England:

### Lecture 2 of 41. Agents and Problem Solving

Lecture 2 of 41 Agents and Problem Solving Monday, 23 August 2004 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading for Next Class: Chapter 3, Appendix A, Russell and

### Implementation of hybrid software architecture for Artificial Intelligence System

IJCSNS International Journal of Computer Science and Network Security, VOL.7 No.1, January 2007 35 Implementation of hybrid software architecture for Artificial Intelligence System B.Vinayagasundaram and

### Design Problem Solving: A Task Analysis 1

Design Problem Solving: A Task Analysis 1 Articles B. Chandrasekaran Design problem solving is a complex activity involving a number of subtasks and a number of alternative methods potentially available

### Using Qualitative Representations in Controlling Engineering Problem Solving

From: AAAI Technical Report WS-96-01. Compilation copyright 1996, AAAI (www.aaai.org). All rights reserved. Using Qualitative Representations in Controlling Engineering Problem Solving Yusuf Pisan Northwestern

### IAI : Expert Systems

IAI : Expert Systems John A. Bullinaria, 2005 1. What is an Expert System? 2. The Architecture of Expert Systems 3. Knowledge Acquisition 4. Representing the Knowledge 5. The Inference Engine 6. The Rete-Algorithm

### Machine Learning. Chapter 18, 21. Some material adopted from notes by Chuck Dyer

Machine Learning Chapter 18, 21 Some material adopted from notes by Chuck Dyer What is learning? Learning denotes changes in a system that... enable a system to do the same task more efficiently the next

### Sanjeev Kumar. contribute

RESEARCH ISSUES IN DATAA MINING Sanjeev Kumar I.A.S.R.I., Library Avenue, Pusa, New Delhi-110012 sanjeevk@iasri.res.in 1. Introduction The field of data mining and knowledgee discovery is emerging as a

### Introduction to Machine Learning and Data Mining. Prof. Dr. Igor Trajkovski trajkovski@nyus.edu.mk

Introduction to Machine Learning and Data Mining Prof. Dr. Igor Trakovski trakovski@nyus.edu.mk Neural Networks 2 Neural Networks Analogy to biological neural systems, the most robust learning systems

### A Systematic Approach to Model-Guided Empirical Search for Memory Hierarchy Optimization

A Systematic Approach to Model-Guided Empirical Search for Memory Hierarchy Optimization Chun Chen, Jacqueline Chame, Mary Hall, and Kristina Lerman University of Southern California/Information Sciences

### Algorithms and Data Structures

Algorithms and Data Structures Part 2: Data Structures PD Dr. rer. nat. habil. Ralf-Peter Mundani Computation in Engineering (CiE) Summer Term 2016 Overview general linked lists stacks queues trees 2 2

### INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

### Integrating Cognitive Models Based on Different Computational Methods

Integrating Cognitive Models Based on Different Computational Methods Nicholas L. Cassimatis (cassin@rpi.edu) Rensselaer Polytechnic Institute Department of Cognitive Science 110 8 th Street Troy, NY 12180

### SYSM 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

### Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams

Scheduling Home Health Care with Separating Benders Cuts in Decision Diagrams André Ciré University of Toronto John Hooker Carnegie Mellon University INFORMS 2014 Home Health Care Home health care delivery

### Throughput constraint for Synchronous Data Flow Graphs

Throughput constraint for Synchronous Data Flow Graphs *Alessio Bonfietti Michele Lombardi Michela Milano Luca Benini!"#\$%&'()*+,-)./&0&20304(5 60,7&-8990,.+:&;/&."!?@A>&"'&=,0B+C. !"#\$%&'()* Resource

### Syllabus for CS491/PSCH 494 Special Topic: Introduction to Cognitive Science Fall semester, 2015 Instructor Stellan Ohlsson

1 Syllabus for CS491/PSCH 494 Special Topic: Introduction to Cognitive Science Fall semester, 2015 Instructor Stellan Ohlsson Background and Purpose Cognitive Science emerged in the aftermath of World

### Learning through Interactive Behavior Specifications

Learning through Interactive Behavior Specifications Tolga Könik Douglas J. earson John E. Laird Computational Learning Lab., CSLI Stanford University Stanford, CA 94305, USA konik@stanford.edu Threeenny

### feature requirements engineering

feature requirements engineering Exploring Alternatives during Requirements Analysis John Mylopoulos, University of Toronto Goal-oriented requirements analysis techniques provide ways to refine organizational

### Bowdoin Computer Science

Bowdoin Science What is computer science, what are its applications in other disciplines, and its impact in society? 101: Introduction to CS Pre-requisites: none Assumes no prior knowledge of programming

### Computers and the Creative Process

Computers and the Creative Process Kostas Terzidis In this paper the role of the computer in the creative process is discussed. The main focus is the investigation of whether computers can be regarded

### External Sorting. Chapter 13. Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1

External Sorting Chapter 13 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Why Sort? A classic problem in computer science! Data requested in sorted order e.g., find students in increasing

### M.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Final Year) Computer Science. Paper - I : ADVANCED DATABASE MANAGEMENT SYSTEMS

(DMTCS 21) M.Tech. DEGREE EXAMINATION, DEC. - 2013 (Examination at the end of Final Year) Computer Science Paper - I : ADVANCED DATABASE MANAGEMENT SYSTEMS Time : 03 Hours Maximum Marks : 75 Answer question

### Depth and Excluded Courses

Depth and Excluded Courses Depth Courses for Communication, Control, and Signal Processing EECE 5576 Wireless Communication Systems 4 SH EECE 5580 Classical Control Systems 4 SH EECE 5610 Digital Control

### D A T A M I N I N G C L A S S I F I C A T I O N

D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.

### Scheduling. Open shop, job shop, flow shop scheduling. Related problems. Open shop, job shop, flow shop scheduling

Scheduling Basic scheduling problems: open shop, job shop, flow job The disjunctive graph representation Algorithms for solving the job shop problem Computational complexity of the job shop problem Open

### Master s Program in Information Systems

The University of Jordan King Abdullah II School for Information Technology Department of Information Systems Master s Program in Information Systems 2006/2007 Study Plan Master Degree in Information Systems

### Information Visualization in Project Management and Scheduling

Information Visualization in Project Management and Scheduling Ping Zhang (pzhang@mailbox.syr.edu) School of Information Studies Syracuse University Dan Zhu (dan-zhu@uiowa.edu) College of Business, University

### Computational Scientific Discovery and Cognitive Science Theories

Computational Scientific Discovery and Cognitive Science Theories Peter D Sozou University of Liverpool and LSE Joint work with: Mark Addis Birmingham City University and LSE Fernand Gobet University of

### ACT-R: A cognitive architecture. Terese Liadal liadal@stud.ntnu.no Seminar AI Tools Universität des Saarlandes, Wintersemester 06/07

ACT-R: A cognitive architecture Terese Liadal liadal@stud.ntnu.no Seminar AI Tools Universität des Saarlandes, Wintersemester 06/07 Dozenten: A. Ndiaye, M. Kipp, D. Heckmann, M. Feld 1 If the brain were

### npsolver A SAT Based Solver for Optimization Problems

npsolver A SAT Based Solver for Optimization Problems Norbert Manthey and Peter Steinke Knowledge Representation and Reasoning Group Technische Universität Dresden, 01062 Dresden, Germany peter@janeway.inf.tu-dresden.de

### The Virtual Assistant for Applicant in Choosing of the Specialty. Alibek Barlybayev, Dauren Kabenov, Altynbek Sharipbay

The Virtual Assistant for Applicant in Choosing of the Specialty Alibek Barlybayev, Dauren Kabenov, Altynbek Sharipbay Department of Theoretical Computer Science, Eurasian National University, Astana,

### Is a Single-Bladed Knife Enough to Dissect Human Cognition? Commentary on Griffiths et al.

Cognitive Science 32 (2008) 155 161 Copyright C 2008 Cognitive Science Society, Inc. All rights reserved. ISSN: 0364-0213 print / 1551-6709 online DOI: 10.1080/03640210701802113 Is a Single-Bladed Knife

### Levels of Analysis and ACT-R

1 Levels of Analysis and ACT-R LaLoCo, Fall 2013 Adrian Brasoveanu, Karl DeVries [based on slides by Sharon Goldwater & Frank Keller] 2 David Marr: levels of analysis Background Levels of Analysis John

### IE 680 Special Topics in Production Systems: Networks, Routing and Logistics*

IE 680 Special Topics in Production Systems: Networks, Routing and Logistics* Rakesh Nagi Department of Industrial Engineering University at Buffalo (SUNY) *Lecture notes from Network Flows by Ahuja, Magnanti

### School of Computer Science

School of Computer Science Computer Science - Honours Level - 2014/15 October 2014 General degree students wishing to enter 3000- level modules and non- graduating students wishing to enter 3000- level

### A Knowledge-based Product Derivation Process and some Ideas how to Integrate Product Development

A Knowledge-based Product Derivation Process and some Ideas how to Integrate Product Development (Position paper) Lothar Hotz and Andreas Günter HITeC c/o Fachbereich Informatik Universität Hamburg Hamburg,

### Checking for Dimensional Correctness in Physics Equations

Checking for Dimensional Correctness in Physics Equations C.W. Liew Department of Computer Science Lafayette College liew@cs.lafayette.edu D.E. Smith Department of Computer Science Rutgers University dsmith@cs.rutgers.edu

### IMPROVING RESOURCE LEVELING IN AGILE SOFTWARE DEVELOPMENT PROJECTS THROUGH AGENT-BASED APPROACH

IMPROVING RESOURCE LEVELING IN AGILE SOFTWARE DEVELOPMENT PROJECTS THROUGH AGENT-BASED APPROACH Constanta Nicoleta BODEA PhD, University Professor, Economic Informatics Department University of Economics,

### Vector storage and access; algorithms in GIS. This is lecture 6

Vector storage and access; algorithms in GIS This is lecture 6 Vector data storage and access Vectors are built from points, line and areas. (x,y) Surface: (x,y,z) Vector data access Access to vector

### Analysis of Algorithms, I

Analysis of Algorithms, I CSOR W4231.002 Eleni Drinea Computer Science Department Columbia University Thursday, February 26, 2015 Outline 1 Recap 2 Representing graphs 3 Breadth-first search (BFS) 4 Applications

### Reusable Knowledge-based Components for Building Software. Applications: A Knowledge Modelling Approach

Reusable Knowledge-based Components for Building Software Applications: A Knowledge Modelling Approach Martin Molina, Jose L. Sierra, Jose Cuena Department of Artificial Intelligence, Technical University

### Clustering. 15-381 Artificial Intelligence Henry Lin. Organizing data into clusters such that there is

Clustering 15-381 Artificial Intelligence Henry Lin Modified from excellent slides of Eamonn Keogh, Ziv Bar-Joseph, and Andrew Moore What is Clustering? Organizing data into clusters such that there is

### Parallel Programming at the Exascale Era: A Case Study on Parallelizing Matrix Assembly For Unstructured Meshes

Parallel Programming at the Exascale Era: A Case Study on Parallelizing Matrix Assembly For Unstructured Meshes Eric Petit, Loïc Thebault, Quang V. Dinh May 2014 EXA2CT Consortium 2 WPs Organization Proto-Applications

### Draft Martin Doerr ICS-FORTH, Heraklion, Crete Oct 4, 2001

A comparison of the OpenGIS TM Abstract Specification with the CIDOC CRM 3.2 Draft Martin Doerr ICS-FORTH, Heraklion, Crete Oct 4, 2001 1 Introduction This Mapping has the purpose to identify, if the OpenGIS

### Intelligent Behavior in Humans and Machines

Intelligent Behavior in Humans and Machines Pat Langley Computational Learning Laboratory Center for the Study of Language and Information Stanford University, Stanford, CA 94305 USA Abstract In this paper,

### What is ISO/IEC 15288? (A Concise Introduction)

Dr. Harold "Bud" Lawson 2004-10-13 1 (10) What is ISO/IEC 15288? (A Concise Introduction) What if all or the majority of the people of an organization (independent of their personal background and role)

### Dynamic Load Balancing in Charm++ Abhinav S Bhatele Parallel Programming Lab, UIUC

Dynamic Load Balancing in Charm++ Abhinav S Bhatele Parallel Programming Lab, UIUC Outline Dynamic Load Balancing framework in Charm++ Measurement Based Load Balancing Examples: Hybrid Load Balancers Topology-aware

### File Management. Chapter 12

Chapter 12 File Management File is the basic element of most of the applications, since the input to an application, as well as its output, is usually a file. They also typically outlive the execution

### SUBNETS, CIDR, AND CLASSLESS ADDRESSING

Announcements SUBNETS, CIDR, AND CLASSLESS ADDRESSING Internet Protocols CSC / ECE 573 Fall, 005 No office hours tomorrow (Wednesday) out of town No class on Thursday Fall break! Midterm exam next Tuesday!

### Masters in Information Technology

Computer - Information Technology MSc & MPhil - 2015/6 - July 2015 Masters in Information Technology Programme Requirements Taught Element, and PG Diploma in Information Technology: 120 credits: IS5101

### Analyzing Distribution of Traffic Capacity

Analyzing Distribution of Traffic Capacity D. Mancas, E. I. Manole, N. Enescu, S. Udristoiu Abstract In this paper, an evaluation of the network routing algorithms is made. In a real network, it is expected

### Appendix A. About RailSys 3.0. A.1 Introduction

Appendix A About RailSys 3.0 This appendix describes the software system for analysis RailSys used to carry out the different computational experiments and scenario designing required for the research

### An Extended Theory of Human Problem Solving

An Extended Theory of Human Problem Solving Pat Langley (langley@csli.stanford.edu) Seth Rogers (srogers@csli.stanford.edu) Computational Learning Laboratory Center for the Study of Language and Information

### A Tool to Support Knowledge Based Software Maintenance: The Software Service Bay

A Tool to Support Knowledge Based Software Maintenance: The Software Service Bay Jonathan I. Maletic Robert G. Reynolds Computer Science Department Wayne State University 431 State Hall Detroit, MI 48202

### SeaCloudDM: Massive Heterogeneous Sensor Data Management in the Internet of Things

SeaCloudDM: Massive Heterogeneous Sensor Data Management in the Internet of Things Jiajie Xu Institute of Software, Chinese Academy of Sciences (ISCAS) 2012-05-15 Outline 1. Challenges in IoT Data Management

### Mesh Generation and Load Balancing

Mesh Generation and Load Balancing Stan Tomov Innovative Computing Laboratory Computer Science Department The University of Tennessee April 04, 2012 CS 594 04/04/2012 Slide 1 / 19 Outline Motivation Reliable

### COMPARING MATRIX-BASED AND GRAPH-BASED REPRESENTATIONS FOR PRODUCT DESIGN

12 TH INTERNATIONAL DEPENDENCY AND STRUCTURE MODELLING CONFERENCE, 22 23 JULY 2010, CAMBRIDGE, UK COMPARING MATRIX-BASED AND GRAPH-BASED REPRESENTATIONS FOR PRODUCT DESIGN Andrew H Tilstra 1, Matthew I

### Fast Matching of Binary Features

Fast Matching of Binary Features Marius Muja and David G. Lowe Laboratory for Computational Intelligence University of British Columbia, Vancouver, Canada {mariusm,lowe}@cs.ubc.ca Abstract There has been

### Detecting and Correcting Errors of Omission After Explanation-based Learning

Detecting and Correcting Errors of Omission After Explanation-based Learning Michael J. Pazzani Department of Information and Computer Science University of California, Irvine, CA 92717 pazzani@ics.uci.edu

### EIIF DAS/RSD Replacement Prototype Initiative EI2F

EIIF DAS/RSD Replacement Prototype Initiative 1 Introduction The Data Acquisition System/Remote Status Display (DAS/RSD) system is an AOS initiative that brought together Monitor and Control (M&C) functions

### COGNITIVE SCIENCE 222

Minds, Brains, & Intelligent Behavior: An Introduction to Cognitive Science Bronfman 106, Tuesdays and Thursdays, 9:55 to 11:10 AM Williams College, Spring 2007 INSTRUCTOR CONTACT INFORMATION Andrea Danyluk

### Computer Science. Master of Science

Computer Science Master of Science The Master of Science in Computer Science program at UALR reflects current trends in the computer science discipline and provides students with a solid theoretical and

### Intelligent Behavior in Humans and Machines

Advances in Cognitive Systems 2 (2012) 3 12 Submitted 11/2012; published 12/2012 Intelligent Behavior in Humans and Machines Pat Langley PATRICK.W.LANGLEY@GMAIL.COM Silicon Valley Campus, Carnegie Mellon

### Heuristics for Dynamically Adapting Constraint Propagation in Constraint Programming

Heuristics for Dynamically Adapting Constraint Propagation in Constraint Programming Kostas Stergiou AI Lab University of the Aegean Greece CPAIOR 09 Workshop on Bound reduction techniques for CP and MINLP

### ParFUM: A Parallel Framework for Unstructured Meshes. Aaron Becker, Isaac Dooley, Terry Wilmarth, Sayantan Chakravorty Charm++ Workshop 2008

ParFUM: A Parallel Framework for Unstructured Meshes Aaron Becker, Isaac Dooley, Terry Wilmarth, Sayantan Chakravorty Charm++ Workshop 2008 What is ParFUM? A framework for writing parallel finite element

### 22C:22 (CS:2820) Object-Oriented Software Development

The University of Iowa 22C:22 (CS:2820) Object-Oriented Software Development Fall 2012 Software Complexity by Cesare Tinelli Complexity Software systems are complex artifacts Failure to master this complexity

### Course 395: Machine Learning

Course 395: Machine Learning Lecturers: Maja Pantic (maja@doc.ic.ac.uk) Stavros Petridis (sp104@doc.ic.ac.uk) Goal (Lectures): To present basic theoretical concepts and key algorithms that form the core

### Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling

Laboratory work in AI: First steps in Poker Playing Agents and Opponent Modeling Avram Golbert 01574669 agolbert@gmail.com Abstract: While Artificial Intelligence research has shown great success in deterministic

### Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing

Using Artificial Life Techniques to Generate Test Cases for Combinatorial Testing Presentation: TheinLai Wong Authors: T. Shiba,, T. Tsuchiya, T. Kikuno Osaka University Backgrounds Testing is an important

### Practical Applications of DATA MINING. Sang C Suh Texas A&M University Commerce JONES & BARTLETT LEARNING

Practical Applications of DATA MINING Sang C Suh Texas A&M University Commerce r 3 JONES & BARTLETT LEARNING Contents Preface xi Foreword by Murat M.Tanik xvii Foreword by John Kocur xix Chapter 1 Introduction

### 15-466 Computer Game Programming Intelligence I: Basic Decision-Making Mechanisms

15-466 Computer Game Programming Intelligence I: Basic Decision-Making Mechanisms Maxim Likhachev Robotics Institute Carnegie Mellon University AI Architecture from Artificial Intelligence for Games by

### Exploiting User and Process Context for Knowledge Management Systems

Workshop on User Modeling for Context-Aware Applications at the 8th Int. Conf. on User Modeling, July 13-16, 2001, Sonthofen, Germany Exploiting User and Process Context for Knowledge Management Systems

### Virtual Enterprise Transactions: A Cost Model

Virtual Enterprise Transactions: A Cost Model A. D Atri 1 and A. Motro 2 Abstract A transaction is a bilateral exchange between two parties in which goods are delivered in return for payment. In virtual

### ARTIFICIAL INTELLIGENCE METHODS IN EARLY MANUFACTURING TIME ESTIMATION

1 ARTIFICIAL INTELLIGENCE METHODS IN EARLY MANUFACTURING TIME ESTIMATION B. Mikó PhD, Z-Form Tool Manufacturing and Application Ltd H-1082. Budapest, Asztalos S. u 4. Tel: (1) 477 1016, e-mail: miko@manuf.bme.hu

### AN AI PLANNING APPROACH FOR GENERATING BIG DATA WORKFLOWS

AN AI PLANNING APPROACH FOR GENERATING BIG DATA WORKFLOWS Wesley Deneke 1, Wing-Ning Li 2, and Craig Thompson 2 1 Computer Science and Industrial Technology Department, Southeastern Louisiana University,

### Typical programme structures for MSc programmes in the School of Computing Science

Typical programme structures for MSc programmes in the School of Computing Science 1 If you have a good degree in a subject other than computing: MSc Information Technology MSc Software Development 2 MSc

### Extending Data Processing Capabilities of Relational Database Management Systems.

Extending Data Processing Capabilities of Relational Database Management Systems. Igor Wojnicki University of Missouri St. Louis Department of Mathematics and Computer Science 8001 Natural Bridge Road

### External Sorting. Why Sort? 2-Way Sort: Requires 3 Buffers. Chapter 13

External Sorting Chapter 13 Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke 1 Why Sort? A classic problem in computer science! Data requested in sorted order e.g., find students in increasing

### INTERMEDIATE QUALIFICATION

PROFESSIONAL QUALIFICATION SCHEME INTERMEDIATE QUALIFICATION SERVICE CAPABILITY PLANNING, PROTECTION AND OPTIMIZATION CERTIFICATE SYLLABUS The Swirl logo is a trade mark of the Cabinet Office ITIL is a

### Models for Train Scheduling. Krishna C. Jha Vice President - Research & Development krishna@innovativescheduling.com

Models for Train Scheduling Krishna C. Jha Vice President - Research & Development krishna@innovativescheduling.com Innovative Scheduling Overview Optimization and simulation solutions for transportation,

### Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information

Continuous Fastest Path Planning in Road Networks by Mining Real-Time Traffic Event Information Eric Hsueh-Chan Lu Chi-Wei Huang Vincent S. Tseng Institute of Computer Science and Information Engineering

### Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

### Software Engineering

Software Engineering Lecture 06: Design an Overview Peter Thiemann University of Freiburg, Germany SS 2013 Peter Thiemann (Univ. Freiburg) Software Engineering SWT 1 / 35 The Design Phase Programming in

### Treemaps for Search-Tree Visualization

Treemaps for Search-Tree Visualization Rémi Coulom July, 2002 Abstract Large Alpha-Beta search trees generated by game-playing programs are hard to represent graphically. This paper describes how treemaps

### Introduction to Artificial Intelligence

Introduction to Artificial Intelligence 1st year undergraduate degrees with AI and/or CS http://www.cs.bham.ac.uk/~jxb/iai.html Lecturer: Dr. John A. Bullinaria http://www.cs.bham.ac.uk/~jxb John A. Bullinaria,

### Towards an Agent Oriented approach to Software Engineering

Towards an Agent Oriented approach to Software Engineering Anna Perini and Paolo Bresciani ITC-IRST Via Sommarive 18, 38055 Povo, Trento, Italy perini,bresciani @irst.itc.it John Mylopoulos Department

### 01219211 Software Development Training Camp 1 (0-3) Prerequisite : 01204214 Program development skill enhancement camp, at least 48 person-hours.

(International Program) 01219141 Object-Oriented Modeling and Programming 3 (3-0) Object concepts, object-oriented design and analysis, object-oriented analysis relating to developing conceptual models

### INTERMEDIATE QUALIFICATION

PROFESSIONAL QUALIFICATION SCHEME INTERMEDIATE QUALIFICATION SERVICE LIFECYCLE SERVICE DESIGN CERTIFICATE SYLLABUS Page 2 of 18 Contents SERVICE DESIGN CERTIFICATE 4 Target Candidate 4 Prerequisite Entry

### DATA MINING TECHNIQUES AND APPLICATIONS

DATA MINING TECHNIQUES AND APPLICATIONS Mrs. Bharati M. Ramageri, Lecturer Modern Institute of Information Technology and Research, Department of Computer Application, Yamunanagar, Nigdi Pune, Maharashtra,

### Y. 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

### Automated Validation & Verification of Software Paper Presentation

Regression Test Selection for Java Software Salvador Valencia Rodríguez Automated Validation & Verification of Software Paper Presentation Paper authors Mary Jean Harrold James A. Jones Tongyu Li Donglin

### Abstraction in Computer Science & Software Engineering: A Pedagogical Perspective

Orit Hazzan's Column Abstraction in Computer Science & Software Engineering: A Pedagogical Perspective This column is coauthored with Jeff Kramer, Department of Computing, Imperial College, London ABSTRACT

### Computerized Decision Support

C_2 / 7.10.2014 Computerized Decision Support Objectives: understanding the foundation of decision making; Simon s 4 phases of decision making: intelligence, design, choice, implementation; the concept

### Process Modelling from Insurance Event Log

Process Modelling from Insurance Event Log P.V. Kumaraguru Research scholar, Dr.M.G.R Educational and Research Institute University Chennai- 600 095 India Dr. S.P. Rajagopalan Professor Emeritus, Dr. M.G.R

### Lecture 1. The Intelligent Agent Framework

Lecture 1 The Intelligent Agent Framework Friday 22 August 2003 William H. Hsu, KSU http://www.kddresearch.org http://www.cis.ksu.edu/~bhsu Reading for Next Class: Chapter 2, Russell and Norvig Lecture