Problem Set 2 Due Sept, 21
|
|
- Richard Ferguson
- 5 years ago
- Views:
Transcription
1 EE6: Rando Processes in Sstes Lecturer: Jean C. Walrand Proble Set Due Sept, Fall 6 GSI: Assane Guee This proble set essentiall reviews notions of conditional epectation, conditional distribution, and Jointl Gaussian rando variables. Not all eercises are to be turned in. Onl those with the sign are due on Thursda, Septeber at the beginning of the class. Although the reaining eercises are not graded, ou are encouraged to go through the. We will discuss soe of the eercises during discussion sections. Please feel free to point out errors and notions that need to be clarified. Conditional Epectation and distribution Eercise.. A lost tourist arrives at a point with 3 roads. The first road brings hi back to the sae point after hours of walk. The second road brings hi back to the sae point after 6 hours of travel. The last road leads to the cit after hours of walk. There are no signs on the roads. Assuing that the tourist chooses a road equall likel at all ties. What is the ean tie until the tourist arrives to the cit. This eercise uses conditional epectation. Let T the tie it takes to reach the cit, and D i the event the tourist chooses door i for i,, 3. To copute E[T ] we will condition on the door scalper picks at the first tie: E[T ] E[T D ]P (D + E[T D ]P (D + E[T D 3 ]P (D 3 3 (E[T D ] + E[T D ] + E[T D 3 ] ( + E[T ] E[T ] + 3 (. (. where in. we use the fact that after each return to the point, the tourist does not keep eor of its past chooses. Rearranging the ters in the last equation, we obtain Eercise.. E[T ] 9 -
2 EE6 Proble Set Due Sept, Fall 6 Eercise.3. On the da before the ea, each student entering the GSI s office will ask a question that will coe out for the ea with probabilit p. The nuber of student going to office hours that da is Poisson distributed with ean λ. What is the probabilit that the GSI does not have to answer an ea question? The ke idea in this eercise is again conditioning. Let N be the nuber of students who enter the GSI s office on that da (abe net Monda!, and let A be the event that the GSI does not have to answer an ea question. P (A n P (A N np (N n ( p n λn n! ep( λ n ep( λ (( pλ n n! n ep( λ ep(( pλ ep( λp Eercise.4. X, Y, and Z are jointl defined rando variables.. Show that E[X] E[E[X Y ]].. Show that E[Y Z] E[E[Y X, Z] Z]. E[X] E[E[X Y ]] First note E[X Y ] is a function of Y E[E[X Y ]] all integrals are finite E[X] - E[X ]f Y (d ( f X ( d f Y (d ( f X ( f Y (d d ( f X,Y (, d d f X (d
3 EE6 Proble Set Due Sept, Fall 6. E[Y Z] E[E[Y X, Z] Z] First note that E[Y X, Z] is a function of (X, Z. Now Eercise.5. Eercise.6. E[E[Y X, Z] Z] E[h(X, Y Z] f Y X,Z (, zd h(x, Z all integral finite E[Y Z] h(, Zf X Z ( Zd ( f Y X,Z (, Zd f X Z ( Zd ( f Y X,Z (, Zf X Z ( Zd d ( f Y,X Z (, Zd d f Y Z ( Zd Eercise.7. A scalper is considering buing tickets for the net cal football gae. The price of the tickets is $, and the scalper will sell the at $4. However, if he cant sell the at $4, he wont sell the at all. Given that the deand for tickets is a binoial rando variable with paraeters n and p /, how an tickets should he bu in order to aiize his epected profit? Let N be the nuber of tickets that the scalper bus, D be the deand. If S is the total nuber of tickets sold, we have S in(n, D and the scalper s profit R(N is: R(N 4S N Thus E[R(N] E[4S N] 4E[S] N. Note that here we have assued that N is know (we will var it later. So the onl rando ter is S (through D. Let s first copute E[S]. We consider that N because it is obvious that buing ore -3
4 EE6 Proble Set Due Sept, Fall 6 than the aiu deand cannot be optial. So we have: Thus E[S] E[D D N]P (D N + E[b D > N]P (D > N N ( ( ( ( i + N i i i in+ ( ( N ( ( i + N i i r(n E[R(N] 4 i in+ ( ( N ( i i i + N in+ ( N i Intuitivel, r(n increases in N and then decreases. Thus, to find when r(n is aial, we find the first value of N for which r(n + r(n. We will plot r(n and find N in the net version of this handout. Eercise.8.. Jointl Gaussian Rando Variables Eercise.9. Eercise.. Eercise.. John Gae uses his high-speed ode to pla network gaes over the internet. The ode transits zeros and ones b sending signals and +, respectivel. We assue that an given bit has probabilit p of being a zero. The telephone line introduces additive zero-ean Gaussian (noral noise with variance (so, the receiver at the other end receives a signal which is the su of the transitted signal and the channel noise. The value of the noise is assued to be independent of the encoded signal value.. Let a be a constant between and. The receiver at the other end decides that the signal (respectivel, + was transitted if the value it receives is less (respectivel, ore than a. Find a forula for the probabilit of aking an error.. Find a nuerical answer for the question of part (a assuing that p /5, a / and /4. Solution This eercise considered a detection proble. You will learn ore about detection in the net hoeworks. -4
5 EE6 Proble Set Due Sept, Fall 6 An error occurs whenever was transitted and the received signal is ore than a so + N > a, or whenever a + was sent and the received signal is less than a or + N < a where N is the noise. The probabilit of error thus given b: where P (error P (error send P (send + P (error send P (send P ( + N > ap + P ( + N < a( p P (N > a + p + P (N < a ( p P (N > a + p + ( P (N a ( p ( N P > a + ( N p + ( P a ( p ( ( a + a Q p + ( Q ( p ( ( a + a Q p + ( Q ( p ( ( a + a Q p + Q ( p Q( π ep ( z is the copleentar cuulative distribution function (CCDF of a standard noral rando variable (that ou will stud in the net hoework! There is no closed for for Q(, but it is a standard function that ou will be using quite often. We can plug in the values and look at a table to find the error. Will give the values in net version. Eercise.. The Cauch distribution has a for f X ( π( + < <. Show that this arises fro the ratio X \X where X and X are independent zeroean gaussian rando variable with variance.. Show that the oents of X do not eist. To show (, we will copute the pdf of the rando variable Z X X and observe that it -5
6 EE6 Proble Set Due Sept, Fall 6 has a Cauch distribution. We have: ( X F Z (z P (Z z P z X ( X P z f X ( d P (X < z f X ( d Using independence F X (z f X ( d Now we can copute the pdf of Z b taking the derivative of the last epression with respect to z. f Z (z F X (z f X ( d z Since the integral is finite (and everthing is nice! Wh? and z is not involved in the integration, we can safel interchange the order of the derivative and the integral to obtain: f Z (z f X (z f X ( d z π e (z e ( d π e +z d π e +z d π π [ + z + z e ] +z which is the pdf of a Cauch rando variable. To show that the oents do not eist, we will show that k. First observe that But k + for k > and + d li + T log( + T k + d does not eist for an -6
7 EE6 Proble Set Due Sept, Fall 6 Now Thus the functions Eercise.3. Eercise.4. Let k + d d, k + C st + + d k + are not integrable for all k. Hence the oents do not eist. Z Y + Y Z Y Z 3 Y Y for soe independent standard noral rando variables Y and Y.. Is Z (Z, Z, Z 3 T JG?. If es copute its correlation atri. Does it have an inverse? 3. Now ou are given a JG rando vector W with correlation atri: K W Find atri M such that W MV for JG V with detk V. Hint: Use eigenvalue decoposition Since the Z i s are linear cobinations of independent standard noral rando variables, the vector Z is JG. Its correlation atri is: K Z Since deterinant is zero, K Z does not adit an inverse. We will solve (3 for a general K W R n n and let ou verif our result using atlab or an other software. The idea of this eercise is to write an JG rando vector W, with K W, as a function of another JG rando Z that has non-singular correlation atri. If we succeed to do so we can use Z to copute things like conditional ean and pdf given Y, since we can alwas go -7
8 EE6 Proble Set Due Sept, Fall 6 fro Z to W. Using E.V.D, we can write K W QΛQ T for soe orthogonal Q, and diagonal atri ( Λ Λ for soe < n, Λ R, Λ >. Set M Q ( Λ Now we will solve W MZ for Z R. ( Λ W Q Z ( Λ Q T W Z B defining B : (Λ (Λ Q T W (Λ (Λ Q T W Z ( Λ Z I Z Q T, we have Z BW and W MZ. Also K Z E[BW W T B T ] (Λ Thus K Z, and also Z is JG. ( Λ Q T QΛQ T Q I Eercise.5. Let X and X be two independent standard noral rando variables and let Y X + X Y X X Y 3 3X + X Copute the conditional pdf f Y (Y,Y 3 (, 3 of Y given (Y, Y 3 and copute its ean. Hint: Argue that Y, Y, and Y 3 are jointl gaussian and show (Y, Y 3 T AZ and (Y, Z is JG, for soe atri A, and Z with det(k Z. Calculate f Y Z(, K Y,Z, and K Z Reark: In this eercise I did not choose good coefficients to ake the proble interesting. As I proised in discussion sections, I will present another eaple that illustrates better the point I wanted ou to get. -8
9 EE6 Proble Set Due Sept, Fall 6 Eercise.6. Gallager s note: Eercise. (a Note that there is a one-to-one apping between Y and Y 3 eaning that given Y 3 we can uniquel deduce Y. Thus the distribution of X reains the sae given that we have observed Y or Y 3. We can now use forula (.4 of the reader f X Y ( (we replace b 3 because we observe Y 3. f X Y 3( v ( ep ( ρ( / 3 v π( ρ ( ρ (b This part is a little harder because we no longer have the one-to-one apping. However we can appl the technique in part (a if we first condition on the sign of Y : f X Y ( v f X Y ( v, Y > P (Y > Y v + f X Y ( v, Y P (Y Y v The event {Y > } is independent of Y (convince ourself!, so P (Y > Y v P (Y > /. For v >, the events {Y v, Y > } and {Y v} are the sae, so f X Y ( v, Y > ( ep ( ρ( / v π( ρ ( ρ Siilarl, for v the events {Y v, Y } and {Y v} are the sae, so f X Y ( v, Y > ( ep ( + ρ( / v π( ρ ( ρ Thus f X Y ( v ( ep ( ( ρ( / v + ep ( ( + ρ( / v π( ρ ( ρ ( ρ Eercise.7. Gallager s note: Eercise.3 (a For Y AW, E[W Y T ] E[W W T A T ] E[W W T ]A T A T Thus in this case writing K [E[W Y T ] A T, we see that A K T cross-covariance. (b We proceed as in part (a and copute achieves the desired E[W Z T ] E[W W T ]A T K Z B T -9
10 EE6 Proble Set Due Sept, Fall 6 Thus B K T K Z will achieve the desired cross-correlation. (c Fro part (b, we know that we are looking for B such that K Z B T K. Assuing that B T [B... B ] and K [K... K ], let us rewrite K Z B T K in the following for K Z [B... B ] [K... K ] This can be decoposed into a set of linear sstes of equations K Z B i K i, i,...,. Now observe that K Z QΛQ T where Q is orthogonal and Λ has the for λ λ Λ r K Z B i K i can be written as ΛQ T B i Q T K i or in a ore detailed for: λ Q T B i Q T K i.. λ r Q T r B i Q T r K i Q T r+k i.. Q T nk i This tells us that K i, i,..., is orthogonal to Q j, j r +,..., n. In other words, each colun of K is orthogonal to all the eigenvectors that have a zero eigenvalue. This is equivalent to saing that each colun of K belongs V span(q,..., Q r. In conclusion, for B to satisf the desired cross-correlation atri, each colun of K ust belongs to the space spanned b the eigenvectors that correspond to the non-zero eigenvalues of K Z. Copleent.. Proof of the sufficient statistics propert In class we have stated that if g(y is a sufficient statistic for observation Y, then X is independent to Y given g(y. We give a proof of this fact below. The proof is given for X discrete but it can easil be generalized to the continuous case. Consider a detection proble where the observation Y is used to decide on the value of X. We assue that X lies in a discrete set I,..., n and its prior probabilit is given b P (X π(. The conditional distribution of the observation Y given X is given b -
11 EE6 Proble Set Due Sept, Fall 6 f Y X (. fact: If g(y is a sufficient statistic for Y, then X is independent to Y given g(y. Proof: To prove the fact, we will show that f Y (X,g(Y (, g( does not depend on X. First note that since g(y is a sufficient statistic, the conditional distribution of Y given X can be written in the for: f Y X ( F (g(, h( (.3 where F (. depends on Y onl through g(. and h(. is onl a function of. Now we have: f Y (X,g(Y (, g( g f (Y,X,g(Y (,, g( g f (X,g(Y (, g( g (.4 π(f Y X ( [g(g] π( f Y X ( [g( g] F (g(, h( [g(g] F (g(, h( [g( g] F (g, h( [g(g] F (g, h( [g( g] (.5 (.6 (.7 h( [g(g] h( [g( g] (.8 where we go fro.4 to.5 b observing that f (Y,X,g(Y (,, g( g is for an such that g( g and is otherwise equal to f Y X (. In.6, we have used.3 and canceled out the π( s. The ter F (. in the denoinator is not involved in the suation, so we take it out in.7 and it cancels out the corresponding ter in the nuerator and we see that f Y (X,g(Y ( does not depend on... Reake of Eerise.5 You have all noticed that eercise.5 was too obvious. In fact there was an error in the choice of the coefficients and the eercise did not illustrate what it was supposed to illustrate. We give here an eaple that illustrates better the notion. Eaple: Let (X, Y, Y T is a zero-ean jointl gaussian rando vector with correlation atri K Find E[X Y]. In this eaple we see that K Y and we cannot appl the forula given in class E[X Y] K XY K Y Y -
12 EE6 Proble Set Due Sept, Fall 6 The hint in eercise (.5 was to find Z such that Y AZ, (X, Z is JG, and K Z. In eercise (.4 part (3, we have seen one wa to copute A and Z. Here we will give a less foral procedure. First notice that the second row of K Y is a ultiple of the first row. Let s stud the rando variable T Y 3Y. E[T ] E[Y ] 3E[Y ] V ar(t E[(Y 3Y ] E[Y ] + 9E[Y ] 6E[Y Y ] T has zero ean and zero variance thus it is deterinistic and equal to. So we have that Y 3Y 3. Hence Y carries all the inforation in Y (Y, Y (or is a sufficient statistic. Thus E[X Y] E[X Y ] It is not hard to convince ourself that (X, Y is JG and K Y Y. Thus E[X Y ] XY Y Y 3 Y -
Solutions of some selected problems of Homework 4
Solutions of soe selected probles of Hoework 4 Sangchul Lee May 7, 2018 Proble 1 Let there be light A professor has two light bulbs in his garage. When both are burned out, they are replaced, and the next
More informationFeature Extraction Techniques
Feature Extraction Techniques Unsupervised Learning II Feature Extraction Unsupervised ethods can also be used to find features which can be useful for categorization. There are unsupervised ethods that
More informationProblem Set 3 Due Oct, 5
EE6: Random Processes in Systems Lecturer: Jean C. Walrand Problem Set 3 Due Oct, 5 Fall 6 GSI: Assane Gueye This problem set essentially reviews detection theory. Not all eercises are to be turned in.
More informationBlock designs and statistics
Bloc designs and statistics Notes for Math 447 May 3, 2011 The ain paraeters of a bloc design are nuber of varieties v, bloc size, nuber of blocs b. A design is built on a set of v eleents. Each eleent
More informationRandom Variables and Densities
Rando Variables and Densities Review: Probabilit and Statistics Sa Roweis Rando variables X represents outcoes or states of world. Instantiations of variables usuall in lower case: We will write p() to
More informationList Scheduling and LPT Oliver Braun (09/05/2017)
List Scheduling and LPT Oliver Braun (09/05/207) We investigate the classical scheduling proble P ax where a set of n independent jobs has to be processed on 2 parallel and identical processors (achines)
More informationPhysics 18 Spring 2011 Homework 3 - Solutions Wednesday February 2, 2011
Phsics 18 Spring 2011 Hoework 3 - s Wednesda Februar 2, 2011 Make sure our nae is on our hoework, and please bo our final answer. Because we will be giving partial credit, be sure to attept all the probles,
More informationEstimating Parameters for a Gaussian pdf
Pattern Recognition and achine Learning Jaes L. Crowley ENSIAG 3 IS First Seester 00/0 Lesson 5 7 Noveber 00 Contents Estiating Paraeters for a Gaussian pdf Notation... The Pattern Recognition Proble...3
More information13.2 Fully Polynomial Randomized Approximation Scheme for Permanent of Random 0-1 Matrices
CS71 Randoness & Coputation Spring 018 Instructor: Alistair Sinclair Lecture 13: February 7 Disclaier: These notes have not been subjected to the usual scrutiny accorded to foral publications. They ay
More informationSimple Expressions for Success Run Distributions in Bernoulli Trials
Siple Epressions for Success Run Distributions in Bernoulli Trials Marco Muselli Istituto per i Circuiti Elettronici Consiglio Nazionale delle Ricerche via De Marini, 6-16149 Genova, Ital Eail: uselli@ice.ge.cnr.it
More informationThe Weierstrass Approximation Theorem
36 The Weierstrass Approxiation Theore Recall that the fundaental idea underlying the construction of the real nubers is approxiation by the sipler rational nubers. Firstly, nubers are often deterined
More informationSlide10. Haykin Chapter 8: Principal Components Analysis. Motivation. Principal Component Analysis: Variance Probe
Slide10 Motivation Haykin Chapter 8: Principal Coponents Analysis 1.6 1.4 1.2 1 0.8 cloud.dat 0.6 CPSC 636-600 Instructor: Yoonsuck Choe Spring 2015 0.4 0.2 0 0 0.2 0.4 0.6 0.8 1 1.2 1.4 1.6 How can we
More information3.3 Variational Characterization of Singular Values
3.3. Variational Characterization of Singular Values 61 3.3 Variational Characterization of Singular Values Since the singular values are square roots of the eigenvalues of the Heritian atrices A A and
More informationFinite fields. and we ve used it in various examples and homework problems. In these notes I will introduce more finite fields
Finite fields I talked in class about the field with two eleents F 2 = {, } and we ve used it in various eaples and hoework probles. In these notes I will introduce ore finite fields F p = {,,...,p } for
More informationThe Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Parameters
journal of ultivariate analysis 58, 96106 (1996) article no. 0041 The Distribution of the Covariance Matrix for a Subset of Elliptical Distributions with Extension to Two Kurtosis Paraeters H. S. Steyn
More informationCOS 424: Interacting with Data. Written Exercises
COS 424: Interacting with Data Hoework #4 Spring 2007 Regression Due: Wednesday, April 18 Written Exercises See the course website for iportant inforation about collaboration and late policies, as well
More informationDerivative at a point
Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Derivative at a point Wat you need to know already: Te concept of liit and basic etods for coputing liits. Wat you can
More informationLaurie s Notes. Overview of Section 7.5
Laurie s Notes Overview of Section 7. Introduction Students have developed a repertoire of equation-solving techniques throughout their study of algebra. In this lesson, additional techniques are presented.
More informationRandom Process Examples 1/23
ando Process Eaples /3 E. #: D-T White Noise Let ] be a sequence of V s where each V ] in the sequence is uncorrelated with all the others: E{ ] ] } 0 for This DEFINES a DT White Noise Also called Uncorrelated
More informationMath 1600A Lecture 3, Section 002
Math 1600 Lecture 3 1 of 5 Math 1600A Lecture 3, Section 002 Announceents: More texts, solutions anuals and packages coing soon. Read Section 1.3 for next class. Work through recoended hoework questions.
More informationChapter 6 1-D Continuous Groups
Chapter 6 1-D Continuous Groups Continuous groups consist of group eleents labelled by one or ore continuous variables, say a 1, a 2,, a r, where each variable has a well- defined range. This chapter explores:
More informationTopic 5a Introduction to Curve Fitting & Linear Regression
/7/08 Course Instructor Dr. Rayond C. Rup Oice: A 337 Phone: (95) 747 6958 E ail: rcrup@utep.edu opic 5a Introduction to Curve Fitting & Linear Regression EE 4386/530 Coputational ethods in EE Outline
More informationPhysics 207: Lecture 26. Announcements. Make-up labs are this week Final hwk assigned this week, final quiz next week.
Torque due to gravit Rotation Recap Phsics 07: ecture 6 Announceents Make-up labs are this week Final hwk assigned this week, final quiz net week Toda s Agenda Statics Car on a Hill Static Equilibriu Equations
More informationMA304 Differential Geometry
MA304 Differential Geoetry Hoework 4 solutions Spring 018 6% of the final ark 1. The paraeterised curve αt = t cosh t for t R is called the catenary. Find the curvature of αt. Solution. Fro hoework question
More informationEFFECTIVE MODAL MASS & MODAL PARTICIPATION FACTORS Revision I
EFFECTIVE MODA MASS & MODA PARTICIPATION FACTORS Revision I B To Irvine Eail: to@vibrationdata.co Deceber, 5 Introduction The effective odal ass provides a ethod for judging the significance of a vibration
More informationA remark on a success rate model for DPA and CPA
A reark on a success rate odel for DPA and CPA A. Wieers, BSI Version 0.5 andreas.wieers@bsi.bund.de Septeber 5, 2018 Abstract The success rate is the ost coon evaluation etric for easuring the perforance
More information11.4 Polar Coordinates
11. Polar Coordinates 917 11. Polar Coordinates In Section 1.1, we introduced the Cartesian coordinates of a point in the plane as a means of assigning ordered pairs of numbers to points in the plane.
More informationComputability and Complexity Random Sources. Computability and Complexity Andrei Bulatov
Coputabilit and Copleit 29- Rando Sources Coputabilit and Copleit Andrei Bulatov Coputabilit and Copleit 29-2 Rando Choices We have seen several probabilistic algoriths, that is algoriths that ake soe
More informationCSE525: Randomized Algorithms and Probabilistic Analysis May 16, Lecture 13
CSE55: Randoied Algoriths and obabilistic Analysis May 6, Lecture Lecturer: Anna Karlin Scribe: Noah Siegel, Jonathan Shi Rando walks and Markov chains This lecture discusses Markov chains, which capture
More informationPoisson processes and their properties
Poisson processes and their properties Poisson processes. collection {N(t) : t [, )} of rando variable indexed by tie t is called a continuous-tie stochastic process, Furtherore, we call N(t) a Poisson
More informationPHYS 1443 Section 003 Lecture #22
PHYS 443 Section 003 Lecture # Monda, Nov. 4, 003. Siple Bloc-Spring Sste. Energ of the Siple Haronic Oscillator 3. Pendulu Siple Pendulu Phsical Pendulu orsion Pendulu 4. Siple Haronic Motion and Unifor
More informationLecture 9 November 23, 2015
CSC244: Discrepancy Theory in Coputer Science Fall 25 Aleksandar Nikolov Lecture 9 Noveber 23, 25 Scribe: Nick Spooner Properties of γ 2 Recall that γ 2 (A) is defined for A R n as follows: γ 2 (A) = in{r(u)
More informationLESSON 35: EIGENVALUES AND EIGENVECTORS APRIL 21, (1) We might also write v as v. Both notations refer to a vector.
LESSON 5: EIGENVALUES AND EIGENVECTORS APRIL 2, 27 In this contet, a vector is a column matri E Note 2 v 2, v 4 5 6 () We might also write v as v Both notations refer to a vector (2) A vector can be man
More informationLecture 13 Eigenvalue Problems
Lecture 13 Eigenvalue Probles MIT 18.335J / 6.337J Introduction to Nuerical Methods Per-Olof Persson October 24, 2006 1 The Eigenvalue Decoposition Eigenvalue proble for atrix A: Ax = λx with eigenvalues
More informationNon-Parametric Non-Line-of-Sight Identification 1
Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,
More informationGaussians. Andrew W. Moore Professor School of Computer Science Carnegie Mellon University.
Note to other teachers and users of these slides. Andrew would be delighted if you found this source aterial useful in giing your own lectures. Feel free to use these slides erbati, or to odify the to
More informationarxiv: v1 [math.nt] 14 Sep 2014
ROTATION REMAINDERS P. JAMESON GRABER, WASHINGTON AND LEE UNIVERSITY 08 arxiv:1409.411v1 [ath.nt] 14 Sep 014 Abstract. We study properties of an array of nubers, called the triangle, in which each row
More informationLean Walsh Transform
Lean Walsh Transfor Edo Liberty 5th March 007 inforal intro We show an orthogonal atrix A of size d log 4 3 d (α = log 4 3) which is applicable in tie O(d). By applying a rando sign change atrix S to the
More informationTABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS. By William W. Chen
TABLE FOR UPPER PERCENTAGE POINTS OF THE LARGEST ROOT OF A DETERMINANTAL EQUATION WITH FIVE ROOTS By Willia W. Chen The distribution of the non-null characteristic roots of a atri derived fro saple observations
More informationRandom Process Review
Rando Process Review Consider a rando process t, and take k saples. For siplicity, we will set k. However it should ean any nuber of saples. t () t x t, t, t We have a rando vector t, t, t. If we find
More informationPolygonal Designs: Existence and Construction
Polygonal Designs: Existence and Construction John Hegean Departent of Matheatics, Stanford University, Stanford, CA 9405 Jeff Langford Departent of Matheatics, Drake University, Des Moines, IA 5011 G
More informationApproximation in Stochastic Scheduling: The Power of LP-Based Priority Policies
Approxiation in Stochastic Scheduling: The Power of -Based Priority Policies Rolf Möhring, Andreas Schulz, Marc Uetz Setting (A P p stoch, r E( w and (B P p stoch E( w We will assue that the processing
More informationPhysics 139B Solutions to Homework Set 3 Fall 2009
Physics 139B Solutions to Hoework Set 3 Fall 009 1. Consider a particle of ass attached to a rigid assless rod of fixed length R whose other end is fixed at the origin. The rod is free to rotate about
More information. The univariate situation. It is well-known for a long tie that denoinators of Pade approxiants can be considered as orthogonal polynoials with respe
PROPERTIES OF MULTIVARIATE HOMOGENEOUS ORTHOGONAL POLYNOMIALS Brahi Benouahane y Annie Cuyt? Keywords Abstract It is well-known that the denoinators of Pade approxiants can be considered as orthogonal
More informationEstimation of the Mean of the Exponential Distribution Using Maximum Ranked Set Sampling with Unequal Samples
Open Journal of Statistics, 4, 4, 64-649 Published Online Septeber 4 in SciRes http//wwwscirporg/ournal/os http//ddoiorg/436/os4486 Estiation of the Mean of the Eponential Distribution Using Maiu Ranked
More informationA note on the multiplication of sparse matrices
Cent. Eur. J. Cop. Sci. 41) 2014 1-11 DOI: 10.2478/s13537-014-0201-x Central European Journal of Coputer Science A note on the ultiplication of sparse atrices Research Article Keivan Borna 12, Sohrab Aboozarkhani
More informationThe linear sampling method and the MUSIC algorithm
INSTITUTE OF PHYSICS PUBLISHING INVERSE PROBLEMS Inverse Probles 17 (2001) 591 595 www.iop.org/journals/ip PII: S0266-5611(01)16989-3 The linear sapling ethod and the MUSIC algorith Margaret Cheney Departent
More informationMulti-Scale/Multi-Resolution: Wavelet Transform
Multi-Scale/Multi-Resolution: Wavelet Transfor Proble with Fourier Fourier analysis -- breaks down a signal into constituent sinusoids of different frequencies. A serious drawback in transforing to the
More information5. Zeros. We deduce that the graph crosses the x-axis at the points x = 0, 1, 2 and 4, and nowhere else. And that s exactly what we see in the graph.
. Zeros Eample 1. At the right we have drawn the graph of the polnomial = ( 1) ( 2) ( 4). Argue that the form of the algebraic formula allows ou to see right awa where the graph is above the -ais, where
More informationa a a a a a a m a b a b
Algebra / Trig Final Exa Study Guide (Fall Seester) Moncada/Dunphy Inforation About the Final Exa The final exa is cuulative, covering Appendix A (A.1-A.5) and Chapter 1. All probles will be ultiple choice
More informationDeflation of the I-O Series Some Technical Aspects. Giorgio Rampa University of Genoa April 2007
Deflation of the I-O Series 1959-2. Soe Technical Aspects Giorgio Rapa University of Genoa g.rapa@unige.it April 27 1. Introduction The nuber of sectors is 42 for the period 1965-2 and 38 for the initial
More informationThe Transactional Nature of Quantum Information
The Transactional Nature of Quantu Inforation Subhash Kak Departent of Coputer Science Oklahoa State University Stillwater, OK 7478 ABSTRACT Inforation, in its counications sense, is a transactional property.
More informationHandout 7. and Pr [M(x) = χ L (x) M(x) =? ] = 1.
Notes on Coplexity Theory Last updated: October, 2005 Jonathan Katz Handout 7 1 More on Randoized Coplexity Classes Reinder: so far we have seen RP,coRP, and BPP. We introduce two ore tie-bounded randoized
More informationPhysics Chapter 6. Momentum and Its Conservation
Physics Chapter 6 Moentu and Its Conservation Linear Moentu The velocity and ass of an object deterine what is needed to change its otion. Linear Moentu (ρ) is the product of ass and velocity ρ =v Unit
More informationLeast Squares Fitting of Data
Least Squares Fitting of Data David Eberly, Geoetric Tools, Redond WA 98052 https://www.geoetrictools.co/ This work is licensed under the Creative Coons Attribution 4.0 International License. To view a
More informationALGEBRA REVIEW. MULTINOMIAL An algebraic expression consisting of more than one term.
Page 1 of 6 ALGEBRAIC EXPRESSION A cobination of ordinary nubers, letter sybols, variables, grouping sybols and operation sybols. Nubers reain fixed in value and are referred to as constants. Letter sybols
More informationEigenvectors and Eigenvalues 1
Ma 2015 page 1 Eigenvectors and Eigenvalues 1 In this handout, we will eplore eigenvectors and eigenvalues. We will begin with an eploration, then provide some direct eplanation and worked eamples, and
More informationAnalysis of Polynomial & Rational Functions ( summary )
Analysis of Polynoial & Rational Functions ( suary ) The standard for of a polynoial function is ( ) where each of the nubers are called the coefficients. The polynoial of is said to have degree n, where
More informationA Simple Regression Problem
A Siple Regression Proble R. M. Castro March 23, 2 In this brief note a siple regression proble will be introduced, illustrating clearly the bias-variance tradeoff. Let Y i f(x i ) + W i, i,..., n, where
More informationProbability Distributions
Probability Distributions In Chapter, we ephasized the central role played by probability theory in the solution of pattern recognition probles. We turn now to an exploration of soe particular exaples
More informationCHAPTER 5. Jointly Probability Mass Function for Two Discrete Distributed Random Variables:
CHAPTER 5 Jointl Distributed Random Variable There are some situations that experiment contains more than one variable and researcher interested in to stud joint behavior of several variables at the same
More informationSOLVING LITERAL EQUATIONS. Bundle 1: Safety & Process Skills
SOLVING LITERAL EQUATIONS Bundle 1: Safety & Process Skills Solving Literal Equations An equation is a atheatical sentence with an equal sign. The solution of an equation is a value for a variable that
More informationBoosting with log-loss
Boosting with log-loss Marco Cusuano-Towner Septeber 2, 202 The proble Suppose we have data exaples {x i, y i ) i =... } for a two-class proble with y i {, }. Let F x) be the predictor function with the
More informationAN APPLICATION OF CUBIC B-SPLINE FINITE ELEMENT METHOD FOR THE BURGERS EQUATION
Aksan, E..: An Applıcatıon of Cubıc B-Splıne Fınıte Eleent Method for... THERMAL SCIECE: Year 8, Vol., Suppl., pp. S95-S S95 A APPLICATIO OF CBIC B-SPLIE FIITE ELEMET METHOD FOR THE BRGERS EQATIO by Eine
More informationSUR LE CALCUL DES PROBABILITÉS
MÉMOIRE SUR LE CALCUL DES PROBABILITÉS M. le MARQUIS DE CONDORCET Histoire de l Acadéie des Sciences des Paris, 783 Parts 4 & 5, pp. 539559 FOURTH PART Reflections on the ethod to deterine the Probability
More informationStatistics and Probability Letters
Statistics and Probability Letters 79 2009 223 233 Contents lists available at ScienceDirect Statistics and Probability Letters journal hoepage: www.elsevier.co/locate/stapro A CLT for a one-diensional
More informationPhysically Based Modeling CS Notes Spring 1997 Particle Collision and Contact
Physically Based Modeling CS 15-863 Notes Spring 1997 Particle Collision and Contact 1 Collisions with Springs Suppose we wanted to ipleent a particle siulator with a floor : a solid horizontal plane which
More informationPhys101 Lectures 13, 14 Momentum and Collisions
Phs0 Lectures 3, 4 Moentu and ollisions Ke points: Moentu and ipulse ondition for conservation of oentu and wh How to solve collision probles entre of ass Ref: 7-,,3,4,5,6,7,8,9,0. Page Moentu is a vector:
More informationProc. of the IEEE/OES Seventh Working Conference on Current Measurement Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES
Proc. of the IEEE/OES Seventh Working Conference on Current Measureent Technology UNCERTAINTIES IN SEASONDE CURRENT VELOCITIES Belinda Lipa Codar Ocean Sensors 15 La Sandra Way, Portola Valley, CA 98 blipa@pogo.co
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 17th February 2010 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion
More informationProbability and Stochastic Processes: A Friendly Introduction for Electrical and Computer Engineers Roy D. Yates and David J.
Probability and Stochastic Processes: A Friendly Introduction for Electrical and oputer Engineers Roy D. Yates and David J. Goodan Proble Solutions : Yates and Goodan,1..3 1.3.1 1.4.6 1.4.7 1.4.8 1..6
More informationPhysics 201 Lecture 29
Phsics 1 ecture 9 Goals ecture 9 v Describe oscillator otion in a siple pendulu v Describe oscillator otion with torques v Introduce daping in SHM v Discuss resonance v Final Ea Details l Sunda, Ma 13th
More informationSupplementary to Learning Discriminative Bayesian Networks from High-dimensional Continuous Neuroimaging Data
Suppleentary to Learning Discriinative Bayesian Networks fro High-diensional Continuous Neuroiaging Data Luping Zhou, Lei Wang, Lingqiao Liu, Philip Ogunbona, and Dinggang Shen Proposition. Given a sparse
More informationLecture 21 Principle of Inclusion and Exclusion
Lecture 21 Principle of Inclusion and Exclusion Holden Lee and Yoni Miller 5/6/11 1 Introduction and first exaples We start off with an exaple Exaple 11: At Sunnydale High School there are 28 students
More informationOptimal Jamming Over Additive Noise: Vector Source-Channel Case
Fifty-first Annual Allerton Conference Allerton House, UIUC, Illinois, USA October 2-3, 2013 Optial Jaing Over Additive Noise: Vector Source-Channel Case Erah Akyol and Kenneth Rose Abstract This paper
More informationIntroduction to Robotics (CS223A) (Winter 2006/2007) Homework #5 solutions
Introduction to Robotics (CS3A) Handout (Winter 6/7) Hoework #5 solutions. (a) Derive a forula that transfors an inertia tensor given in soe frae {C} into a new frae {A}. The frae {A} can differ fro frae
More informationApplying Genetic Algorithms to Solve the Fuzzy Optimal Profit Problem
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 8, 563-58 () Applying Genetic Algoriths to Solve the Fuzzy Optial Profit Proble FENG-TSE LIN AND JING-SHING YAO Departent of Applied Matheatics Chinese Culture
More informationKinetic Theory of Gases: Elementary Ideas
Kinetic Theory of Gases: Eleentary Ideas 9th February 011 1 Kinetic Theory: A Discussion Based on a Siplified iew of the Motion of Gases 1.1 Pressure: Consul Engel and Reid Ch. 33.1) for a discussion of
More informationProblem Set 7 Due March, 22
EE16: Probability and Random Processes SP 07 Problem Set 7 Due March, Lecturer: Jean C. Walrand GSI: Daniel Preda, Assane Gueye Problem 7.1. Let u and v be independent, standard normal random variables
More informationMechanics Physics 151
Mechanics Physics 5 Lecture Oscillations (Chapter 6) What We Did Last Tie Analyzed the otion of a heavy top Reduced into -diensional proble of θ Qualitative behavior Precession + nutation Initial condition
More informationElectromagnetics I Exam No. 3 December 1, 2003 Solution
Electroagnetics Ea No. 3 Deceber 1, 2003 Solution Please read the ea carefull. Solve the folloing 4 probles. Each proble is 1/4 of the grade. To receive full credit, ou ust sho all ork. f cannot understand
More informationA Simplified Analytical Approach for Efficiency Evaluation of the Weaving Machines with Automatic Filling Repair
Proceedings of the 6th SEAS International Conference on Siulation, Modelling and Optiization, Lisbon, Portugal, Septeber -4, 006 0 A Siplified Analytical Approach for Efficiency Evaluation of the eaving
More informationQuantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search
Quantu algoriths (CO 781, Winter 2008) Prof Andrew Childs, University of Waterloo LECTURE 15: Unstructured search and spatial search ow we begin to discuss applications of quantu walks to search algoriths
More informationPHY 171. Lecture 14. (February 16, 2012)
PHY 171 Lecture 14 (February 16, 212) In the last lecture, we looked at a quantitative connection between acroscopic and icroscopic quantities by deriving an expression for pressure based on the assuptions
More informationlecture 36: Linear Multistep Mehods: Zero Stability
95 lecture 36: Linear Multistep Mehods: Zero Stability 5.6 Linear ultistep ethods: zero stability Does consistency iply convergence for linear ultistep ethods? This is always the case for one-step ethods,
More information0.24 adults 2. (c) Prove that, regardless of the possible values of and, the covariance between X and Y is equal to zero. Show all work.
1 A socioeconomic stud analzes two discrete random variables in a certain population of households = number of adult residents and = number of child residents It is found that their joint probabilit mass
More informationPhysics 221A: HW3 solutions
Physics 22A: HW3 solutions October 22, 202. a) It will help to start things off by doing soe gaussian integrals. Let x be a real vector of length, and let s copute dxe 2 xt Ax, where A is soe real atrix.
More informationProblems and results for the ninth week Mathematics A3 for Civil Engineering students
Problems and results for the ninth week Mathematics A3 for Civil Engineering students. Production line I of a factor works 0% of time, while production line II works 70% of time, independentl of each other.
More informationM098 Carson Elementary and Intermediate Algebra 3e Section 11.1
M098 Carson Eleentary and Interediate Algebra e Section 11.1 Objectives 1. Use the square root principle to solve quadratic equations.. Solve quadratic equations by copleting the square. Vocabulary Pri
More informationAN EFFICIENT CLASS OF CHAIN ESTIMATORS OF POPULATION VARIANCE UNDER SUB-SAMPLING SCHEME
J. Japan Statist. Soc. Vol. 35 No. 005 73 86 AN EFFICIENT CLASS OF CHAIN ESTIMATORS OF POPULATION VARIANCE UNDER SUB-SAMPLING SCHEME H. S. Jhajj*, M. K. Shara* and Lovleen Kuar Grover** For estiating the
More informationElastic Force: A Force Balance: Elastic & Gravitational Force: Force Example: Determining Spring Constant. Some Other Forces
Energy Balance, Units & Proble Solving: Mechanical Energy Balance ABET Course Outcoes: 1. solve and docuent the solution of probles involving eleents or configurations not previously encountered (e) (e.g.
More information}, (n 0) be a finite irreducible, discrete time MC. Let S = {1, 2,, m} be its state space. Let P = [p ij. ] be the transition matrix of the MC.
Abstract Questions are posed regarding the influence that the colun sus of the transition probabilities of a stochastic atrix (with row sus all one) have on the stationary distribution, the ean first passage
More informationDetection and Estimation Theory
ESE 54 Detection and Estiation Theory Joseph A. O Sullivan Sauel C. Sachs Professor Electronic Systes and Signals Research Laboratory Electrical and Systes Engineering Washington University 11 Urbauer
More informationA note on the realignment criterion
A note on the realignent criterion Chi-Kwong Li 1, Yiu-Tung Poon and Nung-Sing Sze 3 1 Departent of Matheatics, College of Willia & Mary, Williasburg, VA 3185, USA Departent of Matheatics, Iowa State University,
More informationacceleration of 2.4 m/s. (b) Now, we have two rubber bands (force 2F) pulling two glued objects (mass 2m). Using F ma, 2.0 furlongs x 2.0 s 2 4.
5.. 5.6. Model: An object s acceleration is linearl proportional to the net force. Solve: (a) One rubber band produces a force F, two rubber bands produce a force F, and so on. Because F a and two rubber
More informationPHY307F/407F - Computational Physics Background Material for Expt. 3 - Heat Equation David Harrison
INTRODUCTION PHY37F/47F - Coputational Physics Background Material for Expt 3 - Heat Equation David Harrison In the Pendulu Experient, we studied the Runge-Kutta algorith for solving ordinary differential
More information1 Generalization bounds based on Rademacher complexity
COS 5: Theoretical Machine Learning Lecturer: Rob Schapire Lecture #0 Scribe: Suqi Liu March 07, 08 Last tie we started proving this very general result about how quickly the epirical average converges
More informationProblem Set 2. Chapter 1 Numerical:
Chapter 1 Nuerical: roble Set 16. The atoic radius of xenon is 18 p. Is that consistent with its b paraeter of 5.15 1 - L/ol? Hint: what is the volue of a ole of xenon atos and how does that copare to
More informationŞtefan ŞTEFĂNESCU * is the minimum global value for the function h (x)
7Applying Nelder Mead s Optiization Algorith APPLYING NELDER MEAD S OPTIMIZATION ALGORITHM FOR MULTIPLE GLOBAL MINIMA Abstract Ştefan ŞTEFĂNESCU * The iterative deterinistic optiization ethod could not
More informationProblem Set 1 Sept, 14
EE6: Random Processes in Systems Lecturer: Jean C. Walrand Problem Set Sept, 4 Fall 06 GSI: Assane Gueye This problem set essentially reviews notions of conditional expectation, conditional distribution,
More information