FRACTALS LINDENMAYER SYSTEMS. November 22, 2013 Rolf Pfeifer Rudolf M. Füchslin
|
|
- Jessica Maxwell
- 6 years ago
- Views:
Transcription
1 FRACTALS LINDENMAYER SYSTEMS November 22, 2013 Rolf Pfeifer Rudolf M. Füchslin
2 RECAP
3 HIDDEN MARKOV MODELS
4 What Letter Is Written Here?
5 What Letter Is Written Here?
6 What Letter Is Written Here?
7 The Idea Behind Hidden Markov Models First letter: Maybe a, maybe q Second letter: Maybe r or v or u Take the most probable combination as a guess!
8 Hidden Markov Models Sometimes, you don t see the states, but only a mapping of the states. A main task is then to derive, from the visible mapped sequence of states, the actual underlying sequence of hidden states.
9 HMM: A Fundamental Question What you see are the observables. But what are the actual states behind the observables? What is the most probable sequence of states leading to a given sequence of observations?
10 The Viterbi-Algorithm We are looking for indices M 1,M 2,...M T, such that P(q M1,...q MT ) = P max,t is maximal. 1. Initialization 2. Recursion (1 t T-1) () i 1 ( i) 0 1 b i i k 1 ( j) max( ( i) a ) b t 1 t i j j k i t ( j) i : ( i) a max. t 1 t i j 1 3. Termination 4. Backtracking P max, T max( ( i)) q q : ( i) max. max, T i T M T t t 1 Mt 1 ( )
11 Efficiency of the Viterbi Algorithm The brute force approach takes O(TN T ) steps. This is even for N = 2 and T = 100 difficult to do. The Viterbi algorithm in contrast takes only O(TN 2 ) which is easy to do with todays computational means.
12 Applications of HMM Analysis of handwriting. Speech analysis. Construction of models for prediction. Only few processes are really Markov processes (neither writing nor speech is), but often, models based on Markov processes are good approximations.
13 END RECAP
14 FRACTALS
15 Natural Geometry Geometry in text books Geometry in nature
16 Fractals: Informal Definition Termed coined by Benoit Mandelbrot Geometry without smoothness Structure on all scales (detail persists when zoomed arbitrarily) Geometrical objects generally with non-integer dimension Self-similarity (contains infinite copies of itself)
17 Fractals in the Human Body Kidney Lung Cortical surface (?)
18 The Length of Borders Lewis Fry Richardson: Probability of war between two adjacent countries proportional to length of border? Checking the theory required gathering data about border lengths. Surprising finding: There are strongly varying numbers in the literature.
19 The Border of Great Britain
20 The Border of Great Britain The closer you look, the longer the border. And the growth doesn t stop!
21 A Slightly Different View on Dimension
22 One-Dimensional Objects 1 N c1 : Diameter of disk N : Number of disks c : Constant 1
23 Two-dimensional Objects N? : Diameter of disk N c 2 : Number of disks : Constant
24 Two-dimensional Objects c2 N : Diameter of disk N c : Number of disks : Constant
25 Definition of the Fractal Dimension D 1 N c : Diameter of disk N : Number of disks c : Constant D: Hausdorff Dimension The number of disks necessary for covering a structure grows with shrinking λ. D log( N ( )) log( c) log( N ( )) log( N( )) lim lim lim log( ) log( ) log( )
26 Example: The Sierpinski Triangle Construction of the Sierpinski-triangle A Sierpinski triangle contains a whole copy of itself in its parts.
27 Example: The Sierpinski Triangle Construction of the Sierpinski-triangle D log( N( )) lim 0 log( )
28 Example: The Sierpinski Triangle Hausdorff Dimension: D n log(3 ) log(3) lim n 1 log( ) log(2) n 2 Area of Sierpinski triangle A N lim n 1 n n Boundary length of ST: n 1 L 3KN lim3k3 n 2 n 2
29 Example: Cantor Dust Take out the middle third! D log( N ( )) lim 0 log( )
30 Example: Cantor Dust Take out the middle third! L D lim n log(2 ) log(2) 1 log(3) log( ) 3 n n 1 lim(no elements = 2 ) (length element = ) n n 3 n
31 Example: The Mandelbrot Set
32 Example: The Mandelbrot Set 2 n 1 n z z c z 0, c C n 1 n n x x y a y x y b 2 n 1 n n z x iy, c a ib
33 The Mandelbrot Set
34 Three-Dimensional L-Systems
35 Compressibility The Mandelbrot looks complex. The algorithm describing the Mandelbrot-set is very short. Procedures generating fractal structures give a very compressed form of storing complex-looking shapes. Directly storing these pictures is actually impossible. 2 n 1 n z z c z 0, c C 0
36 Self-Similarity and Scale-Invariance When each piece of a shape is geometrically similar to the whole, both the shape and the cascade that generate it are called self-similar. (B. Mandelbrot) Contains infinite copies of itself Scaling/Scale = The value measured for a property does not depend on the resolution at which it is measured Two types of invariance: - Geometrical - Statistical
37 Fractals in Reality Strict self-similarity is mostly found in mathematical examples. Statistical interpretation of self-similarity: If a part of system can be zoomed up, and this part shows the same statistical properties as the whole system, one speaks of self-similarity. In reverse (and more important), if coarse-graining does not change the statistical properties of a system, one speaks of self-similarity.
38 Non-Fractal Random distribution of spheres with uniform radius.
39 Fractal Random distribution of spheres with varying random radius (power law distribution).
40 Self-Similarity and Coarse-Graining or Coarse graining = formation of blocks with averaged properties
41 Self-Similarity in Reality ρ= 0.55 ρ= 0.5 SELF SIMILARITY ρ= 0.6 ρ= 0.7 Physically important in the description of phase transition.
42 Fractal Dimension of Time Series Univ. Zürich: G. Wieser, P. F. Meier, Y. Shen, HR. Moser. R. Füchslin EEG EEG during epileptic seizure Some statistical measures such as the fractal correlation dimension D2 decrease shortly before and during an epiliptic seizure. D2 can be used as a diagnostic measure.
43 Random Numbers Question: Is a random number self similar?
44 LINDENMAYER-SYSTEMS: STUDYING DEVELOPMENT USING FORMAL LANGUAGES
45 A Real Puzzle Nature is full of well-structured objects. These objects are not assembled using global control and a blue-print, but emerge from local behavior. External control Self-organization
46 Self-Assembly is Powerful, but. Even if self-assembly processes may lead to non-trivial and finite structures with global shape and mesoscopic pattern induced by microscopic interactions, it is not the way how nature works. Paul. W. Rothemund
47 Developmental Representation vs. Blueprint All higher living organism develop from a fertilized egg (a zygote) into their adult form. This process is, at least to a large degree, controlled by their respective genome. Is it that the genome contains a sort of "blueprint" of the organism?
48 Developmental Representation vs. Blueprint All higher living organism develop from a fertilized egg (a zygote) into their adult form. This process is, at least to a large degree, controlled by their respective genome. It is NOT TRUE that the genome contains a sort of "blueprint" of the organism. Rather, the genome contains instructions which lead to molecules that in the interaction with the environment lead to organisms.
49 Developmental Representation vs. Blueprint Developmental process is influence by: An initial seed. The (probably time-dependent) interactions of the building blocks of a body The environment and the physical and chemical laws ruling this environment. Developmental representations are iterative in the sense that they tell you how to proceed if there is already something there.
50 Developmental Representation vs. Blueprint The genome does not contain all the information it needs to build your body. Development requires embodiment! Instructions for construction = Developmental representation + Laws of the environment
51 Formal Languages Are Not Enough How to describe development by a formal system? Problem: The languages we know do not necessarily lead to globally structured outcomes with repetitive patterns. Reason: External decision of location where a replacement rule is applied.
52 On Growth and Form: L-Systems The patterns observed in multicellular algae are the result of developmental processes Mathematical formalism introduced in 1968 by Aristid Lindenmayer. Productions are rewriting rules which state how new symbols (or cells) can be produced from old symbols (or cells)
53 L-Systems / Rewriting Systems Lindenmayer systems belong to the general class of parallel grammars or parallel rewriting systems. Difference to grammars as we know them: In a parallel rewriting system, rules are applied to all possible instances simultaneously. L-systems are subsets of languages. Most practical L-systems are related to context-free languages. Context-free grammars suit the emulation of maturation and division. Context-free language A A V, ( V )
54 The Cantor Set as an L-System Non-Terminals (variables): AB, Terminals (constants) : none Start : A Rules : A B ABA BBB
55 The Cantor Set as an L-System Non-Terminals (variables): AB, Terminals (constants) : none Start : A Rules : A B ABA BBB 1. A 2. ABA 3. ABABBBABA 4. ABABBBABABBBBBBBBBABABBBABA 5....
56 Anabaena Catenula
57 A Bio-Inspired L-System Anabeana catenula: Two types of polar cells, photosynthesis and nitorgen fixation Variables : A, A, B, B Constants : none Start : A Rules : A AB A BA B A B A
58 Visualization: Turtle Graphics + - F Move forward by distance F Rotate by angle δ Rotate by angle -δ Bracket notation: [ : Store position and direction ] : Go back to position and direction of matching [
59 Visualization; Turtle Graphics Simple system: Axiom (Start): F Rule: F F[-F][+F] Angle: 30
60 More Plants
61 Professional Visualization
62 Generalizations?
63 Generalizations Stochasticity Contex sensitive rules Delay times Reaction-diffusion systems
64 Homology of Structure
65 Potential Advantages of Development Compact description Supports symmetry Supports modularity Supports reuse of mechanisms in different contexts. Supports scalability Decentralized control by self-orgnaization and parallelism. Turns out to be robust Enables adaptivity Change of structure can be achieved by small changes. Change of structure by change of timing (heterochrony). Evolvability
Chapter 8. Fractals. 8.1 Introduction
Chapter 8 Fractals 8.1 Introduction Nested patterns with some degree of self-similarity are not only found in decorative arts, but in many natural patterns as well (see Figure 8.1). In mathematics, nested
More informationCMSC 425: Lecture 11 Procedural Generation: Fractals and L-Systems
CMSC 425: Lecture 11 Procedural Generation: ractals and L-Systems Reading: The material on fractals comes from classic computer-graphics books. The material on L-Systems comes from Chapter 1 of The Algorithmic
More informationbiologically-inspired computing lecture 6 Informatics luis rocha 2015 INDIANA UNIVERSITY biologically Inspired computing
lecture 6 -inspired Sections I485/H400 course outlook Assignments: 35% Students will complete 4/5 assignments based on algorithms presented in class Lab meets in I1 (West) 109 on Lab Wednesdays Lab 0 :
More informationDepartment of Computer Sciences Graphics Fall 2005 (Lecture 8) Fractals
Fractals Consider a complex number z = a + bi as a point (a, b) or vector in the Real Euclidean plane [1, i] with modulus z the length of the vector and equal to a 2 + b 2. Complex arithmetic rules: (a
More informationDYNAMICAL SYSTEMS
0.42 DYNAMICAL SYSTEMS Week Lecture Notes. What is a dynamical system? Probably the best way to begin this discussion is with arguably a most general and yet least helpful statement: Definition. A dynamical
More informationFractals. Justin Stevens. Lecture 12. Justin Stevens Fractals (Lecture 12) 1 / 14
Fractals Lecture 12 Justin Stevens Justin Stevens Fractals (Lecture 12) 1 / 14 Outline 1 Fractals Koch Snowflake Hausdorff Dimension Sierpinski Triangle Mandelbrot Set Justin Stevens Fractals (Lecture
More informationFractals and Dimension
Chapter 7 Fractals and Dimension Dimension We say that a smooth curve has dimension 1, a plane has dimension 2 and so on, but it is not so obvious at first what dimension we should ascribe to the Sierpinski
More informationINTRODUCTION TO FRACTAL GEOMETRY
Every mathematical theory, however abstract, is inspired by some idea coming in our mind from the observation of nature, and has some application to our world, even if very unexpected ones and lying centuries
More informationComplex Analysis for F2
Institutionen för Matematik KTH Stanislav Smirnov stas@math.kth.se Complex Analysis for F2 Projects September 2002 Suggested projects ask you to prove a few important and difficult theorems in complex
More informationHidden Markov Models, I. Examples. Steven R. Dunbar. Toy Models. Standard Mathematical Models. Realistic Hidden Markov Models.
, I. Toy Markov, I. February 17, 2017 1 / 39 Outline, I. Toy Markov 1 Toy 2 3 Markov 2 / 39 , I. Toy Markov A good stack of examples, as large as possible, is indispensable for a thorough understanding
More informationGrade 11/12 Math Circles Fall Nov. 12 Recurrences, Part 3
1 Faculty of Mathematics Waterloo, Ontario Centre for Education in Mathematics and Computing Grade 11/12 Math Circles Fall 2014 - Nov. 12 Recurrences, Part 3 Definition of an L-system An L-system or Lindenmayer
More informationCMSC 425: Lecture 12 Procedural Generation: Fractals
: Lecture 12 Procedural Generation: Fractals Reading: This material comes from classic computer-graphics books. Procedural Generation: One of the important issues in game development is how to generate
More informationHausdorff Measure. Jimmy Briggs and Tim Tyree. December 3, 2016
Hausdorff Measure Jimmy Briggs and Tim Tyree December 3, 2016 1 1 Introduction In this report, we explore the the measurement of arbitrary subsets of the metric space (X, ρ), a topological space X along
More informationCISC 889 Bioinformatics (Spring 2004) Hidden Markov Models (II)
CISC 889 Bioinformatics (Spring 24) Hidden Markov Models (II) a. Likelihood: forward algorithm b. Decoding: Viterbi algorithm c. Model building: Baum-Welch algorithm Viterbi training Hidden Markov models
More informationFractal Geometry Time Escape Algorithms and Fractal Dimension
NAVY Research Group Department of Computer Science Faculty of Electrical Engineering and Computer Science VŠB- TUO 17. listopadu 15 708 33 Ostrava- Poruba Czech Republic Basics of Modern Computer Science
More informationGrade 8 Chapter 7: Rational and Irrational Numbers
Grade 8 Chapter 7: Rational and Irrational Numbers In this chapter we first review the real line model for numbers, as discussed in Chapter 2 of seventh grade, by recalling how the integers and then the
More informationMarkov Chains and Hidden Markov Models. = stochastic, generative models
Markov Chains and Hidden Markov Models = stochastic, generative models (Drawing heavily from Durbin et al., Biological Sequence Analysis) BCH339N Systems Biology / Bioinformatics Spring 2016 Edward Marcotte,
More informationAutomata Theory (2A) Young Won Lim 5/31/18
Automata Theory (2A) Copyright (c) 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationFractals list of fractals - Hausdorff dimension
3//00 from Wiipedia: Fractals list of fractals - Hausdorff dimension Sierpinsi Triangle -.585 3D Cantor Dust -.898 Lorenz attractor -.06 Coastline of Great Britain -.5 Mandelbrot Set Boundary - - Regular
More informationFractals: How long is a piece of string?
Parabola Volume 33, Issue 2 1997) Fractals: How long is a piece of string? Bruce Henry and Clio Cresswell And though the holes were rather small, they had to count them all. Now they know how many holes
More informationCMSC 723: Computational Linguistics I Session #5 Hidden Markov Models. The ischool University of Maryland. Wednesday, September 30, 2009
CMSC 723: Computational Linguistics I Session #5 Hidden Markov Models Jimmy Lin The ischool University of Maryland Wednesday, September 30, 2009 Today s Agenda The great leap forward in NLP Hidden Markov
More information2. Prime and Maximal Ideals
18 Andreas Gathmann 2. Prime and Maximal Ideals There are two special kinds of ideals that are of particular importance, both algebraically and geometrically: the so-called prime and maximal ideals. Let
More informationL23: hidden Markov models
L23: hidden Markov models Discrete Markov processes Hidden Markov models Forward and Backward procedures The Viterbi algorithm This lecture is based on [Rabiner and Juang, 1993] Introduction to Speech
More informationStatistical NLP: Hidden Markov Models. Updated 12/15
Statistical NLP: Hidden Markov Models Updated 12/15 Markov Models Markov models are statistical tools that are useful for NLP because they can be used for part-of-speech-tagging applications Their first
More informationTSP Water Project Report Snowflakes and Fractals
TSP Water Project Report Snowflakes and Fractals Group Leader: Group Members: David Curtin Thomas Clement Julian Gibbons Jeff Gordon Enoch Lau Ozan Onay John Sun Due Date: Thursday, 20 May 2004 Word Count:
More informationmeans is a subset of. So we say A B for sets A and B if x A we have x B holds. BY CONTRAST, a S means that a is a member of S.
1 Notation For those unfamiliar, we have := means equal by definition, N := {0, 1,... } or {1, 2,... } depending on context. (i.e. N is the set or collection of counting numbers.) In addition, means for
More informationRepeat tentative ideas from earlier - expand to better understand the term fractal.
Fractals Clouds are not spheres, mountains are not cones, coastlines are not circles, and bark is not smooth, nor does lightning travel in a straight line. (Mandelbrot, 1983) Repeat tentative ideas from
More informationJulia Sets and the Mandelbrot Set
Julia Sets and the Mandelbrot Set Julia sets are certain fractal sets in the complex plane that arise from the dynamics of complex polynomials. These notes give a brief introduction to Julia sets and explore
More informationA LITTLE REAL ANALYSIS AND TOPOLOGY
A LITTLE REAL ANALYSIS AND TOPOLOGY 1. NOTATION Before we begin some notational definitions are useful. (1) Z = {, 3, 2, 1, 0, 1, 2, 3, }is the set of integers. (2) Q = { a b : aεz, bεz {0}} is the set
More informationO 3 O 4 O 5. q 3. q 4. Transition
Hidden Markov Models Hidden Markov models (HMM) were developed in the early part of the 1970 s and at that time mostly applied in the area of computerized speech recognition. They are first described in
More informationIf one wants to study iterations of functions or mappings,
The Mandelbrot Set And Its Julia Sets If one wants to study iterations of functions or mappings, f n = f f, as n becomes arbitrarily large then Julia sets are an important tool. They show up as the boundaries
More informationFoundations of Natural Language Processing Lecture 6 Spelling correction, edit distance, and EM
Foundations of Natural Language Processing Lecture 6 Spelling correction, edit distance, and EM Alex Lascarides (Slides from Alex Lascarides and Sharon Goldwater) 2 February 2019 Alex Lascarides FNLP Lecture
More informationIntroduction to Real Analysis Alternative Chapter 1
Christopher Heil Introduction to Real Analysis Alternative Chapter 1 A Primer on Norms and Banach Spaces Last Updated: March 10, 2018 c 2018 by Christopher Heil Chapter 1 A Primer on Norms and Banach Spaces
More informationMATH Max-min Theory Fall 2016
MATH 20550 Max-min Theory Fall 2016 1. Definitions and main theorems Max-min theory starts with a function f of a vector variable x and a subset D of the domain of f. So far when we have worked with functions
More informationPHYSICS 3266 SPRING 2016
PHYSICS 3266 SPRIG 2016 Each problem is worth 5 points as discussed in the syllabus. For full credit you must include in your solution a copy of your program (well commented and listed any students that
More informationProperties of Arithmetic
Excerpt from "Prealgebra" 205 AoPS Inc. 4 6 7 4 5 8 22 23 5 7 0 Arithmetic is being able to count up to twenty without taking o your shoes. Mickey Mouse CHAPTER Properties of Arithmetic. Why Start with
More informationThe Number System (NS) 8.NS.1 Standards for Mathematical Practice (MP): Connections
Domain: The Number System (NS) Cluster: Know that there are numbers that are not rational, and approximate them by rational numbers. Standard: 8.NS.1. Know that numbers that are not rational are called
More informationProcesses in Space. Luca Cardelli Microsoft Research. with Philippa Gardner Imperial College London
Processes in Space Luca Cardelli Microsoft Research with Philippa Gardner Imperial College London 2010-07-02 CiE Ponta Delgada http://lucacardelli.name Introduction Luca Cardelli 2010-07-02 2 From Topology
More informationWhat means dimension?
What means dimension? Christiane ROUSSEAU Universite de Montre al November 2011 How do we measure the size of a geometric object? For subsets of the plane we often use perimeter, length, area, diameter,
More informationStatistical Sequence Recognition and Training: An Introduction to HMMs
Statistical Sequence Recognition and Training: An Introduction to HMMs EECS 225D Nikki Mirghafori nikki@icsi.berkeley.edu March 7, 2005 Credit: many of the HMM slides have been borrowed and adapted, with
More informationPatterns in Nature 8 Fractals. Stephan Matthiesen
Patterns in Nature 8 Fractals Stephan Matthiesen How long is the Coast of Britain? CIA Factbook (2005): 12,429 km http://en.wikipedia.org/wiki/lewis_fry_richardson How long is the Coast of Britain? 12*200
More informationUncountable computable model theory
Uncountable computable model theory Noam Greenberg Victoria University of Wellington 30 th June 2013 Mathematical structures Model theory provides an abstract formalisation of the notion of a mathematical
More informationProduction-rule complexity of recursive structures
Production-rule complexity of recursive structures Konstantin L Kouptsov New York University klk206@panix.com Complex recursive structures, such as fractals, are often described by sets of production rules,
More informationLIMITS AND DERIVATIVES
2 LIMITS AND DERIVATIVES LIMITS AND DERIVATIVES 2.2 The Limit of a Function In this section, we will learn: About limits in general and about numerical and graphical methods for computing them. THE LIMIT
More informationThe Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018)
The Two Faces of Infinity Dr. Bob Gardner Great Ideas in Science (BIOL 3018) From the webpage of Timithy Kohl, Boston University INTRODUCTION Note. We will consider infinity from two different perspectives:
More informationChapter 6 Animation of plant development
Chapter 6 Animation of plant development The sequences of images used in Chapters 3 and 5 to illustrate the development of inflorescences and compound leaves suggest the possibility of using computer animation
More informationCIS 2033 Lecture 5, Fall
CIS 2033 Lecture 5, Fall 2016 1 Instructor: David Dobor September 13, 2016 1 Supplemental reading from Dekking s textbook: Chapter2, 3. We mentioned at the beginning of this class that calculus was a prerequisite
More informationComputational Genomics and Molecular Biology, Fall
Computational Genomics and Molecular Biology, Fall 2011 1 HMM Lecture Notes Dannie Durand and Rose Hoberman October 11th 1 Hidden Markov Models In the last few lectures, we have focussed on three problems
More informationNatural Language Processing Prof. Pushpak Bhattacharyya Department of Computer Science & Engineering, Indian Institute of Technology, Bombay
Natural Language Processing Prof. Pushpak Bhattacharyya Department of Computer Science & Engineering, Indian Institute of Technology, Bombay Lecture - 21 HMM, Forward and Backward Algorithms, Baum Welch
More informationAN INTRODUCTION TO FRACTALS AND COMPLEXITY
AN INTRODUCTION TO FRACTALS AND COMPLEXITY Carlos E. Puente Department of Land, Air and Water Resources University of California, Davis http://puente.lawr.ucdavis.edu 2 Outline Recalls the different kinds
More informationError Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore
(Refer Slide Time: 00:15) Error Correcting Codes Prof. Dr. P. Vijay Kumar Department of Electrical Communication Engineering Indian Institute of Science, Bangalore Lecture No. # 03 Mathematical Preliminaries:
More informationPrecalculus idea: A picture is worth 1,000 words
Six Pillars of Calculus by Lorenzo Sadun Calculus is generally viewed as a difficult subject, with hundreds of formulas to memorize and many applications to the real world. However, almost all of calculus
More informationMachine Learning & Data Mining Caltech CS/CNS/EE 155 Hidden Markov Models Last Updated: Feb 7th, 2017
1 Introduction Let x = (x 1,..., x M ) denote a sequence (e.g. a sequence of words), and let y = (y 1,..., y M ) denote a corresponding hidden sequence that we believe explains or influences x somehow
More informationZoology of Fatou sets
Math 207 - Spring 17 - François Monard 1 Lecture 20 - Introduction to complex dynamics - 3/3: Mandelbrot and friends Outline: Recall critical points and behavior of functions nearby. Motivate the proof
More informationFractals list of fractals by Hausdoff dimension
from Wiipedia: Fractals list of fractals by Hausdoff dimension Sierpinsi Triangle D Cantor Dust Lorenz attractor Coastline of Great Britain Mandelbrot Set What maes a fractal? I m using references: Fractal
More informationCS532, Winter 2010 Hidden Markov Models
CS532, Winter 2010 Hidden Markov Models Dr. Alan Fern, afern@eecs.oregonstate.edu March 8, 2010 1 Hidden Markov Models The world is dynamic and evolves over time. An intelligent agent in such a world needs
More informationNumber Systems III MA1S1. Tristan McLoughlin. December 4, 2013
Number Systems III MA1S1 Tristan McLoughlin December 4, 2013 http://en.wikipedia.org/wiki/binary numeral system http://accu.org/index.php/articles/1558 http://www.binaryconvert.com http://en.wikipedia.org/wiki/ascii
More informationSection 3.2 : Sequences
Section 3.2 : Sequences Note: Chapter 11 of Stewart s Calculus is a good reference for this chapter of our lecture notes. Definition 52 A sequence is an infinite ordered list a 1, a 2, a 3,... The items
More informationContents. Counting Methods and Induction
Contents Counting Methods and Induction Lesson 1 Counting Strategies Investigations 1 Careful Counting... 555 Order and Repetition I... 56 3 Order and Repetition II... 569 On Your Own... 573 Lesson Counting
More informationWhat is proof? Lesson 1
What is proof? Lesson The topic for this Math Explorer Club is mathematical proof. In this post we will go over what was covered in the first session. The word proof is a normal English word that you might
More informationHuman-Oriented Robotics. Temporal Reasoning. Kai Arras Social Robotics Lab, University of Freiburg
Temporal Reasoning Kai Arras, University of Freiburg 1 Temporal Reasoning Contents Introduction Temporal Reasoning Hidden Markov Models Linear Dynamical Systems (LDS) Kalman Filter 2 Temporal Reasoning
More informationPart II. Geometry and Groups. Year
Part II Year 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2014 Paper 4, Section I 3F 49 Define the limit set Λ(G) of a Kleinian group G. Assuming that G has no finite orbit in H 3 S 2, and that Λ(G),
More informationP Systems with Symport/Antiport of Rules
P Systems with Symport/Antiport of Rules Matteo CAVALIERE Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tárraco 1, 43005 Tarragona, Spain E-mail: matteo.cavaliere@estudiants.urv.es
More informationQuantum Theory and Group Representations
Quantum Theory and Group Representations Peter Woit Columbia University LaGuardia Community College, November 1, 2017 Queensborough Community College, November 15, 2017 Peter Woit (Columbia University)
More informationData-Intensive Computing with MapReduce
Data-Intensive Computing with MapReduce Session 8: Sequence Labeling Jimmy Lin University of Maryland Thursday, March 14, 2013 This work is licensed under a Creative Commons Attribution-Noncommercial-Share
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationComputational Models: Class 3
Computational Models: Class 3 Benny Chor School of Computer Science Tel Aviv University November 2, 2015 Based on slides by Maurice Herlihy, Brown University, and modifications by Iftach Haitner and Yishay
More informationA Few Examples. A Few Examples
Section 3.2 : Sequences Note: Chapter of Stewart s Calculus is a good reference for this chapter of our lecture notes. Definition 52 A sequence is an infinite ordered list A Few Examples (( ) n + ) n=
More informationAN INTRODUCTION TO TOPIC MODELS
AN INTRODUCTION TO TOPIC MODELS Michael Paul December 4, 2013 600.465 Natural Language Processing Johns Hopkins University Prof. Jason Eisner Making sense of text Suppose you want to learn something about
More informationAnalysis-3 lecture schemes
Analysis-3 lecture schemes (with Homeworks) 1 Csörgő István November, 2015 1 A jegyzet az ELTE Informatikai Kar 2015. évi Jegyzetpályázatának támogatásával készült Contents 1. Lesson 1 4 1.1. The Space
More informationMIDDLE SCHOOL BIOLOGY LABORATORY 1ST SEMESTER NAME: DATE: Activity: for each text we will highlight the most important information.
NAME: DATE: TEACHER: Albert Hernandez. GRADE: 2 nd I. Read text carefully and answer the questions bellow. Activity: for each text we will highlight the most important information. The Goal of Science
More informationMachine Learning for OR & FE
Machine Learning for OR & FE Hidden Markov Models Martin Haugh Department of Industrial Engineering and Operations Research Columbia University Email: martin.b.haugh@gmail.com Additional References: David
More informationHidden Markov Models
Hidden Markov Models Slides mostly from Mitch Marcus and Eric Fosler (with lots of modifications). Have you seen HMMs? Have you seen Kalman filters? Have you seen dynamic programming? HMMs are dynamic
More informationDesign and Implementation of Speech Recognition Systems
Design and Implementation of Speech Recognition Systems Spring 2013 Class 7: Templates to HMMs 13 Feb 2013 1 Recap Thus far, we have looked at dynamic programming for string matching, And derived DTW from
More informationTopological properties of Z p and Q p and Euclidean models
Topological properties of Z p and Q p and Euclidean models Samuel Trautwein, Esther Röder, Giorgio Barozzi November 3, 20 Topology of Q p vs Topology of R Both R and Q p are normed fields and complete
More informationBjorn Poonen. Cantrell Lecture 3 University of Georgia March 28, 2008
University of California at Berkeley Cantrell Lecture 3 University of Georgia March 28, 2008 Word Isomorphism Can you tile the entire plane with copies of the following? Rules: Tiles may not be rotated
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More information11. Automata and languages, cellular automata, grammars, L-systems
11. Automata and languages, cellular automata, grammars, L-systems 11.1 Automata and languages Automaton (pl. automata): in computer science, a simple model of a machine or of other systems. ( a simplification
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More informationStatistical Methods for NLP
Statistical Methods for NLP Information Extraction, Hidden Markov Models Sameer Maskey Week 5, Oct 3, 2012 *many slides provided by Bhuvana Ramabhadran, Stanley Chen, Michael Picheny Speech Recognition
More informationAn Introduction to Hidden
An Introduction to Hidden Markov Models L. R..Rabiner B. H. Juang The basic theory of Markov chains hasbeen known to mathematicians and engineers for close to 80 years, but it is only in the past decade
More informationWhat is model theory?
What is Model Theory? Michael Lieberman Kalamazoo College Math Department Colloquium October 16, 2013 Model theory is an area of mathematical logic that seeks to use the tools of logic to solve concrete
More informationP(t w) = arg maxp(t, w) (5.1) P(t,w) = P(t)P(w t). (5.2) The first term, P(t), can be described using a language model, for example, a bigram model:
Chapter 5 Text Input 5.1 Problem In the last two chapters we looked at language models, and in your first homework you are building language models for English and Chinese to enable the computer to guess
More informationAn Introduction to Bioinformatics Algorithms Hidden Markov Models
Hidden Markov Models Outline 1. CG-Islands 2. The Fair Bet Casino 3. Hidden Markov Model 4. Decoding Algorithm 5. Forward-Backward Algorithm 6. Profile HMMs 7. HMM Parameter Estimation 8. Viterbi Training
More informationReal Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras. Lecture - 13 Conditional Convergence
Real Analysis Prof. S.H. Kulkarni Department of Mathematics Indian Institute of Technology, Madras Lecture - 13 Conditional Convergence Now, there are a few things that are remaining in the discussion
More informationHidden Markov Models (HMMs) November 14, 2017
Hidden Markov Models (HMMs) November 14, 2017 inferring a hidden truth 1) You hear a static-filled radio transmission. how can you determine what did the sender intended to say? 2) You know that genes
More informationNumbers, proof and all that jazz.
CHAPTER 1 Numbers, proof and all that jazz. There is a fundamental difference between mathematics and other sciences. In most sciences, one does experiments to determine laws. A law will remain a law,
More informationKönig s Lemma and Kleene Tree
König s Lemma and Kleene Tree Andrej Bauer May 3, 2006 Abstract I present a basic result about Cantor space in the context of computability theory: the computable Cantor space is computably non-compact.
More informationHidden Markov Models. x 1 x 2 x 3 x K
Hidden Markov Models 1 1 1 1 2 2 2 2 K K K K x 1 x 2 x 3 x K Viterbi, Forward, Backward VITERBI FORWARD BACKWARD Initialization: V 0 (0) = 1 V k (0) = 0, for all k > 0 Initialization: f 0 (0) = 1 f k (0)
More informationChapter 2 Metric Spaces
Chapter 2 Metric Spaces The purpose of this chapter is to present a summary of some basic properties of metric and topological spaces that play an important role in the main body of the book. 2.1 Metrics
More informationHidden Markov Modelling
Hidden Markov Modelling Introduction Problem formulation Forward-Backward algorithm Viterbi search Baum-Welch parameter estimation Other considerations Multiple observation sequences Phone-based models
More informationSpanning, linear dependence, dimension
Spanning, linear dependence, dimension In the crudest possible measure of these things, the real line R and the plane R have the same size (and so does 3-space, R 3 ) That is, there is a function between
More informationReinforcement Learning. Introduction
Reinforcement Learning Introduction Reinforcement Learning Agent interacts and learns from a stochastic environment Science of sequential decision making Many faces of reinforcement learning Optimal control
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationCIS 375 Intro to Discrete Mathematics Exam 1 (Section M004: Blue) 6 October Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 1 (Section M004: Blue) 6 October 2016 Question Points Possible Points Received 1 6 2 10 3 24 4 15 5 15 6 15 7 15 Total 100 Instructions: 1. This exam is
More informationAN INTRODUCTION TO FRACTALS AND COMPLEXITY
AN INTRODUCTION TO FRACTALS AND COMPLEXITY Carlos E. Puente Department of Land, Air and Water Resources University of California, Davis http://puente.lawr.ucdavis.edu 2 Outline Recalls the different kinds
More information2 - Strings and Binomial Coefficients
November 14, 2017 2 - Strings and Binomial Coefficients William T. Trotter trotter@math.gatech.edu Basic Definition Let n be a positive integer and let [n] = {1, 2,, n}. A sequence of length n such as
More informationRecursion: Introduction and Correctness
Recursion: Introduction and Correctness CSE21 Winter 2017, Day 7 (B00), Day 4-5 (A00) January 25, 2017 http://vlsicad.ucsd.edu/courses/cse21-w17 Today s Plan From last time: intersecting sorted lists and
More informationCS 350 Algorithms and Complexity
1 CS 350 Algorithms and Complexity Fall 2015 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationMotivation. Evolution has rediscovered several times multicellularity as a way to build complex living systems
Cellular Systems 1 Motivation Evolution has rediscovered several times multicellularity as a way to build complex living systems Multicellular systems are composed by many copies of a unique fundamental
More information