ME290M, Spring 1999, homework #4

ME290M
Expert Systems in Mechanical Engineering

Spring 1999, T-Th 12:30-2:00 pm
1165 Etcheverry Hall, Course Control No. 56369 http://best.me.berkeley.edu/~aagogino/me290m/s99


[ Home | Info | Syllabus | Readings | Students | Homework | Resources | News | Chat]

Problem Set # 4

Due Date: Thursday, May 6, 1999

  1. Short Project Presentation (10 points)
  2. Be prepared to give a short project presentation to the class on May 6. Keep your presentation to 5 min. for a single person project and 10 min. for a team project. The idea is to share your progress to date with the class. The final project report is due by 5:00 pm on May 19. (I’d prefer to get some in earlier, if at all possible).

  3. Solve Problem 4.12 in the text. (20 points)
  4. Under conditional independence of E1 and E2, show that for a rule involving the conjunction of known evidence that:

     

  5. Solve Problem 5.2 in the text. (10 points)
  6. Prove that CF (H,E) + CF(H’,E) = 0

  7. Solve Problem 5.3 in the text. (20 points)
  8. Given rules

    IF E1 AND E2 AND E3

    THEN H(CF1)

     

    IF E4 OR E5

    THEN H(CF2)

    Where

    CF1 (E1,e)=1

    CF1 (E2,e)=0.5

    CF1 (E3,e)=0.3

    CF2 (E4,e)=0.7

    CF2 (E5,e)=0.2

    CF1 (H,E)=0.5

    CF2 (H,E)=0.9

    (a) Draw a tree illustrating how these rules support H.

    (b) Calculate the certanty factors CF1 (H,e) and CF2 (H,e).

    (c) Calculate CFCOMBINE (CF1 (H,e) and CF2 (H,e))

  9. Solve Problem 5.11 in the text. (10 points)

    (a) Define five linguistic values for the linguistic variable "Uncertainty".

    (b) Draw appropriate functions for these values and explain your choices.

    (c) Draw the fuzzy sets for

    Not TRUE

    More or Less TRUE

    Sort Of TRUE

    Pretty TRUE

    Rather TRUE

    TRUE

    Assuming TRUE is an S-function. What re the limts of TRUE? Explain.

  10. St. Petersburg Paradox Problem (10 points for part a, 20 points extra credit for parts b&c)
    You have an opportunity to invest $X in the following lottery: A biased coin is tossed. If it comes up heads (with probability "p") your money is doubled. If it comes up tails you get nothing. Your total wealth at the beginning of the game is $W and you can not borrow money (i.e., you can not have negative wealth). Answer the following questions.

    (a) Assume that you can only play this game once and you are an expected monetary value decision maker. How much would you pay for this lottery? How much would you pay if your utility function was of the form U(y) =ln(y+$W) where $W is your wealth at any time?

    Let the subscript "i" signify values at the beginning of lottery i. Let

    Wi = Total wealth after lottery i-1 and before lottery i. W1=wealth before any investments in the lotteries are made.

    xi = The total amount of money invested in lottery i. The wealth constraint restricts xi to be less than or equal to Wi.

    Ri= The portion of Wi to be invested in lottery i. Thus xi=RiWi.

    (b) (10 points extra credit) Assume that you can play this game twice and you are an expected value decision maker. How much would you invest in the first game and given the results of the first game how much would you invest in the second game? How much would you pay if our utility function was of the form in part (a)?

    (c) (10 points extra credit) Now assume that you can play this game as many times as you want given your total wealth constraint (i.e., if you have no money to play you can’t play). How much would you invest at each game given the results of the previous game? Show how to formulate this problem if you are an expected value monetary decision maker? Solve the problem in terms of $W and p if your utility function is of the logarithmic form in part (a)?

  11. Oil Wildcatters Problem. (20 points)

    Use Hugin (or any other Bayes’ Net software you prefer) to solve the Oil Wildcatters Problem. Use the numbers provided in the text on pp.183-186. Correct any mistakes that are in the textbook version.


[ Home | Info | Syllabus | Readings | Students | Homework | Resources | News | Chat]

Last updated: 29 April 99
Send Comments to: Alice Agogino, aagogino@me.berkeley.edu
Copyright © 1999 Alice Agogino; All Rights Reserved.