Version: 0.1 This is an early version. A better version would be hopefully posted in the near future.
|
|
- Milton Nash
- 7 years ago
- Views:
Transcription
1 Chapte 28 Shao s theoem Vesio: 0.1 This is a ealy vesio. A bette vesio would be hopefully posted i the ea futue. By Saiel Ha-Peled, Decembe 7, This has bee a ovel about some people who wee puished etiely too much fo what they did. They wated to have a good time, but they wee like childe playig i the steet; they could see oe afte aothe of them beig killed - u ove, maimed, destoyed - but they cotiued to play ayhow. We eally all wee vey happy fo a while, sittig aoud ot toilig but just bullshittig ad playig, but it was fo such a teible bief time, ad the the puishmet was beyod belief; eve whe we could see it, we could ot believe it. A Scae Dakly, Philip K. Dick 28.1 Codig: Shao s Theoem We ae iteested i the poblem sedig messages ove a oisy chael. We will assume that the chael oise is behave icely. Defiitio The iput to a biay symmetic chael with paamete p is a sequece of bits x 1, x 2,..., ad the output is a sequece of bits y 1, y 2,..., such that P [ x i = y i = 1 p idepedetly fo each i. Taslatio: Evey bit tasmitted have the same pobability to be flipped by the chael. The questio is how much ifomatio ca we sed o the chael with this level of oise. Natually, a chael would have some capacity costaits (say, at most 4,000 bits pe secod ca be set o the chael), ad the questio is how to sed the lagest amout of ifomatio, so that the eceive ca ecove the oigial ifomatio set. 1 This wok is licesed ude the Ceative Commos Attibutio-Nocommecial 3.0 Licese. To view a copy of this licese, visit o sed a lette to Ceative Commos, 171 Secod Steet, Suite 300, Sa Facisco, Califoia, 94105, USA. 1
2 Now, its impotat to ealize that oise hadle is uavoidable i the eal wold. Futhemoe, thee ae tadeoffs betwee chael capacity ad oise levels (i.e., we might be able to sed cosideably moe bits o the chael but the pobability of flippig (i.e., p) might be much lage). I desigig a commuicatio potocol ove this chael, we eed to figue out whee is the optimal choice as fa as the amout of ifomatio set. Defiitio A (k, ) ecodig fuctio Ec : {0, 1} k {0, 1} takes as iput a sequece of k bits ad outputs a sequece of bits. A (k, ) decodig fuctio Dec : {0, 1} {0, 1} k takes as iput a sequece of bits ad outputs a sequece of k bits. Thus, the sede would use the ecodig fuctio to sed its message, ad the decode would use the eceived stig (with the oise i it), to ecove the set message. Thus, the sede stats with a message with k bits, it blow it up to bits, usig the ecodig fuctio, to get some obustess to oise, it sed it ove the (oisy) chael to the eceive. The eceive, takes the give (oisy) message with bits, ad use the decodig fuctio to ecove the oigial k bits of the message. Natually, we would like k to be as lage as possible (fo a fixed ), so that we ca sed as much ifomatio as possible o the chael. The followig celebated esult of Shao 2 i 1948 states exactly how much ifomatio ca be set o such a chael. Theoem (Shao s theoem) Fo a biay symmetic chael with paamete p < 1/2 ad fo ay costats δ, γ > 0, whee is sufficietly lage, the followig holds: (i) Fo a k (1 H(p) δ) thee exists (k, ) ecodig ad decodig fuctios such that the pobability the eceive fails to obtai the coect message is at most γ fo evey possible k-bit iput messages. (ii) Thee ae o (k, ) ecodig ad decodig fuctios with k (1 H(p) + δ) such that the pobability of decodig coectly is at least γ fo a k-bit iput message chose uifomly at adom Poof of Shao s theoem The poof is ot had, but equies some cae, ad we will beak it ito pats How to ecode ad decode efficietly The scheme Ou scheme would be simple. Pick k (1 H(p) δ). Fo ay umbe i = 0,..., K = 2 k+1 1, adomly geeate a biay stig Y i made out of bits, each oe chose idecetly ad uifomly. Let Y 0,..., Y K deote these code wods. 2 Claude Elwood Shao (Apil 30, Febuay 24, 2001), a Ameica electical egiee ad mathematicia, has bee called the fathe of ifomatio theoy. 2
3 Fo each of these codewods we will compute the pobability that if we sed this codewod, the eceive would fail. Let X 0,..., X K, whee K = 2 k 1, be the K codewods with the lowest pobability to fail. We assig these wods to the 2 k messages we eed to ecode i a abitay fashio. The decodig of a message w is doe by goig ove all the codewods, ad fidig all the codewods that ae i (Hammig) distace i the age [p(1 ε), p(1 + ε) fom w. If thee is oly a sigle wod X i with this popety, we etu i as the decoded wod. Othewise, if thee ae o such wods o thee is moe tha oe wod, the decode stops ad epot a eo The poof Ituitio. Let S i be all the biay stigs (of legth ) such that if the eceive gets this wod, it would deciphe it to be i (hee ae still usig the exteded codewod Y 0,..., Y K ). Note, that if we emove some codewods fom cosideatio, the set S i just iceases i size. Let W i be the pobability that X i was set, but it was ot decipheed coectly. Fomally, let deote the eceived wod. We have that W i = P[ eceived whe X i was set. S i To boud this quatity, let (x, y) deote the Hammig distace betwee the biay stigs x ad y. Clealy, if x was set the pobability that y was eceived is w(x, y) = p (x,y) (1 p) (x,y). As such, we have P[ eceived whe X i was set = w(x i, ). Let S i, be a idicato vaiable which is 1 if S i. We have that W i = P[ eceived whe X i was set = w(x i, ) = S i, w(x i, ). S i S i The value of W i is a adom vaiable of ou choice of Y 0,..., Y K. As such, its atual to ask what is the expected value of W i. Coside the ig R() = { x (1 ε)p (x, ) (1 + ε)p whee ε > 0 is a small eough costat. Suppose, that the code wod Y i was set, ad was eceived. The decode etu i if Y i is the oly codewod that falls iside R(). Lemma Give that Y i was set, ad was eceived ad futhemoe R(Y i ), the the pobability of the decode failig, is τ = P S i R(Y i ) γ 8, whee γ is the paamete of Theoem },
4 Poof: The decode fails hee, oly if R() cotais some othe codewod Y j ( j i) i it. As such, τ = P S i R(Y i ) P [ Y j R(), fo ay j i P [ Y j R(). Now, we emid the eade that the Y j s ae geeated by pickig each bit adomly ad idepedetly, with pobability 1/2. As such, we have P [ Y j R() ( (1+ε)p m) = 2 ( ), 2 (1 + ε)p m=(1 ε)p sice (1 + ε)p < 1/2 (fo ε sufficietly small), ad as such the last biomial coefficiet i this summatio is the lagest. By Coollay (i), we have P [ Y j R() ( ) 2 (1 + ε)p 2 2H((1+ε)p) = 2 (H((1+ε)p) 1). As such, we have τ = P S i R(Y i ) P [ Y j R(). K P[Y 1 R() 2 k+1 2 (H((1+ε)p) 1) 2 (1 H(p) δ)+1+(h((1+ε)p) 1) 2 ( ) H((1+ε)p) H(p) δ +1 sice k (1 H(p) δ). Now, we choose ε to be a small eough costat, so that the quatity H ((1 + ε)p) H(p) δ is equal to some (absolute) egative (costat), say β, whee β > 0. The, τ 2 β+1, ad choosig lage eough, we ca make τ smalle tha γ/2, as desied. As such, we just poved that τ = P S i R(Y i ) γ 2. Lemma We have, that w(y i, ) γ/8, whee γ is the paamete of Theoem Poof: This quatity, is the pobability of sedig Y i whe evey bit is flipped with pobability p, ad eceivig a stig such that moe tha εp bits whee flipped. But this quatity ca be bouded usig the Cheoff iequality. Let Z = (Y i, ), ad obseve that E[Z = p, ad it is the sum of idepedet idicato vaiables. As such w(y i, ) = P [ Z E[Z > εp ) 2 exp ( ε2 4 p < γ 4, sice ε is a costat, ad fo sufficietly lage. Lemma Fo ay i, we have µ = E[W i γ/4, whee γ is the paamete of Theoem Poof: By lieaity of expectatios, we have µ = E[W i = E S i, w(y i, ) = [ E S i, w(y i, ) = E[ S i, w(yi, ) = P[x S i w(y i, ), 4
5 sice S i, is a idicato vaiable. Settig, τ = P S i R(Y i ) ad sice w(y i, ) = 1, we get µ = P[x S i w(y i, ) + P[x S i w(y i, ) = R(Y i ) R(Y i ) R(Y i ) P x S i R(Y i ) w(y i, ) + τ w(y i, ) + w(y i, ) τ + P[x S i w(y i, ) w(y i, ) γ 4 + γ 4 = γ 2. Now, the eceive got (whe we set Y i ), ad it would miss ecode it oly if (i) is outside of R(Y i ), o R() cotais some othe codewod Y j ( j i) i it. As such, τ = P S i R(Y i ) P [ Y j R(), fo ay j i P [ Y j R(). Now, we emid the eade that the Y j s ae geeated by pickig each bit adomly ad idepedetly, with pobability 1/2. As such, we have P [ Y j R() ( (1+ε)p m) = 2 ( ), 2 (1 + ε)p m=(1 ε)p sice (1 + ε)p < 1/2 (fo ε sufficietly small), ad as such the last biomial coefficiet i this summatio is the lagest. By Coollay (i), we have P [ Y j R() ( ) 2 (1 + ε)p 2 2H((1+ε)p) = 2 (H((1+ε)p) 1). As such, we have τ = P S i R(Y i ) P [ Y j R(). K P[Y 1 R() 2 k+1 2 (H((1+ε)p) 1) 2 (1 H(p) δ)+1+(h((1+ε)p) 1) 2 ( ) H((1+ε)p) H(p) δ +1 sice k (1 H(p) δ). Now, we choose ε to be a small eough costat, so that the quatity H ((1 + ε)p) H(p) δ is egative (costat). The, choosig lage eough, we ca make τ smalle tha γ/2, as desied. As such, we just poved that τ = P S i R(Y i ) γ 2. I the followig, we eed the followig tivial (but supisigly deep) obsevatio. Obsevatio Fo a adom vaiable X, if E[X ψ, the thee exists a evet i the pobability space, that assigs X a value µ. This holds, sice E[X is just the aveage of X ove the pobability space. As such, thee must be a evet i the uivese whee the value of X does ot exceed its aveage value. 5
6 The above obsevatio is oe of the mai tools i a poweful techique to povig vaious claims i mathematics, kow as the pobabilistic method. Lemma Fo the codewods X 0,..., X K, the pobability of failue i ecoveig them whe sedig them ove the oisy chael is at most γ. Poof: We just poved that whe usig Y 0,..., Y K, the expected pobability of failue whe sedig Y i, is E[W i γ 2, whee K = 2 k+1 1. As such, the expected total pobability of failue is K K E W i = E[W i γ 2 2k+1 = γ2 k, by Lemma (hee we ae usig the facts that all the adom vaiables we have ae symmetic ad behave i the same way). As such, by Obsevatio , thee exist a choice of Y i s, such that K W i 2 k γ. Now, we use a simila agumet used i povig Makov s iequality. Ideed, the W i ae always positive, ad it ca ot be that 2 k of them have value lage tha γ, because i the summatio, we will get that K W i > 2 k γ. Which is a cotadictio. As such, thee ae 2 k codewods with failue pobability smalle tha γ. We set ou 2 k codewod to be these wods. Sice we picked oly a subset of the codewods fo ou code, the pobability of failue fo each codewod shiks, ad is at most γ. Lemma cocludes the poof of the costuctive pat of Shao s theoem Lowe boud o the message size We omit the poof of this pat Fom pevious lectues ( ) Lemma Suppose that q is itege i the age [0,. The 2H(q) H(q). q Lemma ca be exteded to hadle o-itege values of q. This is staightfowad, ad we omit the easy details. (i) q [0, 1/2 ( ) q 2 H(q). (ii) q [1/2, 1 ( Coollay We have: q ) 2 H(q). (iii) q [1/2, 1 2H(q) ( ) +1 q. (iv) q [0, 1/2 2 H(q) ( +1 q ). Theoem Suppose that the value of a adom vaiable X is chose uifomly at adom fom the iteges {0,..., m 1}. The thee is a extactio fuctio fo X that outputs o aveage at least lg m 1 = H (X) 1 idepedet ad ubiased bits. 6
7 28.4 Bibliogaphical Notes The pesetatio hee follows [MU05, Sec. 9.1-Sec 9.3. Bibliogaphy [MU05 M. Mitzemache ad U. Upfal. Pobability ad Computig adomized algoithms ad pobabilistic aalysis. Cambidge,
Understanding Financial Management: A Practical Guide Guideline Answers to the Concept Check Questions
Udestadig Fiacial Maagemet: A Pactical Guide Guidelie Aswes to the Cocept Check Questios Chapte 4 The Time Value of Moey Cocept Check 4.. What is the meaig of the tems isk-etu tadeoff ad time value of
More informationOn the Optimality and Interconnection of Valiant Load-Balancing Networks
O the Optimality ad Itecoectio of Valiat Load-Balacig Netwoks Moshe Babaioff ad Joh Chuag School of Ifomatio Uivesity of Califoia at Bekeley Bekeley, Califoia 94720 4600 {moshe,chuag}@sims.bekeley.edu
More informationPeriodic Review Probabilistic Multi-Item Inventory System with Zero Lead Time under Constraints and Varying Order Cost
Ameica Joual of Applied Scieces (8: 3-7, 005 ISS 546-939 005 Sciece Publicatios Peiodic Review Pobabilistic Multi-Item Ivetoy System with Zeo Lead Time ude Costaits ad Vayig Ode Cost Hala A. Fegay Lectue
More informationOPTIMALLY EFFICIENT MULTI AUTHORITY SECRET BALLOT E-ELECTION SCHEME
OPTIMALLY EFFICIENT MULTI AUTHORITY SECRET BALLOT E-ELECTION SCHEME G. Aja Babu, 2 D. M. Padmavathamma Lectue i Compute Sciece, S.V. Ats College fo Me, Tiupati, Idia 2 Head, Depatmet of Compute Applicatio.
More informationMoney Math for Teens. Introduction to Earning Interest: 11th and 12th Grades Version
Moey Math fo Tees Itoductio to Eaig Iteest: 11th ad 12th Gades Vesio This Moey Math fo Tees lesso is pat of a seies ceated by Geeatio Moey, a multimedia fiacial liteacy iitiative of the FINRA Ivesto Educatio
More informationAnnuities and loan. repayments. Syllabus reference Financial mathematics 5 Annuities and loan. repayments
8 8A Futue value of a auity 8B Peset value of a auity 8C Futue ad peset value tables 8D Loa epaymets Auities ad loa epaymets Syllabus efeece Fiacial mathematics 5 Auities ad loa epaymets Supeauatio (othewise
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationPaper SD-07. Key words: upper tolerance limit, macros, order statistics, sample size, confidence, coverage, binomial
SESUG 212 Pae SD-7 Samle Size Detemiatio fo a Noaametic Ue Toleace Limit fo ay Ode Statistic D. Deis Beal, Sciece Alicatios Iteatioal Cooatio, Oak Ridge, Teessee ABSTRACT A oaametic ue toleace limit (UTL)
More informationChapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationLecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More informationFinance Practice Problems
Iteest Fiace Pactice Poblems Iteest is the cost of boowig moey. A iteest ate is the cost stated as a pecet of the amout boowed pe peiod of time, usually oe yea. The pevailig maket ate is composed of: 1.
More informationLearning Objectives. Chapter 2 Pricing of Bonds. Future Value (FV)
Leaig Objectives Chapte 2 Picig of Bods time value of moey Calculate the pice of a bod estimate the expected cash flows detemie the yield to discout Bod pice chages evesely with the yield 2-1 2-2 Leaig
More informationThe dinner table problem: the rectangular case
The ie table poblem: the ectagula case axiv:math/009v [mathco] Jul 00 Itouctio Robeto Tauaso Dipatimeto i Matematica Uivesità i Roma To Vegata 00 Roma, Italy tauaso@matuiomait Decembe, 0 Assume that people
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationA probabilistic proof of a binomial identity
A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationDerivation of Annuity and Perpetuity Formulae. A. Present Value of an Annuity (Deferred Payment or Ordinary Annuity)
Aity Deivatios 4/4/ Deivatio of Aity ad Pepetity Fomlae A. Peset Vale of a Aity (Defeed Paymet o Odiay Aity 3 4 We have i the show i the lecte otes ad i ompodi ad Discoti that the peset vale of a set of
More informationCS103X: Discrete Structures Homework 4 Solutions
CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationThe Binomial Distribution
The Binomial Distibution A. It would be vey tedious if, evey time we had a slightly diffeent poblem, we had to detemine the pobability distibutions fom scatch. Luckily, thee ae enough similaities between
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationMaximum Entropy, Parallel Computation and Lotteries
Maximum Etopy, Paallel Computatio ad Lotteies S.J. Cox Depatmet of Electoics ad Compute Sciece, Uivesity of Southampto, UK. G.J. Daiell Depatmet of Physics ad Astoomy, Uivesity of Southampto, UK. D.A.
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More information3. Greatest Common Divisor - Least Common Multiple
3 Greatest Commo Divisor - Least Commo Multiple Defiitio 31: The greatest commo divisor of two atural umbers a ad b is the largest atural umber c which divides both a ad b We deote the greatest commo gcd
More informationTwo degree of freedom systems. Equations of motion for forced vibration Free vibration analysis of an undamped system
wo degee of feedom systems Equatios of motio fo foced vibatio Fee vibatio aalysis of a udamped system Itoductio Systems that equie two idepedet d coodiates to descibe thei motio ae called two degee of
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationI. Chi-squared Distributions
1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.
More informationSymmetric polynomials and partitions Eugene Mukhin
Symmetic polynomials and patitions Eugene Mukhin. Symmetic polynomials.. Definition. We will conside polynomials in n vaiables x,..., x n and use the shotcut p(x) instead of p(x,..., x n ). A pemutation
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationFactors of sums of powers of binomial coefficients
ACTA ARITHMETICA LXXXVI.1 (1998) Factors of sums of powers of biomial coefficiets by Neil J. Cali (Clemso, S.C.) Dedicated to the memory of Paul Erdős 1. Itroductio. It is well ow that if ( ) a f,a = the
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationSaturated and weakly saturated hypergraphs
Satuated and weakly satuated hypegaphs Algebaic Methods in Combinatoics, Lectues 6-7 Satuated hypegaphs Recall the following Definition. A family A P([n]) is said to be an antichain if we neve have A B
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationLogistic Regression, AdaBoost and Bregman Distances
A exteded abstact of this joual submissio appeaed ipoceedigs of the Thiteeth Aual Cofeece o ComputatioalLeaig Theoy, 2000 Logistic Regessio, Adaoost ad egma istaces Michael Collis AT&T Labs Reseach Shao
More informationSection 11.3: The Integral Test
Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationThe LCOE is defined as the energy price ($ per unit of energy output) for which the Net Present Value of the investment is zero.
Poject Decision Metics: Levelized Cost of Enegy (LCOE) Let s etun to ou wind powe and natual gas powe plant example fom ealie in this lesson. Suppose that both powe plants wee selling electicity into the
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationOur aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series
8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series
More informationSampling Distribution And Central Limit Theorem
() Samplig Distributio & Cetral Limit Samplig Distributio Ad Cetral Limit Samplig distributio of the sample mea If we sample a umber of samples (say k samples where k is very large umber) each of size,
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationFigure 2. So it is very likely that the Babylonians attributed 60 units to each side of the hexagon. Its resulting perimeter would then be 360!
1. What ae angles? Last time, we looked at how the Geeks intepeted measument of lengths. Howeve, as fascinated as they wee with geomety, thee was a shape that was much moe enticing than any othe : the
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationEstimating Surface Normals in Noisy Point Cloud Data
Estiatig Suface Noals i Noisy Poit Cloud Data Niloy J. Mita Stafod Gaphics Laboatoy Stafod Uivesity CA, 94305 iloy@stafod.edu A Nguye Stafod Gaphics Laboatoy Stafod Uivesity CA, 94305 aguye@cs.stafod.edu
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationHow To Solve The Homewor Problem Beautifully
Egieerig 33 eautiful Homewor et 3 of 7 Kuszmar roblem.5.5 large departmet store sells sport shirts i three sizes small, medium, ad large, three patters plaid, prit, ad stripe, ad two sleeve legths log
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More informationCS85: You Can t Do That (Lower Bounds in Computer Science) Lecture Notes, Spring 2008. Amit Chakrabarti Dartmouth College
CS85: You Ca t Do That () Lecture Notes, Sprig 2008 Amit Chakrabarti Dartmouth College Latest Update: May 9, 2008 Lecture 1 Compariso Trees: Sortig ad Selectio Scribe: William Che 1.1 Sortig Defiitio 1.1.1
More informationCapacity of Wireless Networks with Heterogeneous Traffic
Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More information1. C. The formula for the confidence interval for a population mean is: x t, which was
s 1. C. The formula for the cofidece iterval for a populatio mea is: x t, which was based o the sample Mea. So, x is guarateed to be i the iterval you form.. D. Use the rule : p-value
More informationCHAPTER 3 DIGITAL CODING OF SIGNALS
CHAPTER 3 DIGITAL CODING OF SIGNALS Computers are ofte used to automate the recordig of measuremets. The trasducers ad sigal coditioig circuits produce a voltage sigal that is proportioal to a quatity
More informationBasic Elements of Arithmetic Sequences and Series
MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic
More informationExample 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).
BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationA Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More information*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.
Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.
More informationLecture 5: Span, linear independence, bases, and dimension
Lecture 5: Spa, liear idepedece, bases, ad dimesio Travis Schedler Thurs, Sep 23, 2010 (versio: 9/21 9:55 PM) 1 Motivatio Motivatio To uderstad what it meas that R has dimesio oe, R 2 dimesio 2, etc.;
More information2 r2 θ = r2 t. (3.59) The equal area law is the statement that the term in parentheses,
3.4. KEPLER S LAWS 145 3.4 Keple s laws You ae familia with the idea that one can solve some mechanics poblems using only consevation of enegy and (linea) momentum. Thus, some of what we see as objects
More information1. MATHEMATICAL INDUCTION
1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1
More informationMultiplexers and Demultiplexers
I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see
More informationExplicit, analytical solution of scaling quantum graphs. Abstract
Explicit, analytical solution of scaling quantum gaphs Yu. Dabaghian and R. Blümel Depatment of Physics, Wesleyan Univesity, Middletown, CT 06459-0155, USA E-mail: ydabaghian@wesleyan.edu (Januay 6, 2003)
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS... 1 ANNUITIES SOFTWARE ASSIGNMENT... 2 WHAT IS AN ANNUITY?... 2 EXAMPLE 1... 2 QUESTIONS...
ANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS ANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS... 1 ANNUITIES SOFTWARE ASSIGNMENT... WHAT IS AN ANNUITY?... EXAMPLE 1... QUESTIONS... EXAMPLE BRANDON S
More informationMath C067 Sampling Distributions
Math C067 Samplig Distributios Sample Mea ad Sample Proportio Richard Beigel Some time betwee April 16, 2007 ad April 16, 2007 Examples of Samplig A pollster may try to estimate the proportio of voters
More informationTHE PRINCIPLE OF THE ACTIVE JMC SCATTERER. Seppo Uosukainen
THE PRINCIPLE OF THE ACTIVE JC SCATTERER Seppo Uoukaie VTT Buildig ad Tapot Ai Hadlig Techology ad Acoutic P. O. Bo 1803, FIN 02044 VTT, Filad Seppo.Uoukaie@vtt.fi ABSTRACT The piciple of fomulatig the
More informationTHE REGRESSION MODEL IN MATRIX FORM. For simple linear regression, meaning one predictor, the model is. for i = 1, 2, 3,, n
We will cosider the liear regressio model i matrix form. For simple liear regressio, meaig oe predictor, the model is i = + x i + ε i for i =,,,, This model icludes the assumptio that the ε i s are a sample
More informationTHE ARITHMETIC OF INTEGERS. - multiplication, exponentiation, division, addition, and subtraction
THE ARITHMETIC OF INTEGERS - multiplicatio, expoetiatio, divisio, additio, ad subtractio What to do ad what ot to do. THE INTEGERS Recall that a iteger is oe of the whole umbers, which may be either positive,
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The
More informationOverview on S-Box Design Principles
Overview o S-Box Desig Priciples Debdeep Mukhopadhyay Assistat Professor Departmet of Computer Sciece ad Egieerig Idia Istitute of Techology Kharagpur INDIA -721302 What is a S-Box? S-Boxes are Boolea
More informationTheorems About Power Series
Physics 6A Witer 20 Theorems About Power Series Cosider a power series, f(x) = a x, () where the a are real coefficiets ad x is a real variable. There exists a real o-egative umber R, called the radius
More information3 Basic Definitions of Probability Theory
3 Basic Defiitios of Probability Theory 3defprob.tex: Feb 10, 2003 Classical probability Frequecy probability axiomatic probability Historical developemet: Classical Frequecy Axiomatic The Axiomatic defiitio
More informationMEI Structured Mathematics. Module Summary Sheets. Statistics 2 (Version B: reference to new book)
MEI Mathematics i Educatio ad Idustry MEI Structured Mathematics Module Summary Sheets Statistics (Versio B: referece to ew book) Topic : The Poisso Distributio Topic : The Normal Distributio Topic 3:
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationOn the Capacity of Hybrid Wireless Networks
O the Capacity of Hybrid ireless Networks Beyua Liu,ZheLiu +,DoTowsley Departmet of Computer Sciece Uiversity of Massachusetts Amherst, MA 0002 + IBM T.J. atso Research Ceter P.O. Box 704 Yorktow Heights,
More informationChapter 3 Savings, Present Value and Ricardian Equivalence
Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationLong-Term Trend Analysis of Online Trading --A Stochastic Order Switching Model
Asia Pacific Maagemet Review (24) 9(5), 893-924 Log-Tem Ted Aalysis of Olie Tadig --A Stochastic Ode Switchig Model Shalig Li * ad Zili Ouyag ** Abstact Olie bokeages ae eplacig bokes ad telephoes with
More informationUniversity of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.
More informationOn Formula to Compute Primes. and the n th Prime
Applied Mathematical cieces, Vol., 0, o., 35-35 O Formula to Compute Primes ad the th Prime Issam Kaddoura Lebaese Iteratioal Uiversity Faculty of Arts ad cieces, Lebao issam.kaddoura@liu.edu.lb amih Abdul-Nabi
More informationFinancing Terms in the EOQ Model
Financing Tems in the EOQ Model Habone W. Stuat, J. Columbia Business School New Yok, NY 1007 hws7@columbia.edu August 6, 004 1 Intoduction This note discusses two tems that ae often omitted fom the standad
More informationWeek 3-4: Permutations and Combinations
Week 3-4: Pemutations and Combinations Febuay 24, 2016 1 Two Counting Pinciples Addition Pinciple Let S 1, S 2,, S m be disjoint subsets of a finite set S If S S 1 S 2 S m, then S S 1 + S 2 + + S m Multiplication
More informationCHAPTER 3 THE TIME VALUE OF MONEY
CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all
More informationConverting knowledge Into Practice
Conveting knowledge Into Pactice Boke Nightmae srs Tend Ride By Vladimi Ribakov Ceato of Pips Caie 20 of June 2010 2 0 1 0 C o p y i g h t s V l a d i m i R i b a k o v 1 Disclaime and Risk Wanings Tading
More informationInterference Alignment and the Generalized Degrees of Freedom of the X Channel
Iterferece Aligmet ad the Geeralized Degrees of Freedom of the X Chael Chiachi Huag, Viveck R. Cadambe, Syed A. Jafar Electrical Egieerig ad Computer Sciece Uiversity of Califoria Irvie Irvie, Califoria,
More information