6/3/2015Andrew Frank1 Communication: Information Content Andrew U. Frank Geoinformation TU Vienna Overheads at:

Slides:



Advertisements
Similar presentations
1 Machine Learning: Lecture 1 Overview of Machine Learning (Based on Chapter 1 of Mitchell T.., Machine Learning, 1997)
Advertisements

Based on text by S. Mourad "Priciples of Electronic Systems" Digital Testing: Design Representation and Fault Detection
Cs776 (Prasad)L4Poly1 Polymorphic Type System. cs776 (Prasad)L4Poly2 Goals Allow expression of “for all types T” fun I x = x I : ’a -> ’a Allow expression.
parity bit is 1: data should have an odd number of 1's
Apostles Chess Club Lesson #4. Algebraic Chess Notation System The board is set up from white’s position. Black must look at the board from the white.
SOFTWARE TESTING. INTRODUCTION  Software Testing is the process of executing a program or system with the intent of finding errors.  It involves any.
Ch 2.7 Error Detection & Correction CS-147 Tu Hoang.
Chapter 1 - An Introduction to Computers and Problem Solving
Solve for x. 28 = 4(2x + 1) = 8x = 8x + 8 – 8 – 8 20 = 8x = x Distribute Combine Subtract Divide.
09/22/07Andrew Frank1 Data Quality Ontology: An Ontology for Imperfect Knowledge Andrew U. Frank Geoinformation TU Vienna
© Janice Regan, CMPT 102, Sept CMPT 102 Introduction to Scientific Computer Programming The software development method algorithms.
Lecture 1 - Introduction 1.  Introduction to Game Theory  Basic Game Theory Examples  Strategic Games  More Game Theory Examples  Equilibrium  Mixed.
6/18/2015Andrew Frank1 Process in Ontology for the Analysis of the Cadastre Andrew U. Frank Geoinformation TU Vienna Overheads.
©Ian Sommerville 2000Software Engineering, 6/e, Chapter 91 Formal Specification l Techniques for the unambiguous specification of software.
Adversarial Search: Game Playing Reading: Chess paper.
Copyright © Cengage Learning. All rights reserved.
Grade 8 – Module 5 Module Focus Session
Operation Based Ontologies Gerhard Navratil Geoinformation TU Vienna
Game Playing State-of-the-Art  Checkers: Chinook ended 40-year-reign of human world champion Marion Tinsley in Used an endgame database defining.
INFORMATION THEORY BYK.SWARAJA ASSOCIATE PROFESSOR MREC.
Unit 2: Engineering Design Process
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Web Services Glossary Summary of Holger Lausen
Database Chess A server-based web gaming application by Jordan Arnold.
Patterns and Reuse. Patterns Reuse of Analysis and Design.
Problems, Problem Spaces and Search
Logic Programming Module 2AIT202 Website Lecturer: Dave Sharp Room: AG15
COEN 180 Erasure Correcting, Error Detecting, and Error Correcting Codes.
Data and Computer Communications by William Stallings Eighth Edition Digital Data Communications Techniques Digital Data Communications Techniques Click.
Synthetic Experiments for Spatial Reference Systems Engineering Approaches to Cognitive Science –Andrew U. Frank –Geoinformation –TU Vienna
The Equation Game. Why is an equation like a balance scale? 3 2x - 1 =
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
A Universal Turing Machine
09/22/07Andrew Frank1 E-cadastre in Europe: about National Spatial Data Infrastructure Andrew U. Frank Geoinformation TU Vienna
Backtracking and Games Eric Roberts CS 106B January 28, 2013.
Introduction to Cognitive Science Lecture #2 : Mental Representations Joe Lau Philosophy HKU.
07/12/ Data Representation Two’s Complement & Binary Arithmetic.
The E ngineering Design Process Advanced Design Applications The E ngineering Design Process Teacher Resource – The First Five Days: Day 2 © 2014 International.
Submitted To: Rutvi sarang Submitted By: Kushal Bhagat.
Basic Concepts of Encoding Codes and Error Correction 1.
Data Communications and Networking
Psychonomics: the ontology of psychology Psychonomics: The ontology of psychology.
1 Introduction to Machine Learning Chapter 1. cont.
Key Stage 3 National Strategy Planning and teaching mathematics 2 Geometry, ratio and proportion, and problem solving.
Hamming Distance & Hamming Code
09/03/20161 Information Representation Two’s Complement & Binary Arithmetic.
Error Detecting and Error Correcting Codes
Practical Session 10 Computer Architecture and Assembly Language.
At Home in College Revisiting Proportional Thinking and Linking up with Variables and Equations.
Laws and Algebras – A Comparison
parity bit is 1: data should have an odd number of 1's
A Universal Turing Machine
Type Checking and Type Inference
Warm Up Solve: Simplify:.
Section 14.2 Computing Partial Derivatives Algebraically
Chapter 4: Business Process and Functional Modeling, continued
Software Testing.
Computer Architecture and Assembly Language
: An Introduction to Computer Networks
Advanced Computer Networks
CS1001 Programming Fundamentals 3(3-0) Lecture 2
Intelligent Agents Chapter 2.
STATE SPACE REPRESENTATION
Lesson 1.1 How do you evaluate algebraic expressions and powers?
STATE SPACE REPRESENTATION
VMG Literacy Spelling Snooker.
Computer Architecture and Assembly Language
parity bit is 1: data should have an odd number of 1's
Presentation transcript:

6/3/2015Andrew Frank1 Communication: Information Content Andrew U. Frank Geoinformation TU Vienna Overheads at:

6/3/2015Andrew Frank2 Overview Case: games Case: Real World – Driving Conclusions

6/3/2015Andrew Frank3 Question: How to measure information? Shannon & Weaver: 1 bit = 1 binary decision (e.g. head or tail) Works for data. How to apply to information?

6/3/2015Andrew Frank4 Definitions Data : (machine readable) signs Information: answers to questions Descriptions of real world situations Used to decide on actions Information is derived from data.

6/3/2015Andrew Frank5 Case Board Games e.g. checkers (Dame) Differentiate: The game of checkers ( game ) The game I played last Wednesday evening ( play ) We analyzed the game by XX in 1995 ( match )

6/3/2015Andrew Frank6 Game as algebra: The game with rules is an algebra: class BoardGames g where initialize:: g move :: Player -> Position -> Position -> g -> g isFinished:: g -> Bool winner:: g -> Maybe Player This signature seems to fir for most board games. The difference is in the instantiation, where e.g. ‘move’ checks for legality of a move according to the rules.

6/3/2015Andrew Frank7 Play as a sequence of operations Playing a game is carrying out a sequence of operations: My partner and I moved yesterday evening alternatively pieces on my board. Algebraically: g0 = initialize g2 = move Black A2 A3. Move White A7 A6 $ g0 … g17 =move …. g16 w2 = winner g17

6/3/2015Andrew Frank8 Match as an abstract description of a play separated from instantiation Weiß: Kasparov Gary (2595) Schwarz: Pribyl Josef (2395) 1.d4 Sf6 2.c4 g6 3.Sc3 d5 4.cxd5 Sxd5 5.e4 Sxc3 6.bxc3 Lg7...

6/3/2015Andrew Frank9 Descriptions of a Match: Representation as observable physical phenomena (including mental representation) Information is linked to a representation, Information cannot exist independent of a representation

6/3/2015Andrew Frank10 Alternative Descriptions of a Match -Natural Language -Alternative Formal Descriptions Different encoding -A play (instantiation) -… All are equivalent (in terms of the algebra) They describe the same abstract match.

6/3/2015Andrew Frank11 Information as an Equivalence Class All descriptions which instantiate to the same play are equivalent. The information is the equivalence class homomorphism between the representations

6/3/2015Andrew Frank12 Measure of the Information Measure a representation (data) How many binary decisions are necessary for the representation? = Logarithm base 2 of the number of different messages Information content of all non-redundant representations must be equal.

6/3/2015Andrew Frank13 Chess: How many different messages in a ‘move’ operation: Player -> Position -> Position -> … 2 * 64 * 64 = = 2**7 7 bits per move This encodes legal and illegal situations; it is the information content of arbitrary positioning and moving of pieces on a board.

6/3/2015Andrew Frank14 Information Content Depends on the algebra underlying. The 7 bit calculation is the free algebra: All possible moves are legal Real play: many moves are illegal, -> algebra with axioms -> less possible cases -> less information Many moves are stupid; good chess players consider only reasonable moves -> less information again

6/3/2015Andrew Frank15 Redundancy Representations can contain more bits than the minimum necessary for a specific game. The additional information can help to guard against transmission errors (but is not necessarily effective) Better: use non-redundant representation and add redundancy systematically

6/3/2015Andrew Frank16 Conclusions: Information is the content of the class of equivalent representations – equivalent with respect to the algebra of the game. The equivalence class contains only the non- redundant information (with respect to a given algebra).

6/3/2015Andrew Frank17 Real World Situation: Driving in City A friend gives me driving instructions: Follow Rechte Wienzeile, turn into Schleifmuehlgasse … I check the web Rechte Wienzeile 0.7 km Schleifmuehlgasse 0.1 km … Or get a map:..

6/3/2015Andrew Frank18 Driving as an Algebra Driving in a city is like a game and formalized as an algebra: class Driving d where startAt :: Location -> Driver -> d -> d move :: Driver -> Location -> d -> d isAt :: Driver -> d -> Location This is a different model than the one used in the driving instructions.

6/3/2015Andrew Frank19 Equivalence of Instructions The instructions are equivalent if they lead me correctly along the same path. This is equivalence with respect to the algebra defined. Information content can be measured the same way than for a a game!

6/3/2015Andrew Frank20 Different drivers – different algebra: Possible instructions: move :: Location -> Location -> d -> d Drive to intersection Rechte Wienzeile/Schleifmuehlgasse, Drive to intersection Schleifmuehlgasse/Margaretenstrasse …

6/3/2015Andrew Frank21 Alternatives Web instructions: move :: Street -> Distance -> d -> d Rechte Wienzeile 0.7 km Schleifmuehlgasse 0.1 km … Oral instructions move :: Location -> Location -> d -> d turn :: Direction -> d -> d Follow Rechte Wienzeile to the intersection with Schleifmuehlgasse, turn right Follow Schleifmuehlgasse to the intersection with Margaretenstrasse, turn right

6/3/2015Andrew Frank22 Ontological commitment: Information is linked to a representation, Information cannot exist independent of a representation

6/3/2015Andrew Frank23 Information content Relative to an algebra: Minimal representation of description of a sequence of actions.

6/3/2015Andrew Frank24 Redundancy A representation can contain more data than necessary for the algebra, but not more information.

6/3/2015Andrew Frank25 Different algebra – different information content (from the same data) Information content is different relative to the algebra: Different people play different games; their algebras are different (e.g. more knowledge available)

6/3/2015Andrew Frank26 Information for sender and receiver is not always the same What is redundant for one may be necessary for the other. Information + Redundancy = constant

6/3/2015Andrew Frank27 Conclusion No simple answer to ‘how much information’ Algebra gives framework in which questions can be posed and answered for specific cases. Insight gained corresponds with experience.