The thickness of the retina changes during certain eye diseases. One way to measure retinal thickness is to shine a low-energy laser at the retina and record the reflections on film. Because of the optical properties of the eye, the reflections from the front surface of the retina and the back surface of the retina will appear as two lines on the film separated by a distance. The distance between the lines on the film is proportional to the thickness of the retina. Below are data taken from the scanned film. Fit two Gaussian-shaped curves of arbitrary height and location to these data and determine the distance between the centers of the two peaks. A Gaussian curve has the form
wherek and a are constants that relate to the peak height and the center of the peak, respectively.
Position | Light Intensity | Position | Light Intensity |
0.17 | 5.10 | 0.31 | 25.31 |
0.18 | 5.10 | 0.32 | 23.79 |
0.19 | 5.20 | 0.33 | 18.44 |
0.20 | 5.87 | 0.34 | 12.45 |
0.21 | 8.72 | 0.35 | 8.22 |
0.22 | 16.04 | 0.36 | 6.12 |
0.23 | 26.35 | 0.37 | 5.35 |
0.24 | 31.63 | 0.38 | 5.15 |
0.25 | 26.51 | 0.39 | 5.10 |
0.26 | 16.68 | 0.40 | 5.10 |
0.27 | 10.80 | 0.41 | 5.09 |
0.28 | 11.26 | 0.42 | 5.09 |
0.29 | 16.05 | 0.43 | 5.09 |
0.3 | 21.96 | 0.44 | 5.09 |

Want to see the full answer?
Check out a sample textbook solution
Chapter 20 Solutions
EBK NUMERICAL METHODS FOR ENGINEERS
Additional Engineering Textbook Solutions
University Calculus
Calculus: Early Transcendentals (2nd Edition)
Elementary Algebra For College Students (10th Edition)
Elementary & Intermediate Algebra
Mathematics for the Trades: A Guided Approach (11th Edition) (What's New in Trade Math)
Finite Mathematics for Business, Economics, Life Sciences and Social Sciences
- Theorem 1: A number n ∈ N is divisible by 3 if and only if when n is writtenin base 10 the sum of its digits is divisible by 3. As an example, 132 is divisible by 3 and 1 + 3 + 2 is divisible by 3.1. Prove Theorem 1 2. Using Theorem 1 construct an NFA over the alphabet Σ = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}which recognizes the language {w ∈ Σ^(∗)| w = 3k, k ∈ N}.arrow_forwardRecall the RSA encryption/decryption system. The following questions are based on RSA. Suppose n (=15) is the product of the two prime numbers 3 and 5.1. Find an encryption key e for for the pair (e, n)2. Find a decryption key d for for the pair (d, n)3. Given the plaintext message x = 3, find the ciphertext y = x^(e) (where x^e is the message x encoded with encryption key e)4. Given the ciphertext message y (which you found in previous part), Show that the original message x = 3 can be recovered using (d, n)arrow_forwardFind the sum of products expansion of the function F(x, y, z) = ¯x · y + x · z in two ways: (i) using a table; and (ii) using Boolean identities.arrow_forward
- Give both a machine-level description (i.e., step-by-step description in words) and a state-diagram for a Turing machine that accepts all words over the alphabet {a, b} where the number of a’s is greater than or equal to the number of b’s.arrow_forwardCompute (7^ (25)) mod 11 via the algorithm for modular exponentiation.arrow_forwardProve that the sum of the degrees in the interior angles of any convex polygon with n ≥ 3 sides is (n − 2) · 180. For the base case, you must prove that a triangle has angles summing to 180 degrees. You are permitted to use thefact when two parallel lines are cut by a transversal that corresponding angles are equal.arrow_forward
- Answer the following questions about rational and irrational numbers.1. Prove or disprove: If a and b are rational numbers then a^b is rational.2. Prove or disprove: If a and b are irrational numbers then a^b is irrational.arrow_forwardProve the following using structural induction: For any rooted binary tree T the number of vertices |T| in T satisfies the inequality |T| ≤ (2^ (height(T)+1)) − 1.arrow_forward(a) Prove that if p is a prime number and p|k^2 for some integer k then p|k.(b) Using Part (a), prove or disprove: √3 ∈ Q.arrow_forward
- Provide a context-free grammar for the language {a^ (i) b^ (j) c^ (k) | i, j, k ∈ N, i = j or i = k}. Briefly explain (no formal proof needed) why your context-free grammar is correct and show that it produces the word aaabbccc.arrow_forwardDo College Students With Part-Time Jobs Sleep Less? College students were surveyed about the number of hours they sleep each night.Group A = With part-time jobs | Group B = Without jobs Group A: 6, 5, 7, 6, 5Group B: 8, 7, 9, 8, 7 Instructions: State your hypothesis and perform a two-sample t-test with all formulas. Create histograms for each group. Label axes and add titles. Comment on the distribution shape (e.g., normal, skewed, etc.).Solve on pen and paperarrow_forwardThis is advanced mathematics question that need detailed solutionsarrow_forward
- Glencoe Algebra 1, Student Edition, 9780079039897...AlgebraISBN:9780079039897Author:CarterPublisher:McGraw HillAlgebra & Trigonometry with Analytic GeometryAlgebraISBN:9781133382119Author:SwokowskiPublisher:CengageAlgebra: Structure And Method, Book 1AlgebraISBN:9780395977224Author:Richard G. Brown, Mary P. Dolciani, Robert H. Sorgenfrey, William L. ColePublisher:McDougal Littell
- Holt Mcdougal Larson Pre-algebra: Student Edition...AlgebraISBN:9780547587776Author:HOLT MCDOUGALPublisher:HOLT MCDOUGALElementary Geometry For College Students, 7eGeometryISBN:9781337614085Author:Alexander, Daniel C.; Koeberlein, Geralyn M.Publisher:Cengage,Elementary Geometry for College StudentsGeometryISBN:9781285195698Author:Daniel C. Alexander, Geralyn M. KoeberleinPublisher:Cengage Learning




