Math 4740: Homework 5 Solutions
|
|
- Arthur George
- 5 years ago
- Views:
Transcription
1 Math 4740: Homework 5 Solutions. (a) When f x, n i f(x i) N n (x) and y X π(y)f(y) π(x). Therefore the desired statement reduces to N n (x) lim which was shown in class. π(x) with probability, (b) Fix y X. By the definition of x, x X c x x (y) c y f(y). (c) First use (b) to expand f as a linear combination of the x, then bring the limit inside the linear combination and use (a). lim n i f(x i ) lim x X n c x x (X i ) x X x X i c x lim n x (X i ) i c x π(x) x X π(x)f(x) with probability. 2. (a) For each 0 i N, π(i)p (i, i + ) π(i + )P (i +, i). Since P (i, i+) /3 and P (i+, i) 2/3, this means π(i) 2π(i+). Therefore for any 0 j N, π(j) 2 j π(0). We compute N π(j) N 2 j π(0) (2 2 N )π(0). Therefore π(0) /(2 2 N ) 2 N /(2 N+ ) and π(j) 2 N j /(2 N+ ). (b) Again, each π(j) 2 j π(0), and π(j) 2π(0), so π(0) /2 and π(j) 2 j. For each j > 0, P (i, j) 0 except when i j ±, when we have P (j, j) /3 and P (j +, j) 2/3. Therefore, i0 π(i)p (i, j) 3 π(j ) π(j + ) 3 2 j π(j). j+2 2j+
2 When j 0 we have i0 π(i)p (i, 0) π(0)p (0, 0) + π()p (, 0) π(0). 3. Under the assumptions, the total number of spaces equals the total number of words. Therefore the total number of characters (i.e. letters plus spaces) equals the number of letters plus the number of words. So: π(space) # spaces # characters , π(f ) # letters F # characters , π(z) # letters Z # characters We compute P (F, O) P (O, R) # 2-grams FO # letters F , # 2-grams OR # letters O P (space, F ) is the probability that a word starts with F, while P (R, space) is the probability that a given letter R occurs at the end of its word. P (space, F ) P (R, space) # words starting with F # words # words ending with R # letters R , (a) We have π() f(, β) P (, β) f(γ),, γ where the sum in the denominator of π() is over all characters γ.
3 (b) To verify that πp π, we must check that π()p (, β) π(β) for all characters β. Let Z γ f(γ). Then π()p (, β) Z f(, β) Z f(, β), which will equal π(β) f(β)/z as long as f(, β) f(β). This is true because every time the character β appears, it is preceded by some other character, so if we sum over all possible preceding characters, we get the total number of occurrences of β. The alert reader may notice a minor problem with the reasoning above. We are treating the Google corpus as a long string of words, each one followed by a space. What if β 0 is the very first letter in the corpus? Then f(β 0 ) is the total number of occurrences of β 0, while f(, β 0) is the total number of times that β 0 occurs after some other character. So f(β 0 ) + f(, β 0 ), while for β β 0, f(β) f(, β) as desired. The solution is to declare that if β 0 is the first letter in the corpus, then f(space, β 0 ) should not denote the total number of occurrences of the 2-gram (space, β 0 ), but rather the total number of words beginning with β 0, which is the number of occurrences of (space, β 0 ) plus one. In fact, this modification is necessary for the definition of P given in part (a) actually to give a valid transition matrix. When we declared that P (, β) f(, β)/, we were asserting that for each character, β f(, β), in order for each row of P to sum to. Since is the total number of occurrences of and β f(, β) is the number of times that is followed by some other character, this is true except when is the very last character in the corpus, which we are assuming is a space. That is, using the unmodified definition of f(, β), we have β f(, β) for all (space), but f(space) + β f(space, β). When we increase f(space, β 0) by, this makes f(space) β f(space, β), so that P is a valid transition matrix. If you look at the computation of P (space, F ) in problem 4, you will see that we have implicitly followed this rule.
4 6. (a) There are many solutions to this problem. For example, the probability that a string of 3 consecutive characters in the Markov model equals BLL is P π (X k B, X k+ L, X k+2 L) π(b)p (B, L)P (L, L) Since the whole corpus has characters, there are strings of 3 consecutive characters, each of which has probability of being BLL. Hence the expected number of occurrences of BLL in a body of text produced by the Markov model with the same length as the Google corpus is The actual number of occurrences is zero! Note: To make the reasoning above rigorous, let (X 0,..., X N ) be the text produced by the Markov model, where N For 0 k N 3, define random variables k to be if (X k, X k+, X k+2 ) (B, L, L) and 0 otherwise. The variables k are not independent, but by linearity of expectation, [ N 3 E π [# occurrences of BLL] E π N 3 k0 k0 k ] N 3 k0 E π [ k ] P π (X k B, X k+ L, X k+2 L) (N 2)π(B)P (B, L)P (L, L). (b) The word F OR (preceded and followed by spaces) appears times in the data set. To figure out how many times it would be expected to appear from the Markov model, there are two approaches which yield essentially the same answer. First approach: In a body of text with words produced by the Markov model, how many of them would be the word F OR? The probability
5 that any individual word is F OR is P space (X F, X 2 O, X 3 R, X 4 space) P (space, F )P (F, O)P (O, R)P (R, space) , using the computations from problem 4. Therefore the expected number of words F OR is Second approach: In a body of text with characters produced by the Markov model, what is the expected number of occurrences of the 5- gram (space, F, O, R, space)? The probability that any particular string of 5 consecutive characters is (space, F, O, R, space) equals P π (X k space, X k+ F, X k+2 O, X k+3 R, X k+4 space) π(space)p (space, F )P (F, O)P (O, R)P (R, space) The number of strings of 5 consecutive characters is Therefore, the expected number of occurrences of the 5-gram is Using either approach, the word F OR appears about 52 times as often in the data set as the Markov model would predict. The answers provided by the two approaches are almost but not quite equal. The expectation given by the first approach is (# words)p (space, F )P (F, O)P (O, R)P (R, space), while the expectation given by the second approach is (# characters 4)π(space)P (space, F )P (F, O)P (O, R)P (R, space). Since π(space) # words # characters, the only difference is the minus 4 in the second expression. between the answers given by the two approaches is # characters # characters The ratio
Homework 4 Solutions, 2/2/7
Homework 4 Solutions, 2/2/7 Question Given that the number a is such that the following limit L exists, determine a and L: x 3 a L x 3 x 2 7x + 2. We notice that the denominator x 2 7x + 2 factorizes as
More informationHomework set 2 - Solutions
Homework set 2 - Solutions Math 495 Renato Feres Simulating a Markov chain in R Generating sample sequences of a finite state Markov chain. The following is a simple program for generating sample sequences
More information= P{X 0. = i} (1) If the MC has stationary transition probabilities then, = i} = P{X n+1
Properties of Markov Chains and Evaluation of Steady State Transition Matrix P ss V. Krishnan - 3/9/2 Property 1 Let X be a Markov Chain (MC) where X {X n : n, 1, }. The state space is E {i, j, k, }. The
More informationLecture 3: String Matching
COMP36111: Advanced Algorithms I Lecture 3: String Matching Ian Pratt-Hartmann Room KB2.38: email: ipratt@cs.man.ac.uk 2017 18 Outline The string matching problem The Rabin-Karp algorithm The Knuth-Morris-Pratt
More informationOn Pattern Matching With Swaps
On Pattern Matching With Swaps Fouad B. Chedid Dhofar University, Salalah, Oman Notre Dame University - Louaize, Lebanon P.O.Box: 2509, Postal Code 211 Salalah, Oman Tel: +968 23237200 Fax: +968 23237720
More informationDerivatives: definition and computation
Math 10A September 6, 2016 Announcements The breakfasts tomorrow and Thursday are full, but there are spaces at the 8AM breakfast on September 13. This is a breakfast from last semester. The gentleman
More informationDefinition (The carefully thought-out calculus version based on limits).
4.1. Continuity and Graphs Definition 4.1.1 (Intuitive idea used in algebra based on graphing). A function, f, is continuous on the interval (a, b) if the graph of y = f(x) can be drawn over the interval
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 1 Solutions to Homework 6 6.262 Discrete Stochastic Processes MIT, Spring 2011 Let {Y n ; n 1} be a sequence of rv s and assume that lim n E[ Y n ] = 0. Show that {Y n ; n 1} converges to 0 in
More informationStatistics 992 Continuous-time Markov Chains Spring 2004
Summary Continuous-time finite-state-space Markov chains are stochastic processes that are widely used to model the process of nucleotide substitution. This chapter aims to present much of the mathematics
More informationGUIDED NOTES 5.6 RATIONAL FUNCTIONS
GUIDED NOTES 5.6 RATIONAL FUNCTIONS LEARNING OBJECTIVES In this section, you will: Use arrow notation. Solve applied problems involving rational functions. Find the domains of rational functions. Identify
More informationECE 102 Engineering Computation
ECE 102 Engineering Computation Phillip Wong MATLAB Vector Operations Vector Math Strings Vector Operations A vector is a list of values placed in a single row or column. Each value is called an element.
More informationText Mining. March 3, March 3, / 49
Text Mining March 3, 2017 March 3, 2017 1 / 49 Outline Language Identification Tokenisation Part-Of-Speech (POS) tagging Hidden Markov Models - Sequential Taggers Viterbi Algorithm March 3, 2017 2 / 49
More informationStochastic optimization Markov Chain Monte Carlo
Stochastic optimization Markov Chain Monte Carlo Ethan Fetaya Weizmann Institute of Science 1 Motivation Markov chains Stationary distribution Mixing time 2 Algorithms Metropolis-Hastings Simulated Annealing
More informationThe most factored form is usually accomplished by common factoring the expression. But, any type of factoring may come into play.
MOST FACTORED FORM The most factored form is the most factored version of a rational expression. Being able to find the most factored form is an essential skill when simplifying the derivatives found using
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationReal Variables: Solutions to Homework 9
Real Variables: Solutions to Homework 9 Theodore D Drivas November, 20 xercise 0 Chapter 8, # : For complex-valued, measurable f, f = f + if 2 with f i real-valued and measurable, we have f = f + i f 2
More information7 Asymptotics for Meromorphic Functions
Lecture G jacques@ucsd.edu 7 Asymptotics for Meromorphic Functions Hadamard s Theorem gives a broad description of the exponential growth of coefficients in power series, but the notion of exponential
More informationAustin Mohr Math 704 Homework 6
Austin Mohr Math 704 Homework 6 Problem 1 Integrability of f on R does not necessarily imply the convergence of f(x) to 0 as x. a. There exists a positive continuous function f on R so that f is integrable
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 1
MATH 56A: STOCHASTIC PROCESSES CHAPTER. Finite Markov chains For the sake of completeness of these notes I decided to write a summary of the basic concepts of finite Markov chains. The topics in this chapter
More informationSYMBOL EXPLANATION EXAMPLE
MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the
More informationMultiplying Products of Prime Powers
Problem 1: Multiplying Products of Prime Powers Each positive integer can be expressed (in a unique way, according to the Fundamental Theorem of Arithmetic) as a product of powers of the prime numbers.
More informationMathematics 96 (3581) CA (Class Addendum) 4: Identity Properties Mt. San Jacinto College Menifee Valley Campus Spring 2013
Mathematics 96 (8) CA (Class Addendum) 4: Identity Properties Mt. San Jacinto College Menifee Valley Campus Spring 0 Name This class handout is worth a maximum of five () points. It is due no later than
More informationMath 220A - Fall Final Exam Solutions
Math 22A - Fall 216 - Final Exam Solutions Problem 1. Let f be an entire function and let n 2. Show that there exists an entire function g with g n = f if and only if the orders of all zeroes of f are
More informationFactorization in Integral Domains II
Factorization in Integral Domains II 1 Statement of the main theorem Throughout these notes, unless otherwise specified, R is a UFD with field of quotients F. The main examples will be R = Z, F = Q, and
More informationMath 117: Infinite Sequences
Math 7: Infinite Sequences John Douglas Moore November, 008 The three main theorems in the theory of infinite sequences are the Monotone Convergence Theorem, the Cauchy Sequence Theorem and the Subsequence
More informationHomework for Math , Spring 2013
Homework for Math 3220 2, Spring 2013 A. Treibergs, Instructor April 10, 2013 Our text is by Joseph L. Taylor, Foundations of Analysis, American Mathematical Society, Pure and Applied Undergraduate Texts
More informationSolutions to homework assignment #7 Math 119B UC Davis, Spring for 1 r 4. Furthermore, the derivative of the logistic map is. L r(x) = r(1 2x).
Solutions to homework assignment #7 Math 9B UC Davis, Spring 0. A fixed point x of an interval map T is called superstable if T (x ) = 0. Find the value of 0 < r 4 for which the logistic map L r has a
More informationMATH 2050 Assignment 4 Fall Due: Thursday. u v v 2 v = P roj v ( u) = P roj u ( v) =
MATH 5 Assignment 4 Fall 8 Due: Thursday [5]. Let u = and v =. Find the projection of u onto v; and the projection of v onto u respectively. ANS: The projection of u onto v is P roj v ( u) = u v v. Note
More informationProblem Points Score Total 100
Exam 2 A. Miller Spring 2002 Math 240 0 Show all work. Circle your answer. No notes, no books, no calculator, no cell phones, no pagers, no electronic devices at all. Solutions will be posted shortly after
More information3. Identify and find the general solution of each of the following first order differential equations.
Final Exam MATH 33, Sample Questions. Fall 7. y = Cx 3 3 is the general solution of a differential equation. Find the equation. Answer: y = 3y + 9 xy. y = C x + C x is the general solution of a differential
More informationN-gram N N-gram. N-gram. Detection and Correction for Errors in Hiragana Sequences by a Hiragana Character N-gram.
Vol. 40 No. 6 June 1999 N N 3 N N 5 36-gram 5 4-gram Detection and Correction for Errors in Hiragana Sequences by a Hiragana Character Hiroyuki Shinnou In this paper, we propose the hiragana character
More informationINTRODUCTION TO MCMC AND PAGERANK. Eric Vigoda Georgia Tech. Lecture for CS 6505
INTRODUCTION TO MCMC AND PAGERANK Eric Vigoda Georgia Tech Lecture for CS 6505 1 MARKOV CHAIN BASICS 2 ERGODICITY 3 WHAT IS THE STATIONARY DISTRIBUTION? 4 PAGERANK 5 MIXING TIME 6 PREVIEW OF FURTHER TOPICS
More informationInfinite Limits. By Tuesday J. Johnson
Infinite Limits By Tuesday J. Johnson Suggested Review Topics Algebra skills reviews suggested: Evaluating functions Graphing functions Working with inequalities Working with absolute values Trigonometric
More information(b) What is the variance of the time until the second customer arrives, starting empty, assuming that we measure time in minutes?
IEOR 3106: Introduction to Operations Research: Stochastic Models Fall 2006, Professor Whitt SOLUTIONS to Final Exam Chapters 4-7 and 10 in Ross, Tuesday, December 19, 4:10pm-7:00pm Open Book: but only
More informationComplex Analysis, Stein and Shakarchi The Fourier Transform
Complex Analysis, Stein and Shakarchi Chapter 4 The Fourier Transform Yung-Hsiang Huang 2017.11.05 1 Exercises 1. Suppose f L 1 (), and f 0. Show that f 0. emark 1. This proof is observed by Newmann (published
More informationMATH 111: HOMEWORK x y First difference
MATH 111: HOMEWORK 03 BLAKE FARMAN UNIVERSITY OF SOUTH CAROLINA 11. Using the given set of data, 1.3 (a) Find the first differences, x y First difference 0 205 1 218 2 231 3 244 4 5 6 (b) Is a linear model
More informationCS:4330 Theory of Computation Spring Regular Languages. Finite Automata and Regular Expressions. Haniel Barbosa
CS:4330 Theory of Computation Spring 2018 Regular Languages Finite Automata and Regular Expressions Haniel Barbosa Readings for this lecture Chapter 1 of [Sipser 1996], 3rd edition. Sections 1.1 and 1.3.
More informationx arctan x = x x x x2 9 +
Math 1B Project 3 Continued Fractions. Many of the special functions that occur in the applications of mathematics are defined by infinite processes, such as series, integrals, and iterations. The continued
More informationChapter 7. Linear Functions. LSowatsky 1
Chapter 7 Linear Functions LSowatsky 1 7.1B Equations and Functions I can make function tables and write equations. LSowatsky 2 Vocabulary: Relation set of ordered pairs Functions a relation where each
More informationProblems for M 11/2: A =
Math 30 Lesieutre Problem set # November 0 Problems for M /: 4 Let B be the basis given by b b Find the B-matrix for the transformation T : R R given by x Ax where 3 4 A (This just means the matrix for
More informationCS168: The Modern Algorithmic Toolbox Lecture #6: Markov Chain Monte Carlo
CS168: The Modern Algorithmic Toolbox Lecture #6: Markov Chain Monte Carlo Tim Roughgarden & Gregory Valiant April 15, 2015 The previous lecture covered several tools for inferring properties of the distribution
More information1 Introduction to Predicate Resolution
1 Introduction to Predicate Resolution The resolution proof system for Predicate Logic operates, as in propositional case on sets of clauses and uses a resolution rule as the only rule of inference. The
More informationADVANCED ALGEBRA (and Honors)
ADVANCED ALGEBRA (and Honors) Welcome to Advanced Algebra! Advanced Algebra will be challenging but rewarding!! This full year course requires that everyone work hard and study for the entirety of the
More informationMA 180 Lecture. Chapter 0. College Algebra and Calculus by Larson/Hodgkins. Fundamental Concepts of Algebra
0.) Real Numbers: Order and Absolute Value Definitions: Set: is a collection of objections in mathematics Real Numbers: set of numbers used in arithmetic MA 80 Lecture Chapter 0 College Algebra and Calculus
More informationHomework 3 Solutions, Math 55
Homework 3 Solutions, Math 55 1.8.4. There are three cases: that a is minimal, that b is minimal, and that c is minimal. If a is minimal, then a b and a c, so a min{b, c}, so then Also a b, so min{a, b}
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 3: Regenerative Processes Contents 3.1 Regeneration: The Basic Idea............................... 1 3.2
More informationTo get horizontal and slant asymptotes algebraically we need to know about end behaviour for rational functions.
Concepts: Horizontal Asymptotes, Vertical Asymptotes, Slant (Oblique) Asymptotes, Transforming Reciprocal Function, Sketching Rational Functions, Solving Inequalities using Sign Charts. Rational Function
More informationIowa State University. Instructor: Alex Roitershtein Summer Homework #1. Solutions
Math 501 Iowa State University Introduction to Real Analysis Department of Mathematics Instructor: Alex Roitershtein Summer 015 EXERCISES FROM CHAPTER 1 Homework #1 Solutions The following version of the
More informationMath 142 Week-in-Review #4 (Sections , 4.1, and 4.2)
Math 142 WIR, copyright Angie Allen, Fall 2018 1 Math 142 Week-in-Review #4 (Sections 3.1-3.3, 4.1, and 4.2) Note: This collection of questions is intended to be a brief overview of the exam material (with
More informationMath 220A Homework 4 Solutions
Math 220A Homework 4 Solutions Jim Agler 26. (# pg. 73 Conway). Prove the assertion made in Proposition 2. (pg. 68) that g is continuous. Solution. We wish to show that if g : [a, b] [c, d] C is a continuous
More informationA polynomial expression is the addition or subtraction of many algebraic terms with positive integer powers.
LEAVING CERT Honours Maths notes on Algebra. A polynomial expression is the addition or subtraction of many algebraic terms with positive integer powers. The degree is the highest power of x. 3x 2 + 2x
More informationCS168: The Modern Algorithmic Toolbox Lecture #14: Markov Chain Monte Carlo
CS168: The Modern Algorithmic Toolbox Lecture #14: Markov Chain Monte Carlo Tim Roughgarden & Gregory Valiant May 17, 2018 The previous lecture covered several tools for inferring properties of the distribution
More information2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic
CS 103 Discrete Structures Chapter 1 Propositional Logic Chapter 1.1 Propositional Logic 1 1.1 Propositional Logic Definition: A proposition :is a declarative sentence (that is, a sentence that declares
More informationFunctional Analysis Exercise Class
Functional Analysis Exercise Class Week 9 November 13 November Deadline to hand in the homeworks: your exercise class on week 16 November 20 November Exercises (1) Show that if T B(X, Y ) and S B(Y, Z)
More informationInformation Theory: Entropy, Markov Chains, and Huffman Coding
The University of Notre Dame A senior thesis submitted to the Department of Mathematics and the Glynn Family Honors Program Information Theory: Entropy, Markov Chains, and Huffman Coding Patrick LeBlanc
More informationCounting permutations by cyclic peaks and valleys
Annales Mathematicae et Informaticae 43 (2014) pp. 43 54 http://ami.ektf.hu Counting permutations by cyclic peaks and valleys Chak-On Chow a, Shi-Mei Ma b, Toufik Mansour c Mark Shattuck d a Division of
More informationHOMEWORK ASSIGNMENT 5
HOMEWORK ASSIGNMENT 5 DUE 1 MARCH, 2016 1) Let f(x) = 1 if x is rational and f(x) = 0 if x is irrational. Show that f is not continuous at any real number. Solution Fix any x R. We will show that f is
More informationMODEL ANSWERS TO HWK #1
MODEL ANSWERS TO HWK #1 1.1.20. (a) 0. Suppose that a = (a 1, a 2, a 3 ). Then 0 a = (0 a 1, 0 a 2, 0 a 3 ) = (0, 0, 0) = 0. The case of a vector in R 2 is similar (and easier). (b) a. Suppose that a =
More informationMath Linear Algebra Spring Term 2014 Course Description
Math 200 - Linear Algebra Spring Term 2014 Course Description February 6, 2014 Instructor: John Schmitt Office: Warner 311, Tel: Ext. 5952 E-mail: jschmitt@middlebury.edu Office Hours: Tuesday 1:30pm 3pm,
More informationa. Do you think the function is linear or non-linear? Explain using what you know about powers of variables.
8.5.8 Lesson Date: Graphs of Non-Linear Functions Student Objectives I can examine the average rate of change for non-linear functions and learn that they do not have a constant rate of change. I can determine
More informationProbabilistic Linguistics
Matilde Marcolli MAT1509HS: Mathematical and Computational Linguistics University of Toronto, Winter 2019, T 4-6 and W 4, BA6180 Bernoulli measures finite set A alphabet, strings of arbitrary (finite)
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationIntroduction to Cryptology Dr. Sugata Gangopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Roorkee
Introduction to Cryptology Dr. Sugata Gangopadhyay Department of Computer Science and Engineering Indian Institute of Technology, Roorkee Lecture 05 Problem discussion on Affine cipher and perfect secrecy
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2 a: Conditional Probability and Bayes Rule
2E1395 - Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2 a: Conditional Probability and Bayes Rule Exercise 2A1 We can call X the observation (X i indicates that the program
More informationName (print): Question 4. exercise 1.24 (compute the union, then the intersection of two sets)
MTH299 - Homework 1 Question 1. exercise 1.10 (compute the cardinality of a handful of finite sets) Solution. Write your answer here. Question 2. exercise 1.20 (compute the union of two sets) Question
More information4 3A : Increasing and Decreasing Functions and the First Derivative. Increasing and Decreasing. then
4 3A : Increasing and Decreasing Functions and the First Derivative Increasing and Decreasing! If the following conditions both occur! 1. f (x) is a continuous function on the closed interval [ a,b] and
More informationTOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology
TOPOLOGICAL COMPLEXITY OF 2-TORSION LENS SPACES AND ku-(co)homology DONALD M. DAVIS Abstract. We use ku-cohomology to determine lower bounds for the topological complexity of mod-2 e lens spaces. In the
More information1 Discussion on multi-valued functions
Week 3 notes, Math 7651 1 Discussion on multi-valued functions Log function : Note that if z is written in its polar representation: z = r e iθ, where r = z and θ = arg z, then log z log r + i θ + 2inπ
More informationb for the linear system x 1 + x 2 + a 2 x 3 = a x 1 + x 3 = 3 x 1 + x 2 + 9x 3 = 3 ] 1 1 a 2 a
Practice Exercises for Exam Exam will be on Monday, September 8, 7. The syllabus for Exam consists of Sections One.I, One.III, Two.I, and Two.II. You should know the main definitions, results and computational
More information11.3 Decoding Algorithm
11.3 Decoding Algorithm 393 For convenience, we have introduced π 0 and π n+1 as the fictitious initial and terminal states begin and end. This model defines the probability P(x π) for a given sequence
More informationRandom Walk in Periodic Environment
Tdk paper Random Walk in Periodic Environment István Rédl third year BSc student Supervisor: Bálint Vető Department of Stochastics Institute of Mathematics Budapest University of Technology and Economics
More informationPATTERN MATCHING WITH SWAPS IN PRACTICE
International Journal of Foundations of Computer Science c World Scientific Publishing Company PATTERN MATCHING WITH SWAPS IN PRACTICE MATTEO CAMPANELLI Università di Catania, Scuola Superiore di Catania
More informationAlgebra Exam Topics. Updated August 2017
Algebra Exam Topics Updated August 2017 Starting Fall 2017, the Masters Algebra Exam will have 14 questions. Of these students will answer the first 8 questions from Topics 1, 2, and 3. They then have
More informationMore Polynomial Equations Section 6.4
MATH 11009: More Polynomial Equations Section 6.4 Dividend: The number or expression you are dividing into. Divisor: The number or expression you are dividing by. Synthetic division: Synthetic division
More information4/5/2012: Second midterm practice A
Math 1A: introduction to functions and calculus Oliver Knill, Spring 212 4/5/212: Second midterm practice A Your Name: Problem 1) TF questions (2 points) No justifications are needed. 1) T F The formula
More informationCh5. Markov Chain Monte Carlo
ST4231, Semester I, 2003-2004 Ch5. Markov Chain Monte Carlo In general, it is very difficult to simulate the value of a random vector X whose component random variables are dependent. In this chapter we
More informationCompressed Index for Dynamic Text
Compressed Index for Dynamic Text Wing-Kai Hon Tak-Wah Lam Kunihiko Sadakane Wing-Kin Sung Siu-Ming Yiu Abstract This paper investigates how to index a text which is subject to updates. The best solution
More information4/8/2014: Second midterm practice C
Math 1A: introduction to functions and calculus Oliver Knill, Spring 214 4/8/214: Second midterm practice C Your Name: Start by writing your name in the above box. Try to answer each question on the same
More information1 Sequences of events and their limits
O.H. Probability II (MATH 2647 M15 1 Sequences of events and their limits 1.1 Monotone sequences of events Sequences of events arise naturally when a probabilistic experiment is repeated many times. For
More informationITCT Lecture IV.3: Markov Processes and Sources with Memory
ITCT Lecture IV.3: Markov Processes and Sources with Memory 4. Markov Processes Thus far, we have been occupied with memoryless sources and channels. We must now turn our attention to sources with memory.
More informationA FAMILY OF FINITE GELFAND PAIRS ASSOCIATED WITH WREATH PRODUCTS
A FAMILY OF FINITE GELFAND PAIRS ASSOCIATED WITH WREATH PRODUCTS CHAL BENSON AND GAIL RATCLIFF Abstract. Consider the wreath product G n = Γ n S n of a finite group Γ with the symmetric group S n. Letting
More informationNoisy-Channel Coding
Copyright Cambridge University Press 2003. On-screen viewing permitted. Printing not permitted. http://www.cambridge.org/05264298 Part II Noisy-Channel Coding Copyright Cambridge University Press 2003.
More informationMarkov Decision Processes
Markov Decision Processes Lecture notes for the course Games on Graphs B. Srivathsan Chennai Mathematical Institute, India 1 Markov Chains We will define Markov chains in a manner that will be useful to
More informationMath 425 Fall All About Zero
Math 425 Fall 2005 All About Zero These notes supplement the discussion of zeros of analytic functions presented in 2.4 of our text, pp. 127 128. Throughout: Unless stated otherwise, f is a function analytic
More information2.7: Derivatives and Rates of Change
2.7: Derivatives and Rates of Change Recall from section 2.1, that the tangent line to a curve at a point x = a has a slope that can be found by finding the slopes of secant lines through the curve at
More informationMath 328 Course Notes
Math 328 Course Notes Ian Robertson March 3, 2006 3 Properties of C[0, 1]: Sup-norm and Completeness In this chapter we are going to examine the vector space of all continuous functions defined on the
More informationOn the Zeros of the Riemann Zeta Function in the Critical Strip. Ill
MATHEMATICS OF COMPUTATION VOLUME 41, NUMBER 164 OCTOBER 1983. PAGES 759-767 On the Zeros of the Riemann Zeta Function in the Critical Strip. Ill By J. van de Lune and H. J. J. te Riele Abstract. We describe
More informationChapter 0 Introduction. Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin
Chapter 0 Introduction Fourth Academic Year/ Elective Course Electrical Engineering Department College of Engineering University of Salahaddin October 2014 Automata Theory 2 of 22 Automata theory deals
More informationSecurity of Networks (12) Exercises
(12) Exercises 1.1 Below are given four examples of ciphertext, one obtained from a Substitution Cipher, one from a Vigenere Cipher, one from an Affine Cipher, and one unspecified. In each case, the task
More information8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains
8. Statistical Equilibrium and Classification of States: Discrete Time Markov Chains 8.1 Review 8.2 Statistical Equilibrium 8.3 Two-State Markov Chain 8.4 Existence of P ( ) 8.5 Classification of States
More informationMS&E 321 Spring Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10. x n+1 = f(x n ),
MS&E 321 Spring 12-13 Stochastic Systems June 1, 2013 Prof. Peter W. Glynn Page 1 of 10 Section 4: Steady-State Theory Contents 4.1 The Concept of Stochastic Equilibrium.......................... 1 4.2
More informationMath 180C, Spring Supplement on the Renewal Equation
Math 18C Spring 218 Supplement on the Renewal Equation. These remarks supplement our text and set down some of the material discussed in my lectures. Unexplained notation is as in the text or in lecture.
More informationLanguage Models. Data Science: Jordan Boyd-Graber University of Maryland SLIDES ADAPTED FROM PHILIP KOEHN
Language Models Data Science: Jordan Boyd-Graber University of Maryland SLIDES ADAPTED FROM PHILIP KOEHN Data Science: Jordan Boyd-Graber UMD Language Models 1 / 8 Language models Language models answer
More informationMSc MT15. Further Statistical Methods: MCMC. Lecture 5-6: Markov chains; Metropolis Hastings MCMC. Notes and Practicals available at
MSc MT15. Further Statistical Methods: MCMC Lecture 5-6: Markov chains; Metropolis Hastings MCMC Notes and Practicals available at www.stats.ox.ac.uk\ nicholls\mscmcmc15 Markov chain Monte Carlo Methods
More informationMath 225A: Differential Topology, Homework 4
Math 225A: Differential Topology, Homework 4 Ian Coley February 10, 2014 Problem 1.5.4. Let X and Z be transversal submanifolds of Y. Prove that if y X Z, then T y (X Z) = T y (X) T y (Z). Since X Z is
More informationINTRODUCING LINEAR EQUATIONS IN ONE UNKNOWN
LESSON 1: INTRODUCING LINEAR EQUATIONS IN ONE UNKNOWN A linear equations in one unknown consists of two expressions that are linked by an = sign. An equation states that two expressions represent the same
More informationMath 564 Homework 1. Solutions.
Math 564 Homework 1. Solutions. Problem 1. Prove Proposition 0.2.2. A guide to this problem: start with the open set S = (a, b), for example. First assume that a >, and show that the number a has the properties
More informationWrite your Name, Registration Number, Test Centre, Test Code and the Number of this booklet in the appropriate places on the answersheet.
2009 Booklet No. Test Code : SIA Forenoon Questions : 30 Time : 2 hours Write your Name, Registration Number, Test Centre, Test Code and the Number of this booklet in the appropriate places on the answersheet.
More informationMATH 19B FINAL EXAM PROBABILITY REVIEW PROBLEMS SPRING, 2010
MATH 9B FINAL EXAM PROBABILITY REVIEW PROBLEMS SPRING, 00 This handout is meant to provide a collection of exercises that use the material from the probability and statistics portion of the course The
More informationMATH 311: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE
MATH 3: COMPLEX ANALYSIS CONTOUR INTEGRALS LECTURE Recall the Residue Theorem: Let be a simple closed loop, traversed counterclockwise. Let f be a function that is analytic on and meromorphic inside. Then
More information