Analysis of Trends and Patterns

Slides:



Advertisements
Similar presentations
The Maths of Google and the IPod Chris Budd We live in a world full of information.
Advertisements

Today’s agenda 1. WASI test results 2.Quiz or HW? 3.Your stage 2 reports 4.Individual activity points.
Noise, Information Theory, and Entropy (cont.) CS414 – Spring 2007 By Karrie Karahalios, Roger Cheng, Brian Bailey.
parity bit is 1: data should have an odd number of 1's
Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 – CHAPTER 4 GRAPHS 1.
COS 461 Fall 1997 COS 461: Networks and Distributed Computing u Prof. Ed Felten u u.
Least squares CS1114
Some computer fundamentals and jargon Memory: Basic element is a bit – value = 0 or 1 Collection of “n” bits is a “byte” Collection of several bytes is.
Computer Science 101 Data Encryption And Computer Networks.
Math for Liberal Studies.  Problems can occur when data is transmitted from one place to another  The two main problems are  transmission errors: the.
This material in not in your text (except as exercises) Sequence Comparisons –Problems in molecular biology involve finding the minimum number of edit.
Unit 1 Protocols Learning Objectives: Understand the need to detect and correct errors in data transmission.
CS 206 Introduction to Computer Science II 10 / 08 / 2008 Instructor: Michael Eckmann.
15-853Page :Algorithms in the Real World Error Correcting Codes I – Overview – Hamming Codes – Linear Codes.
Error Detection and Reliable Transmission EECS 122: Lecture 24 Department of Electrical Engineering and Computer Sciences University of California Berkeley.
Describing Angles Lesson
Hamming It Up with Hamming Codes CSE 461 Section Week 3.
1/26 Chapter 6 Digital Data Communication Techniques.
The Absolute Minimum Every Software Developer Absolutely, Positively Must Know About Unicode and Character Sets (No Excuses!) by Joel Spolsky Veronika.
Chapter 5 Data representation.
1 I.Introduction to Algorithm and Programming Algoritma dan Pemrograman – Teknik Informatika UK Petra 2009.
Lecture 18 Page 1 CS 111 Online Design Principles for Secure Systems Economy Complete mediation Open design Separation of privileges Least privilege Least.
Q UINCY COLLEGE Paralegal Studies Program Paralegal Studies Program Legal Research & Writing LAW-215 Writing A Legal Memorandum.
The Pigeonhole (Dirichlet’s box) Principle
It is physically impossible for any data recording or transmission medium to be 100% perfect 100% of the time over its entire expected useful life. As.
Lecture 2 Number Representation and accuracy
Cosc 2150: Computer Organization
Error Detection and Correction
1 Unit 1: Automata Theory and Formal Languages Readings 1, 2.2, 2.3.
Information Coding in noisy channel error protection:-- improve tolerance of errors error detection: --- indicate occurrence of errors. Source.
(Important to algorithm analysis )
ECS 152A 4. Communications Techniques. Asynchronous and Synchronous Transmission Timing problems require a mechanism to synchronize the transmitter and.
A powerful strategy: Symmetry The world is full of symmetry, so use it!
Problem Solving Techniques. Compiler n Is a computer program whose purpose is to take a description of a desired program coded in a programming language.
MIMO continued and Error Correction Code. 2 by 2 MIMO Now consider we have two transmitting antennas and two receiving antennas. A simple scheme called.
Data and Computer Communications by William Stallings Eighth Edition Digital Data Communications Techniques Digital Data Communications Techniques Click.
Quiz highlights 1.Probability of the song coming up after one press: 1/N. Two times? Gets difficult. The first or second? Or both? USE THE MAIN HEURISTICS:
EEC4113 Data Communication & Multimedia System Chapter 5: Error Control by Muhazam Mustapha, October 2011.
Outline Transmitters (Chapters 3 and 4, Source Coding and Modulation) (week 1 and 2) Receivers (Chapter 5) (week 3 and 4) Received Signal Synchronization.
DIGITAL COMMUNICATIONS Linear Block Codes
Math 104 Calculus I Part 6 INFINITE SERIES. Series of Constants We’ve looked at limits and sequences. Now, we look at a specific kind of sequential limit,
ERROR DETECTING AND CORRECTING CODES -BY R.W. HAMMING PRESENTED BY- BALAKRISHNA DHARMANA.
A powerful strategy: Symmetry The world is full of symmetry, so use it!
CS1Q Computer Systems Lecture 2 Simon Gay. Lecture 2CS1Q Computer Systems - Simon Gay2 Binary Numbers We’ll look at some details of the representation.
Analysis of Trends and Patterns The goal is to identify the trend or pattern precisely – Don’t stop at simply identifying the “next step”. – Explicitly.
Analysis of Trends and Patterns The goal is to identify the trend or pattern precisely – Don’t stop at simply identifying the “next step”. – Explicitly.
Combinatorics (Important to algorithm analysis ) Problem I: How many N-bit strings contain at least 1 zero? Problem II: How many N-bit strings contain.
Quiz highlights 1.Probability of the song coming up after one press: 1/N. Two times? Gets difficult. The first or second? Or both? USE THE MAIN HEURISTICS:
Measurements and Their Analysis. Introduction Note that in this chapter, we are talking about multiple measurements of the same quantity Numerical analysis.
Error Detecting and Error Correcting Codes
Chapter Nine: Data Transmission. Introduction Binary data is transmitted by either by serial or parallel methods Data transmission over long distances.
Reliability of Disk Systems. Reliability So far, we looked at ways to improve the performance of disk systems. Next, we will look at ways to improve the.
Jeffrey D. Ullman Stanford University.  A real story from CS341 data-mining project class.  Students involved did a wonderful job, got an “A.”  But.
parity bit is 1: data should have an odd number of 1's
2.8 Error Detection and Correction
Error Detection and Correction
MAT 105 Spring 2008 Chapter 17: Binary Codes.
Chapter 6.
Approximations and Round-Off Errors Chapter 3
Heuristic Algorithms via VBA
Information Redundancy Fault Tolerant Computing
RAID Redundant Array of Inexpensive (Independent) Disks
Fundamentals of Data Representation
Chapter Nine: Data Transmission
Floating Point Numbers - continuing
CS 325: CS Hardware and Software Organization and Architecture
Heuristic Algorithms via VBA
Heuristic Algorithms via VBA
parity bit is 1: data should have an odd number of 1's
2.8 Error Detection and Correction
Presentation transcript:

Analysis of Trends and Patterns The goal is to identify the trend or pattern precisely Don’t stop at simply identifying the “next step”. Explicitly state what the pattern is that defined the next element in the series.

Sample Problems A B A C A D A E __ __ __ 3 4 6 7 9 10 12 13 15 16 __ __ __ 2 7 4 9 6 11 8 13 __ __ __ 1 z 3 w 9 t 27 q 81 __ __ __ JKLMNO JKLMON JKLOMN JKOLMN __ __

Don’t be Blind For most problems, people use a relevant strategy from habit. There’s an excellent reason for this: It usually works!! Sometimes, the habit strategy is a bad match for the problem. In this case, people can act like they are “blind” to the solution. Example: Water jar problem.

Jars Problem You have 2 jars (odd shape), of sizes 5 gallons and 3 gallons. You need to measure out exactly 4 gallons. Or the bomb blows up…

Jars Problem #2 You have 3 jars, of sizes 11 quarts, 9 quarts, and 4 quarts. You would like to use these jars to collect 6 quarts of water in one jar. How?

Jars Problem You have 3 jars, of sizes 11 quarts, 9 quarts, and 4 quarts. You would like to use these jars to collect 6 quarts of water in one jar. How? A B C Goal 11 9 4 6 A – B + C 21 127 98 15 90 67 14 163 25 99 18 43 10 5 22 20 59 31 36 8 28 76 3

Einstellung “Einstellung” is the state of being “blind” or “set” in something. “Functional Fixedness”: People often fail to see alternate uses to an object once they assign it a role. People are fairly predictable in their susceptibility to functional blindness. Awareness of the problem helps to avoid it. This is real issue for students and in “real life” Example: Debugging, algorithm design

Lateral Thinking “Vertical Thinking” is sticking with the current approach, being rigid. “Lateral Thinking” is coming at a problem from a different (perhaps non-standard) direction. Often, just realizing that this should be done is enough to find a good solution (getting out of the old approach). Of course, it can be hard to tell when you are in the trap! It helps to have a “flexible” mindset.

Examples of Lateral Thinking Unsticking a car lock on a cold night Approach 1: Heat the key Approach 2: Unfreeze the lock (with alcohol) Need to iron a shirt, but no iron Iron with something else (a frying pan) Sheep in front of the truck Approach 1: Beep horn, try to push or scare sheep Approach 2: Lead the sheep behind the truck

A powerful strategy: Symmetry The world is full of symmetry, so use it!

The ubiquitous symmetry Truncated icosahedron. Paper model. Icosahedral symmetry in viruses. From Robijn Bruinsma’s web site

The ubiquitous symmetry

Heuristic: Look for Symmetry If you find a symmetry, you might be able to exploit it Symmetries give you “free” information, cut down on what to look at Symmetries define an invariant Symmetries indicate “special” points

Symmetry Problem (2D) A B Is molecule “A” the same chemical compound as “B”?

Symmetry Problem (2D) A B Is molecule “A” the same chemical compound as “B”?

Symmetry Problem (3D) B A Is molecule “A” the same chemical compound as “B”?

Symmetry Problem An NxN matrix “A” is such that for any element a_ij = a_ji. How much memory will it take to store such matrix? Assume 32 bits per float.

Symmetry Problem How many N-bit strings contain anywhere from none to (N-1)/2 zeros (inclusive)? N is odd. Hint: There are exactly the same number of strings with K zeroes as there are strings with (N - K) 1s. Say, N=3. (000) <=> (111) (010) <=> (101)

Symmetry Problem How many N-bit strings contain anywhere from none to (N-1)/2 zeros (inclusive)? N is odd. Let C(N,k) be the number of substrings that have exactly k zeroes. Then C(N, k) = C(N, N-k). The problem is symmetric under 1 -> 0 exchange. A substring with N-k zeroes contains k 1s. Now, C(N,0) + C(N, 1) + … + C(N,N) = all possible substrings = 2^N. We need the first 1/2 terms of the sum, which equal the second half. Thus, the answer is 2^N/2 = 2^(N-1).

Symmetry Problem What is the ratio of the areas of the two squares?

Symmetry Problem What is the ratio of the areas of the two squares? IS it clear now?

Symmetry Problem Your cabin is two miles due north of a stream that runs east-west. Your grandmother’s cabin is located 12 miles west and one mile north of your cabin. Every day, you go from your cabin to Grandma’s, but first visit the stream (to get fresh water for Grandma). What is the length of the route with minimum distance? Stuck? Draw a picture!

Problem: Compute 1 + 2 + 3 + …. + N

A more difficult one: Give an approximate estimate to N!, where N=2718.

Symmetry applied to CS: encodings and error correction First known encoding: Author: God, around 6,000 years ago. The genetic code. 4 letters, words of 3 letters each. 64 words in total. Error tolerance: extremely good. (the double helix. Two-fold redundancy)

Symmetry applied to CS: encodings and error correction Second attempt: Author: Baudot, 1874. English alphabet. Strings of 5 zeroes or ones. 32 different letters. (e.g. 10111 = X, 10101 = Y, etc. Error tolerance: none. How about English language? Is it error tolerant?

Symmetry applied to CS: error correction Two code words: (000) and (111). What if one bit is erred in transmission? How do you recover?

Symmetry applied to CS: error correction Two code words: (000) and (111). What if one bit is erred in transmission? How do you recover? Go to the nearest vertex!

Symmetry applied to CS: error correction Pretty poor solution…. First spacecraft to send back pictures of Mars (Mariner 4, 1965). Each picture ~ 4,000 pixels, 64 shades of grey. On-board power supply allowed only 8 bits per second to be sent…

Symmetry applied to CS: better error detection: code words: (000), (011), (110), (101). Corners of a tetrahedron. How do you detect an error?

Symmetry applied to CS: better error detection: code words: (000), (011), (110), (101). Corners of a tetrahedron. How do you detect an error? An error in one digit move the word off the tetrahedron.

Symmetry applied to CS: realistic error correction:

Symmetry applied to CS: realistic error correction: 1 1 Parity bit. (odd # of 1s in row) Parity bit. To transmit (0111) you send (01111010). In fact, this error correcting code defines a symmetric shape on an 8-dimensional hypercube