Stanford hci group / cs376 u Jeffrey Heer · 29 April 2009 Distributed Cognition.

Slides:



Advertisements
Similar presentations
Tower of Hanoi Tower of Hanoi is a mathematical puzzle invented by a French Mathematician Edouard Lucas in The game starts by having few discs stacked.
Advertisements

AE1APS Algorithmic Problem Solving John Drake
Welcome to the seminar course
CMSC 104, Version 8/061L04Algorithms1.ppt Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
COSC 2006 Data Structures I Recursion III
Disclaimer Leadership for the Common Core in Mathematics (CCLM^2) Project University of Wisconsin-Milwaukee, 2013–2014 This material was developed for.
Working Memory: The Feature Model Presented by: Umer Fareed.
Rectilinear Pattern Recognition Dan J. Nardi Masters Thesis April 11, 2003.
The use of a computerized automated feedback system Trevor Barker Dept. Computer Science.
Question: If 5 is a factor of 35, what are all of the factors of 35?
Software engineering as a model of understanding for learning and problem solving Paul Gibson and Jackie O’Kelly Computer Science Department NUI, Maynooth.
1 CSCD 300 Data Structures Recursion. 2 Proof by Induction Introduction only - topic will be covered in detail in CS 320 Prove: N   i = N ( N + 1.
Stanford hci group / cs376 u Jeffrey Heer · 2 June 2009 Research Topics In Human-Computer Interaction Course Summary.
The Distributive Property of Multiplication Yes, you can do it!
Teaching Teaching Discrete Mathematics and Algorithms & Data Structures Online G.MirkowskaPJIIT.
Towers of Hanoi. Introduction This problem is discussed in many maths texts, And in computer science an AI as an illustration of recursion and problem.
A Review of Recursion Dr. Jicheng Fu Department of Computer Science University of Central Oklahoma.
Department of Computer Science Data Structures Using C++ 2E Chapter 6: Recursion Learn about recursive Definitions Algorithms Functions Explore the base.
Recursion Textbook chapter Recursive Function Call a recursive call is a function call in which the called function is the same as the one making.
RESOURCES, TRADE-OFFS, AND LIMITATIONS Group 5 8/27/2014.
Review Introduction to Searching External and Internal Searching Types of Searching Linear or sequential search Binary Search Algorithms for Linear Search.
CMSC 1041 Algorithms I An Introduction to Algorithms.
Algorithms, Part 1 of 3 Topics  Definition of an Algorithm  Algorithm Examples  Syntax versus Semantics Reading  Sections
Recursion Review: A recursive function calls itself, but with a smaller problem – at least one of the parameters must decrease. The function uses the results.
Chapter 6.1: Recurrence Relations Discrete Mathematical Structures: Theory and Applications.
Computer Science 210 Computer Organization Course Introduction.
General Writing - Audience What is their level of knowledge? Advanced, intermediate, basic? Hard to start too basic – but have to use the right terminology.
New Papers and Websites. SIGCSE 2012 Keynote Address The Teacher’s Job is to Design Learning Experiences; Not Primarily to Impart Information Frederick.
Pass the Buck Every good programmer is lazy, arrogant, and impatient. In the game “Pass the Buck” you try to do as little work as possible, by making your.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Threaded Programming Lecture 1: Concepts. 2 Overview Shared memory systems Basic Concepts in Threaded Programming.
The Great Encounter Directions: Today you will be assigned a section from Chapter 4: The Great Encounter. Your task includes creating a flyer that advertises.
Operations with Scientific Notation SWBAT multiply and divide numbers in scientific notation.
1 UMBC CMSC 104, Section Fall 2002 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Algorithm Examples Syntax versus Semantics Reading.
A G E N D A Define GATE 1 Criteria for Admission Reflection Narratives Packet Format.
Do as many as you can in 5 minutes ,000,
HCI Meeting 1 Thursday, August 26. Class Activities [1] Student questionnaire Answer the following questions: 1.When and where was the computer mouse.
David Streader Computer Science Victoria University of Wellington Copyright: David Streader, Victoria University of Wellington Recursion COMP T1.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 9: The Tower of Hanoi.
Stanford hci group / cs376 u Jeffrey Heer · 19 May 2009 Speech & Multimodal Interfaces.
Stanford hci group / cs376 u Scott Klemmer · 12 October 2006 Evaluati on Methods.
1 CS1120: Recursion. 2 What is Recursion? A method is said to be recursive if the method definition contains a call to itself A recursive method is a.
Recursion Chapter What is recursion? Recursion occurs when a method calls itself, either directly or indirectly. Used to solve difficult, repetitive.
CMSC 104, L041 Algorithms, Part 1 of 3 Topics Definition of an Algorithm Example: The Euclidean Algorithm Syntax versus Semantics Reading Sections 3.1.
CPS Today’s topics Programming Recursion Invariants Reading Great Ideas, p Brookshear, Section Upcoming Copyrights, patents, and.
Actual tower vs. computer simulation
Recursion.
10.7 Operations with Scientific Notation
Algorithms, Part 1 of 3 The First step in the programming process
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Theory of Scattering Lecture 2.
Algorithms I: An Introduction to Algorithms
Introduction to Computer Science - Alice
Recursive Thinking Chapter 9 introduces the technique of recursive programming. As you have seen, recursive programming involves spotting smaller occurrences.
Foundations of Computer Science
2008/09/17: Lecture 4 CMSC 104, Section 0101 John Y. Park
CS1120: Recursion.
Multiplication using the grid method.
Research Topics in Human-Computer Interaction
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Using the Addition and Multiplication Principles Together
Addition = 53 Addend - One of the numbers being added.
Computational Thinking
The World of Science.
Distributive Property
Quiz: Computational Thinking
CS Problem Solving and Object Oriented Programming Spring 2019
Algorithms, Part 1 of 3 Topics Definition of an Algorithm
Computer Science 210 Computer Organization
Presentation transcript:

stanford hci group / cs376 u Jeffrey Heer · 29 April 2009 Distributed Cognition

Project Abstracts  For final version (due online Fri 7am)  Flesh out concrete details. What will you build? If running an experiment, what factors will you vary and what will you measure? What are your hypotheses and why? Provide rationale!  Need to add study recruitment plan and related work sections (see  ~8-9 paragraphs addressing required topics.  Iterate more than once! to discuss. 2

In-Class Exercise I need three volunteers. (No mathematical savants.)

Solve Multiplication Problems Contestant 1  Use long multiplication, with pen and paper Contestant 2  Use the Feynman Problem Solving Algorithm  (1) Write down the problem  (2) Think very hard  (3) Write down the answer

102 x

34 x

Multiplication 34 x

Zhang & Norman, The Representation of Numbers

What makes a representation “good”?  Capture important features  Remove irrelevant details  Provide external memory  Replace computation with perception  Appropriate to task

Tower of Hanoi Goal: Move stack to pole 3. Only one at a time. Top piece only. Smaller above larger.

Distributed Cognition The classical cognitive science approach can be applied with little modification to a unit of analysis that is larger than an individual person. One can still ask the same questions of a larger socio-technical system that one would ask of the individual. - Hutchins 1995

Distributed Cognition … many of the representations can be observed directly, so in some respects, this may be a much easier task than trying to determine the processes internal to the individual… Posing these questions in this way reveals how systems that are larger than an individual may have cognitive properties in their own right that cannot be reduced to the cognitive properties of individual persons. - Hutchins 1995

What is the role of theory in HCI?

What Still Matters about Distance? Gary and Judy Olson CS 547 HCI Seminar Friday 12-2pm, Gates B1