O'Reilly logo

Discrete Stochastic Processes and Optimal Filtering by Roger Ceschi, Jean-Claude Bertein

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

2.6. Exercises for Chapter 2

Exercise 2.1.

We are looking at a circular target D of center 0 and of radius R which is used for archery. The couple Z = (X, Y) represents the coordinates of the point of impact of the arrow on the target support; we assume that the r.v. X and Y are independent and following the same law N (0.4R2).

1) What is the probability that the arrow reach the target?

2) How many times must one fire the arrow In order for, with a probability ≥ 0.9, the target is reached at least once (we give imagesn 10 ≠ 2.305).

Let us assume that we fire 100 times at the target, calculate the probability that the target to reached at least 20 times.

Hint: use the central limit theorem.

Solution 2.1.

1) The r.v.s X and Y being independent, the density of probability of Z = (X, Y) is fZ (x, y) = fX (x) fY (y) = images and P (Z ∈ D) = images using a change from Cartesian to polar coordinates:

images

2) At each shot k, we associate a Bernoulli r.v. Ukb (p) defined by images

In n shots, the number of impacts is given ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required