Enumerative Combinatoric Algorithms. Gray code
|
|
- Todd Trevor Watts
- 5 years ago
- Views:
Transcription
1 Enumerative Combinatoric Algorithms Gray code Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, 27
2 Standard binary code: Ex, 3 bits: b = b = b = 2 b = 3 b = 4 b = 5 b = 6 b = 7 Binary code Problem: In the transition from 3 to 4 every bit changes. Thus, if timing is not absolutely perfect (it never is) then any number from to 7 can be read. e.g.: position encoder, electronic circuits,... Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, 27 2
3 Gray code a.k.a. reflected binary code (Frank Gray, 947) binary Gray code: successive values differ in only one bit generate a Gray code (G(n)) for n bits from G(n ): reflected binary code G(n) G(n ) G(n ) n=: n=2: n=3: Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, Observe that this way also the last and the first number differ only in one position.
4 Uses applications initially for analog to digital conversion for compatible color television signals also used in telegraphy and position encoders (linear and rotary) error correction in digital communications genetic algorithms solving puzzles (Towers of Hanoi, Chinese rings puzzle, Spin-out,...) Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, 27 4
5 binary Gray code conversion b n b n 2... b b g n g n 2... g g b n = g n i < n b i = b i+ XOR g i g i = b i+ XOR b i X Y X XOR Y Ex: standard binary b? Ex: Gray code g? Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, 27 5
6 Puzzle: Tower of Hanoi Given: A stack of n different sized disks, arranged from largest on the bottom to smallest on top, placed on a rod, A. Plus two more empty rods, B and C. Valid move: move one disk from one rod to another one but not placing a larger disk on top of a smaller disk. Task: Move the stack (tower) from rod A to rod B (using rod C) (... with minimum number of moves) Solution (recursive): to move a tower, T (n), of size n from A to B using C: move T (n ) from A to C using B, then the largest disk from A to B, and then move T (n ) from C to B using A. Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms,
7 Tower of Hanoi vs. Gray code label the disks from (smallest) to n (largest) g n g n 2... g g... a number in Gray code The changes in the Gray code (if bit i changes) define the disk (disk i) that has to be moved: disk always cw (or always ccw, depending on parity) disks i, < i < n, unique way to move Ex: n = 4 A start: all 4 disks on A goal: all 4 disks on B n is even move ccw Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, C B
8 Tower of Hanoi vs. Gray code A B C Ex: n = 4 A start: all 4 disks on A goal: all 4 disks on B n is even move ccw Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, C B
9 Tower of Hanoi vs. Gray code M. Gardner proved (957,59) that the Tower of Hanoi problem is isomorphic to finding a Hamiltonian path on an n-hypercube. n-hypercube has 2 n vertices a path visiting them all has 2 n edges at least 2 n moves Ex: n = 4 A start: all 4 disks on A goal: all 4 disks on B n is even move ccw Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, C B
10 Another puzzle: Spin-out very similar to Chinese Rings puzzle 7 spinners take one of two possible orientations:, initially all are ; the goal is that all are problem: only the rightmost spinner can rotate and any spinner which is the left neighbor of the rightmost Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms,
11 Another puzzle: Spin-out Solution: n spinners from left to right g n... g spinner i is g i = ; spinner i is g i = traverse the Gray code from... to... in reverse direction Ex: n = 4 done Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms,
12 Generate next Gray code number G[i] G[i + ] count the number # of s in G[i] if # is even then flip g of G[i] to get G[i + ] else flip the left neighbor (bit position) of the rightmost func nextgray(g):... g = g[n ]... g[] if (#(g) is even) then flip g[]; else r index of rightmost of g if (r < n ) then flip g[r+]; else flip g[r]; fi fi return (g)... next Gray number (G[] if input was G[2 n ]) Oswin Aichholzer (slides TH): Enumerative Combinatoric Algorithms, 27 9
An Efficient Implementation of Tower of Hanoi using Gray Codes
GRD Journals Global Research and Development Journal for Engineering National Conference on Computational Intelligence Systems (NCCIS 17) March 2017 e-issn: 2455-5703 An Efficient Implementation of Tower
More informationPUZZLES ON GRAPHS: THE TOWERS OF HANOI, THE SPIN-OUT PUZZLE, AND THE COMBINATION PUZZLE
PUZZLES ON GRAPHS: THE TOWERS OF HANOI, THE SPIN-OUT PUZZLE, AND THE COMBINATION PUZZLE LINDSAY BAUN AND SONIA CHAUHAN ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. The Towers of Hanoi is a well
More informationLet start by revisiting the standard (recursive) version of the Hanoi towers problem. Figure 1: Initial position of the Hanoi towers.
Coding Denis TRYSTRAM Lecture notes Maths for Computer Science MOSIG 1 2017 1 Summary/Objective Coding the instances of a problem is a tricky question that has a big influence on the way to obtain the
More informationGames of Skill ANSWERS Lesson 1 of 9, work in pairs
Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the
More informationLAMC Junior Circle January 22, Oleg Gleizer. The Hanoi Tower. Part 2
LAMC Junior Circle January 22, 2012 Oleg Gleizer The Hanoi Tower Part 2 Definition 1 An algorithm is a finite set of clear instructions to solve a problem. An algorithm is called optimal, if the solution
More informationMathematics Competition Practice Session 6. Hagerstown Community College: STEM Club November 20, :00 pm - 1:00 pm STC-170
2015-2016 Mathematics Competition Practice Session 6 Hagerstown Community College: STEM Club November 20, 2015 12:00 pm - 1:00 pm STC-170 1 Warm-Up (2006 AMC 10B No. 17): Bob and Alice each have a bag
More informationGames of Skill Lesson 1 of 9, work in pairs
Lesson 1 of 9, work in pairs 21 (basic version) The goal of the game is to get the other player to say the number 21. The person who says 21 loses. The first person starts by saying 1. At each turn, the
More informationCS 32 Puzzles, Games & Algorithms Fall 2013
CS 32 Puzzles, Games & Algorithms Fall 2013 Study Guide & Scavenger Hunt #2 November 10, 2014 These problems are chosen to help prepare you for the second midterm exam, scheduled for Friday, November 14,
More informationBalanced Trees. Balanced Trees Tree. 2-3 Tree. 2 Node. Binary search trees are not guaranteed to be balanced given random inserts and deletes
Balanced Trees Balanced Trees 23 Tree Binary search trees are not guaranteed to be balanced given random inserts and deletes! Tree could degrade to O(n) operations Balanced search trees! Operations maintain
More informationA NEW PUZZLE FOR ITERATED COMPLETE GRAPHS OF ANY DIMENSION
A NEW PUZZLE FOR ITERATED COMPLETE GRAPHS OF ANY DIMENSION ELIZABETH SKUBAK AND NICHOLAS STEVENSON ADVISOR: PAUL CULL OREGON STATE UNIVERSITY ABSTRACT. The Towers of Hanoi puzzle can be use to label a
More informationMA/CSSE 473 Day 14. Permutations wrap-up. Subset generation. (Horner s method) Permutations wrap up Generating subsets of a set
MA/CSSE 473 Day 14 Permutations wrap-up Subset generation (Horner s method) MA/CSSE 473 Day 14 Student questions Monday will begin with "ask questions about exam material time. Exam details are Day 16
More informationGeometric Functions. The color channel toolbar buttons are disabled.
Introduction to Geometric Transformations Geometric Functions The geometric transformation commands are used to shift, rotate, scale, and align images. For quick rotation by 90 or mirroring of an image,
More informationDirected Towers of Hanoi
Richard Anstee, UBC, Vancouver January 10, 2019 Introduction The original Towers of Hanoi problem considers a problem 3 pegs and with n different sized discs that fit on the pegs. A legal move is to move
More informationGames, Triangulations, Theory
KTdCW Spieltheorie Games, Triangulations, Theory Oswin Aichholzer, University of Technology, Graz (Austria) KTdCW, Spieltheorie, Aichholzer NIM & Co 0 What is a (mathematical) game? 2 players [ A,B / L(eft),R(ight)
More information20 Memory Drawers. Copyright 2002 IPP Design Competition All rights reserved. Puzzle Solution:
20 Memory Drawers This work memorizes 120 (The factorial of 5) kinds of turn to open the drawers. The big base is full of 30 device plates. The plates move vertically and horizontally, and change the arrangements
More informationGraphs of Tilings. Patrick Callahan, University of California Office of the President, Oakland, CA
Graphs of Tilings Patrick Callahan, University of California Office of the President, Oakland, CA Phyllis Chinn, Department of Mathematics Humboldt State University, Arcata, CA Silvia Heubach, Department
More informationComputer Graphics (CS/ECE 545) Lecture 7: Morphology (Part 2) & Regions in Binary Images (Part 1)
Computer Graphics (CS/ECE 545) Lecture 7: Morphology (Part 2) & Regions in Binary Images (Part 1) Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Recall: Dilation Example
More informationGray code and loopless algorithm for the reflection group D n
PU.M.A. Vol. 17 (2006), No. 1 2, pp. 135 146 Gray code and loopless algorithm for the reflection group D n James Korsh Department of Computer Science Temple University and Seymour Lipschutz Department
More informationECS 20 (Spring 2013) Phillip Rogaway Lecture 1
ECS 20 (Spring 2013) Phillip Rogaway Lecture 1 Today: Introductory comments Some example problems Announcements course information sheet online (from my personal homepage: Rogaway ) first HW due Wednesday
More informationEmbedded Systems and Software. Rotary Pulse Generators
Embedded Systems and Software Rotary Pulse Generators Slide 1 What Is An RPG? RPG = Rocket Propelled Grenade RPG = Rotary Pulse Generator Slide 2 Rotary Encoders Switch Switch Output Quadrature output
More informationLesson Plan for Teachers
Grade level recommendation: 8 th grade Lesson Plan for Teachers Learning goals: Problem solving Reasoning Basic algebra Exponents Recursive equations Explicit equations NCTM standards correlation: http://www.nctm.org/standards/
More informationWhat is an ENCODER. An electronic component that generates an ON and OFF output signal periodically.
Encoder 2 What is an ENCODER ENCODER Make signal or code. An electronic component that generates an ON and OFF output signal periodically. Difference between Encoder and Potentiometer An incremental encoder
More informationOrganizing Gray Code States for Maximum Error Tolerance
Organizing Gray Code States for Maximum Error Tolerance NICHOLAS HARKIOLAKIS School of Electrical and Computer Engineering National Technical University of Athens 9 Iroon Politechniou St., 57 8 Athens
More informationContemplation of Synchronous Gray Code Counter and its Variants using Reversible Logic Gates
Contemplation of Synchronous Gray Code Counter and its Variants using Reversible Logic Gates Rakshith Saligram Dept. of Electronics and Communication B M S College Of Engineering Bangalore, India rsaligram@gmail.com
More information6.111 Lecture # 19. Controlling Position. Some General Features of Servos: Servomechanisms are of this form:
6.111 Lecture # 19 Controlling Position Servomechanisms are of this form: Some General Features of Servos: They are feedback circuits Natural frequencies are 'zeros' of 1+G(s)H(s) System is unstable if
More informationTwo Flipping Puzzles...
Mugged by a puzzle... Two Flipping Puzzles... Colin Wright Pure Maths Day Keele University While swapping puzzles during the Recreational Maths Colloquium in January 2015 I was presented with the question
More informationarxiv: v1 [cs.cc] 21 Jun 2017
Solving the Rubik s Cube Optimally is NP-complete Erik D. Demaine Sarah Eisenstat Mikhail Rudoy arxiv:1706.06708v1 [cs.cc] 21 Jun 2017 Abstract In this paper, we prove that optimally solving an n n n Rubik
More informationEvacuation and a Geometric Construction for Fibonacci Tableaux
Evacuation and a Geometric Construction for Fibonacci Tableaux Kendra Killpatrick Pepperdine University 24255 Pacific Coast Highway Malibu, CA 90263-4321 Kendra.Killpatrick@pepperdine.edu August 25, 2004
More informationEncoding and Code Wheel Proposal for TCUT1800X01
VISHAY SEMICONDUCTORS www.vishay.com Optical Sensors By Sascha Kuhn INTRODUCTION AND BASIC OPERATION The TCUT18X1 is a 4-channel optical transmissive sensor designed for incremental and absolute encoder
More informationCompressing Pattern Databases
Compressing Pattern Databases Ariel Felner and Ram Meshulam Computer Science Department Bar-Ilan University Ramat-Gan, Israel 92500 Email: ffelner,meshulr1g@cs.biu.ac.il Robert C. Holte Computing Science
More informationQuarter Turn Baxter Permutations
Quarter Turn Baxter Permutations Kevin Dilks May 29, 2017 Abstract Baxter permutations are known to be in bijection with a wide number of combinatorial objects. Previously, it was shown that each of these
More informationOn Variable Dependencies and Compressed Pattern Databases
On Variable Dependencies and Compressed Pattern Databases Malte Helmert 1 Nathan Sturtevant Ariel elner 1 University of Basel, Switzerland University of Denver, USA Ben Gurion University, Israel SoCS 017
More informationGame, Set, and Match Carl W. Lee September 2016
Game, Set, and Match Carl W. Lee September 2016 Note: Some of the text below comes from Martin Gardner s articles in Scientific American and some from Mathematical Circles by Fomin, Genkin, and Itenberg.
More informationBuilding a Heuristic for Greedy Search
Building a Heuristic for Greedy Search Christopher Wilt and Wheeler Ruml Department of Computer Science Grateful thanks to NSF for support. Wheeler Ruml (UNH) Heuristics for Greedy Search 1 / 11 This Talk
More informationLecture 02: Digital Logic Review
CENG 3420 Lecture 02: Digital Logic Review Bei Yu byu@cse.cuhk.edu.hk CENG3420 L02 Digital Logic. 1 Spring 2017 Review: Major Components of a Computer CENG3420 L02 Digital Logic. 2 Spring 2017 Review:
More informationMore Great Ideas in Theoretical Computer Science. Lecture 1: Sorting Pancakes
15-252 More Great Ideas in Theoretical Computer Science Lecture 1: Sorting Pancakes January 19th, 2018 Question If there are n pancakes in total (all in different sizes), what is the max number of flips
More informationCSE 21 Practice Final Exam Winter 2016
CSE 21 Practice Final Exam Winter 2016 1. Sorting and Searching. Give the number of comparisons that will be performed by each sorting algorithm if the input list of length n happens to be of the form
More informationStack permutations and an order relation for binary trees
University of Wollongong Research Online Department of Computing Science Working Paper Series Faculty of Engineering and Information Sciences 1982 Stack permutations and an order relation for binary trees
More informationNuSMV: Planning as Model Checking
NuSMV: Planning as Model Checking Alessandra Giordani agiordani@disi.unitn.it http://disi.unitn.it/~agiordani Formal Methods Lab Class, April 30, 2014 *These slides are derived from those by Stefano Tonetta,
More informationThe Apprentices Tower of Hanoi
Journal of Mathematical Sciences (2016) 1-6 ISSN 272-5214 Betty Jones & Sisters Publishing http://www.bettyjonespub.com Cory B. H. Ball 1, Robert A. Beeler 2 1. Department of Mathematics, Florida Atlantic
More informationRotary Pulse Generators and other Lab 3 Considerations
Rotary Encoders (Pulse Generators) Specifications 3315 ECW EPS EAW Rotary Pulse Generators and other Lab 3 Considerations Product Photo Type Package Diameter Sealable Incremental 9mm IP67 Incremental 22mm
More informationPuzzling Math, Part 2: The Tower of Hanoi & the End of the World!
Puzzling Math, Part 2: The Tower of Hanoi & the End of the World! by Jeremy Knight, Grants Pass High School, jeremy@knightmath.com The Oregon Mathematics Teacher, Jan./Feb. 2014 Grade Level: 6-12+ Objectives:
More informationExtended Introduction to Computer Science CS1001.py
Extended Introduction to Computer Science CS1001.py Lecture 13: Recursion (4) - Hanoi Towers, Munch! Instructors: Daniel Deutch, Amir Rubinstein, Teaching Assistants: Amir Gilad, Michal Kleinbort School
More informationTopic 23 Red Black Trees
Topic 23 "People in every direction No words exchanged No time to exchange And all the little ants are marching Red and Black antennas waving" -Ants Marching, Dave Matthew's Band "Welcome to L.A.'s Automated
More informationwood (koa, maple, ebony, cocobolo, new guinea rosewood) and metal (brass, copper, steel) Secret Opening Box
27 Clutch Box Puzzle Goal: Materials: Classification: Open the box wood (koa, maple, ebony, cocobolo, new guinea rosewood) and metal (brass, copper, steel) Secret Opening Box 27 Clutch Box Puzzle Solution:
More informationModule 3 Greedy Strategy
Module 3 Greedy Strategy Dr. Natarajan Meghanathan Professor of Computer Science Jackson State University Jackson, MS 39217 E-mail: natarajan.meghanathan@jsums.edu Introduction to Greedy Technique Main
More informationMagnetic Towers of Hanoi and their Optimal Solutions
Magnetic Towers of Hanoi and their Optimal olutions Uri Levy Atlantium Technologies, Har-Tuv Industrial Park, Israel uril@atlantium.com August 5, 00 Abstract The Magnetic Tower of Hanoi puzzle a modified
More informationNOVOTURN Multiturn Sensor non-contacting. Series RSM-2800
NOVOTURN Multiturn Sensor non-contacting Series RSM-2800 Special features Non-contacting, magnetic Long life Electrical range 720 up to 5760 in 360 -steps available (2 to 16 turns) True-Power-On System:
More informationGame, Set, and Match Carl W. Lee September 2016
Game, Set, and Match Carl W. Lee September 2016 Note: Some of the text below comes from Martin Gardner s articles in Scientific American and some from Mathematical Circles by Fomin, Genkin, and Itenberg.
More informationCOMP 2804 solutions Assignment 4
COMP 804 solutions Assignment 4 Question 1: On the first page of your assignment, write your name and student number. Solution: Name: Lionel Messi Student number: 10 Question : Let n be an integer and
More information((( ))) CS 19: Discrete Mathematics. Please feel free to ask questions! Getting into the mood. Pancakes With A Problem!
CS : Discrete Mathematics Professor Amit Chakrabarti Please feel free to ask questions! ((( ))) Teaching Assistants Chien-Chung Huang David Blinn http://www.cs cs.dartmouth.edu/~cs Getting into the mood
More informationNuman Sheikh FC College Lahore
Numan Sheikh FC College Lahore 2 Five men crash-land their airplane on a deserted island in the South Pacific. On their first day they gather as many coconuts as they can find into one big pile. They decide
More informationSolving the Rubik s Cube
Solving the Rubik s Cube The Math Behind the Cube: How many different combinations are possible on a 3x3 cube? There are 6 sides each with 9 squares giving 54 squares. Thus there will be 54 53 52 51 50
More informationSEVENTH EDITION and EXPANDED SEVENTH EDITION
SEVENTH EDITION and EXPANDED SEVENTH EDITION Slide 4-1 Chapter 4 Systems of Numeration 4.1 Additive, Multiplicative, and Ciphered Systems of Numeration Systems of Numeration A system of numeration consists
More informationCS256 Applied Theory of Computation
CS256 Applied Theory of Computation Parallel Computation III John E Savage Overview Mapping normal algorithms to meshes Shuffle operations on linear arrays Shuffle operations on two-dimensional arrays
More informationMidterm Examination. CSCI 561: Artificial Intelligence
Midterm Examination CSCI 561: Artificial Intelligence October 10, 2002 Instructions: 1. Date: 10/10/2002 from 11:00am 12:20 pm 2. Maximum credits/points for this midterm: 100 points (corresponding to 35%
More informationWeek 1. 1 What Is Combinatorics?
1 What Is Combinatorics? Week 1 The question that what is combinatorics is similar to the question that what is mathematics. If we say that mathematics is about the study of numbers and figures, then combinatorics
More informationKAERI Feeder Tube Inspection Using EMAT Generated Circumferential Guided Waves
Sonic Sensors www.sonicsensors.com 1of 9 KAERI Feeder Tube Inspection Using EMAT Generated Circumferential Guided Waves Objective: Inspection of small diameter pie with complex curves. The principal defects
More informationOdd king tours on even chessboards
Odd king tours on even chessboards D. Joyner and M. Fourte, Department of Mathematics, U. S. Naval Academy, Annapolis, MD 21402 12-4-97 In this paper we show that there is no complete odd king tour on
More informationAnalyzing ELLIE - the Story of a Combinatorial Game
Analyzing ELLIE - the Story of a Combinatorial Game S. Heubach 1 P. Chinn 2 M. Dufour 3 G. E. Stevens 4 1 Dept. of Mathematics, California State Univ. Los Angeles 2 Dept. of Mathematics, Humboldt State
More informationOthello/Reversi using Game Theory techniques Parth Parekh Urjit Singh Bhatia Kushal Sukthankar
Othello/Reversi using Game Theory techniques Parth Parekh Urjit Singh Bhatia Kushal Sukthankar Othello Rules Two Players (Black and White) 8x8 board Black plays first Every move should Flip over at least
More informationLecture 19 November 6, 2014
6.890: Algorithmic Lower Bounds: Fun With Hardness Proofs Fall 2014 Prof. Erik Demaine Lecture 19 November 6, 2014 Scribes: Jeffrey Shen, Kevin Wu 1 Overview Today, we ll cover a few more 2 player games
More informationrepeated multiplication of a number, for example, 3 5. square roots and cube roots of numbers
NUMBER 456789012 Numbers form many interesting patterns. You already know about odd and even numbers. Pascal s triangle is a number pattern that looks like a triangle and contains number patterns. Fibonacci
More informationDigital Communication Systems ECS 452
Digital Communication Systems ECS 452 Asst. Prof. Dr. Prapun Suksompong prapun@siit.tu.ac.th 5. Channel Coding 1 Office Hours: BKD, 6th floor of Sirindhralai building Tuesday 14:20-15:20 Wednesday 14:20-15:20
More informationHeuristic Search with Pre-Computed Databases
Heuristic Search with Pre-Computed Databases Tsan-sheng Hsu tshsu@iis.sinica.edu.tw http://www.iis.sinica.edu.tw/~tshsu 1 Abstract Use pre-computed partial results to improve the efficiency of heuristic
More information5.1 State-Space Search Problems
Foundations of Artificial Intelligence March 7, 2018 5. State-Space Search: State Spaces Foundations of Artificial Intelligence 5. State-Space Search: State Spaces Malte Helmert University of Basel March
More informationPerimeter and Area: The Mysterious Connection Assessment
Perimeter and Area: The Mysterious Connection Assessment 1. Given the polygon below, which of the following polygons does not have the same perimeter? A. B. C. D. The Mysterious Connection Assessment Materials
More informationA Note on Downup Permutations and Increasing Trees DAVID CALLAN. Department of Statistics. Medical Science Center University Ave
A Note on Downup Permutations and Increasing 0-1- Trees DAVID CALLAN Department of Statistics University of Wisconsin-Madison Medical Science Center 1300 University Ave Madison, WI 53706-153 callan@stat.wisc.edu
More informationCMPS 12A Introduction to Programming Programming Assignment 5 In this assignment you will write a Java program that finds all solutions to the n-queens problem, for. Begin by reading the Wikipedia article
More informationGame Playing Part 1 Minimax Search
Game Playing Part 1 Minimax Search Yingyu Liang yliang@cs.wisc.edu Computer Sciences Department University of Wisconsin, Madison [based on slides from A. Moore http://www.cs.cmu.edu/~awm/tutorials, C.
More information18 Two-Dimensional Shapes
18 Two-Dimensional Shapes CHAPTER Worksheet 1 Identify the shape. Classifying Polygons 1. I have 3 sides and 3 corners. 2. I have 6 sides and 6 corners. Each figure is made from two shapes. Name the shapes.
More informationAn Approach to Korean License Plate Recognition Based on Vertical Edge Matching
An Approach to Korean License Plate Recognition Based on Vertical Edge Matching Mei Yu and Yong Deak Kim Ajou University Suwon, 442-749, Korea Abstract License plate recognition (LPR) has many applications
More information6. FUNDAMENTALS OF CHANNEL CODER
82 6. FUNDAMENTALS OF CHANNEL CODER 6.1 INTRODUCTION The digital information can be transmitted over the channel using different signaling schemes. The type of the signal scheme chosen mainly depends on
More informationUMBC 671 Midterm Exam 19 October 2009
Name: 0 1 2 3 4 5 6 total 0 20 25 30 30 25 20 150 UMBC 671 Midterm Exam 19 October 2009 Write all of your answers on this exam, which is closed book and consists of six problems, summing to 160 points.
More informationFeatures & Benefits 360, 512, 720, 1000, 1024, 1440, 1800, 2000, 2048, 2880, 3000, 3600, 4000, 4096, 5000, 5120, 6000, 7200, 8000, 8192, 9000, 10000
CP-800/900 Series Size-25 Housed Rotary Optical Encoders Solid or hollow shaft, incremental, sine/cosine, or absolute format Allied Motion s CP800/900 series are size-25 (2.5 in. (63.5mm)) rotary optical
More informationRotary Measuring Technology
Our ATEX encoders now also carry approval for Dust Flameproof-enclosure type of construction with approval for Zone 1 and 21 ExII2GEExdIICT6 and ExII2DIP6xT85 C Shaft ø 12 mm One type for every situation:
More informationFrom Tetris to polyominoes generation. June 3rd, 2016 GASCOM 2016 La Marana, Bastia, France.
From Tetris to polyominoes generation June 3rd, 2016 GASCOM 2016 La Marana, Bastia, France. Authors Enrico Formenti Laboratoire I3S Université Nice Sophia Antipolis Paolo Massazza Università dell Insubria
More informationComparative analysis of speed decoding algorithms for rotary incremental encoders
Ahmad Arslan Comparative analysis of speed decoding algorithms for rotary incremental encoders School of Electrical Engineering Thesis submitted for examination for the degree of Master of Science in Technology.
More informationFinding and Characterizing Knights Tours on the Chessboard
Finding and Characterizing Knights Tours on the 4 4 4 Chessboard Lydia Miller Goshen College Mathematics Senior Seminar Advisor: David Housman April 2018 Miller 2018 Introduction The Knight s Tour Problem
More informationEquivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns
Equivalence Classes of Permutations Modulo Replacements Between 123 and Two-Integer Patterns Vahid Fazel-Rezai Phillips Exeter Academy Exeter, New Hampshire, U.S.A. vahid fazel@yahoo.com Submitted: Sep
More informationLEARNING ABOUT MATH FOR K TO 5. Dorset Public School. April 6, :30 pm 8:00 pm. presented by Kathy Kubota-Zarivnij
LEARNING ABOUT MATH FOR K TO 5 Dorset Public School April 6, 2016 6:30 pm 8:00 pm presented by Kathy Kubota-Zarivnij kathkubo@rogers.com TODAY S MATH TOOLS FOR colour square tiles Hexalink cubes KKZ, 2016
More informationAbsolute Encoders Multiturn
The Sendix F36 multiturn with the patented Intelligent Scan Technology is an optical multiturn encoder in miniature format, without gears and with 00% insensitivity to magnetic fields. With a size of just
More informationCoin-Moving Puzzles. arxiv:cs/ v1 [cs.dm] 31 Mar Introduction. Erik D. Demaine Martin L. Demaine Helena A. Verrill
Coin-Moving Puzzles Erik D. Demaine Martin L. Demaine Helena A. Verrill arxiv:cs/0000v [cs.dm] Mar 00 Abstract We introduce a new family of one-player games, involving the movement of coins from one configuration
More information2 Building Blocks. There is often the need to compare two binary values.
2 Building Blocks 2.1 Comparators There is often the need to compare two binary values. This is done using a comparator. A comparator determines whether binary values A and B are: 1. A = B 2. A < B 3.
More informationUnit 12: Artificial Intelligence CS 101, Fall 2018
Unit 12: Artificial Intelligence CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Explain the difference between procedural and declarative knowledge. Describe the
More informationLecture5: Lossless Compression Techniques
Fixed to fixed mapping: we encoded source symbols of fixed length into fixed length code sequences Fixed to variable mapping: we encoded source symbols of fixed length into variable length code sequences
More informationOutline. In One Slide. LR Parsing. LR Parsing. No Stopping The Parsing! Bottom-Up Parsing. LR(1) Parsing Tables #2
LR Parsing Bottom-Up Parsing #1 Outline No Stopping The Parsing! Bottom-Up Parsing LR Parsing Shift and Reduce LR(1) Parsing Algorithm LR(1) Parsing Tables #2 In One Slide An LR(1) parser reads tokens
More informationEECS 473 Final Exam. Fall 2017 NOTES: I have neither given nor received aid on this exam nor observed anyone else doing so. Name: unique name:
EECS 473 Final Exam Fall 2017 Name: unique name: Sign the honor code: I have neither given nor received aid on this exam nor observed anyone else doing so. NOTES: 1. Closed book and Closed notes 2. Do
More informationGreedy Flipping of Pancakes and Burnt Pancakes
Greedy Flipping of Pancakes and Burnt Pancakes Joe Sawada a, Aaron Williams b a School of Computer Science, University of Guelph, Canada. Research supported by NSERC. b Department of Mathematics and Statistics,
More informationNOVOHALL Rotary Sensor non-contacting. Series RSC2800 digital SSI, SPI, Incremental
NOVOHALL Rotary Sensor non-contacting Series RSC2800 digital SSI, SPI, Incremental The RSC 2800 sensor utilizes a contactless magnetic measurement technology to determine the measured angle. Unlike conventional
More informationAbsolute Encoders - Singleturn
The Sendix 5853 and Sendix 5873 singleturn encoders with SSI or BiSS interface and optical sensor technology can achieve a resolution of max. 7 bits. These encoders are also available with an optional
More informationPRIMES STEP Plays Games
PRIMES STEP Plays Games arxiv:1707.07201v1 [math.co] 22 Jul 2017 Pratik Alladi Neel Bhalla Tanya Khovanova Nathan Sheffield Eddie Song William Sun Andrew The Alan Wang Naor Wiesel Kevin Zhang Kevin Zhao
More informationDetecting and Correcting Bit Errors. COS 463: Wireless Networks Lecture 8 Kyle Jamieson
Detecting and Correcting Bit Errors COS 463: Wireless Networks Lecture 8 Kyle Jamieson Bit errors on links Links in a network go through hostile environments Both wired, and wireless: Scattering Diffraction
More informationOlympiad Combinatorics. Pranav A. Sriram
Olympiad Combinatorics Pranav A. Sriram August 2014 Chapter 2: Algorithms - Part II 1 Copyright notices All USAMO and USA Team Selection Test problems in this chapter are copyrighted by the Mathematical
More informationTechnical data. General specifications. Measurement range min max. 360
Model Number Features Very small housing High climatic resistance 12 Bit singleturn Analog output Surge and reverse polarity protection Description This absolute rotary encoder with internal magnetic sampling
More informationSolving the 4 x 4 Cube
Solving the 4 x 4 Cube How to Reference and Talk About the Cube: Like the 3 x 3 cube, we will refer to three main types of pieces centers (4 per side), edges (2 per edge) and corners. The main approach
More informationLOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM. 2012/ODD/III/ECE/DE/LM Page No. 1
LOGIC DIAGRAM: HALF ADDER TRUTH TABLE: A B CARRY SUM K-Map for SUM: K-Map for CARRY: SUM = A B + AB CARRY = AB 22/ODD/III/ECE/DE/LM Page No. EXPT NO: DATE : DESIGN OF ADDER AND SUBTRACTOR AIM: To design
More informationTechnical data. General specifications. Linearity error ± 0.1 Functional safety related parameters MTTF d 700 a at 40 C Mission Time (T M ) L 10
Model Number SYNCHRON SERIELLES INTERFACE Features Recessed hollow shaft SSI interface Up to Bit multiturn Free of wear magnetic sampling High resolution and accuracy Additionally push buttons for preset
More informationGenerating trees and pattern avoidance in alternating permutations
Generating trees and pattern avoidance in alternating permutations Joel Brewster Lewis Massachusetts Institute of Technology jblewis@math.mit.edu Submitted: Aug 6, 2011; Accepted: Jan 10, 2012; Published:
More informationCircular Nim Games. S. Heubach 1 M. Dufour 2. May 7, 2010 Math Colloquium, Cal Poly San Luis Obispo
Circular Nim Games S. Heubach 1 M. Dufour 2 1 Dept. of Mathematics, California State University Los Angeles 2 Dept. of Mathematics, University of Quebeq, Montreal May 7, 2010 Math Colloquium, Cal Poly
More information