Instructions: Please provide typed answers in a observe doc or in pdf. Please attain no longer provide handwritten answers. If you occur to could well maybe absorb got gentle program to compute the acknowledge, please provide the code within the closing bundle with detailed feedback. Right here is an particular individual project, so no collaboration is allowed. Count on 1. (5 pts) Right here’s a game of identifying three forms of tea, inexperienced, oolong and white. 60% of inexperienced teas I kind will kind inexperienced to me, and 30% of inexperienced teas I\u2019llmisidentify as oolong and 10% as white. 70% of white teas I kind will kind white to me, and 20% will seemingly be misidentifiedas oolong and 10% as inexperienced. 80% of oolong teas I\u2019los angeles it will seemingly be name as oolong, and 10% will seemingly be misidentified as white and 10% will seemingly be misidentified as inexperienced. One week, I tasted a tea, and it tasted oolong. Are you in a location to compute the probability that it is a long way certainly oolong? If certain, what’s the probability? If no longer, hang the wanted assumptions to compute the probability? Camouflage your acknowledge intimately. Count on 2. (5 facets) There could be a day out being deliberate for 400 folks by the usage of a transportation company. The transportation company has 10 effectively-organized buses, every of which is engrossing to defend 40 folks and 8 small buses, every of which is engrossing to defend 30 folks. The condo cost for a effectively-organized bus is 750 and for a small bus is 500. If there are handiest 13 drivers available , calculate what number of buses of every style ought to be gentle for the day out with the least imaginable cost? Present the fundamental facets of the come employed and show if there are any drawbacks to the come? Count on 3. (10 pts) Within the next demand we grab into consideration a perception network connected to COVID-19. Age and Possibility components impact whether or no longer a individual has COVID. We can diagnose whether or no longer a individual has COVID the usage of extra than one ways: (i) Lack of kind or scent (ii) Cough (iii) Thru testing Write My Assignment Hire a Knowledgeable Essay & Assignment Creator for winding up your Academic Assessments Native Singapore Writers Personnel 100% Plagiarism-Free Essay Perfect Pleasure Price Free Revision On-Time Supply Within the linked file (simulated_data.csv), we give a simulated dataset of observations. We make exercise of the next convention for the values assigned to different variables. 1 Age (dimensionality 3) a. < 15 yrs: 0 b. 15 yrs \u2013 49 yrs: 1 c. > 49 yrs: 2 2. Possibility components (dimensionality 3) a. Low: 0 b. Medium: 1 c. High: 2 3. Covid Bellow (dimensionality 4) a. None: 0 b. Asymptomatic: 1 c. Gentle: 2 d. Excessive: 3 4. Cough (dimensionality 2) a. No: 0 b. Yes: 1 5. Lack of scent or kind (dimensionality 2) a. No: 0 b. Yes: 1 6. Tested outcome (dimensionality 3) a. Adverse: 0 b. Sure: 1 c. NA: 2 Buy Customized Solution of This Evaluate & Elevate Your Grades Salvage A Free Quote Solution the next questions: (i) What are the local probability tables for the nodes in perception network confirmed below? Please show how you computed these tables. (ii) What is P(Possibility Components | Lack of Style or Scent = 1, Cough = 0)? Use probability weighting to compute the acknowledge by producing 100000 samples. SMU Classification: Restricted (iii) What is the most attainable motive at the assist of somebody who has cough and is 35 years of age? Present the code with detailed feedback explaining what every half of the code does. Count on 4. (10 pts) In this disaster, we grab into consideration a local of blocks of various sizes, shapes, and colors. The blocks will also be stacked into one or extra piles, presumably with some constraints (relying, e.g., on their dimension); the aim is to attain a goal space of piles ranging from a given initial configuration, by animated one block at a time, either to the desk or atop every other pile of blocks, and handiest whether it is a long way no longer below every other block. Take into story a straightforward model of this disaster, in which there are 5 blocks with identical shape and dimension, in different colors with labels A, B, C. Please mask the next: Relative location of the piles would no longer matter (Configuration 1 and Configuration 2 are the identical). Every block is either on the desk (there usually are no longer any constraints on preference of piles) or atop any other block. Most effective blocks at the high of the most original piles will also be moved, and ought to also be positioned handiest on the desk or atop every other pile. Placing a block on every other block charges 1, without reference to the block mark or color. However, inserting blocks on the desk charges otherwise (Orange block charges 2, Grey block charges 3, Yellow block charges 1, Inexperienced block charges 4) . The target is to circulate to a given purpose configuration (e.g., Configuration 3) from starting configuration (e.g., Configuration 1) with minimum cost. 1. Formulate the above model of the block\u2019s world as a search disaster, by exactly defining the instruct location, the initial instruct, the aim instruct, the space of imaginable operators and the course cost. 2. Please provide an admissible heuristic goal (that’s no longer a zero for every search node) for this search disaster. Camouflage how the A* search technique expands the principle three nodes of the hunt tree, keeping off repeated states. When drawing the hunt tree you ought to clearly indicate: the repeat of growth of every node; the circulation similar to every edge of the tree; the instruct, the course cost and the rate of the heuristic of every node. Count on 5. (10 pts) In image processing, Markov Random Fields (MRFs) are veritably gentle for denoising photography by modelling the relationships between neighbouring pixels. Take into story a straightforward binary image denoising disaster, where every pixel in a noisy image is either shadowy (B) or white (W). The duty is to come by effectively the unique image the usage of an MRF mannequin in accordance to noisy observations. The image includes 4 pixels organized in a 2\u00d72 grid, where every pixel can either be in instruct shadowy (B) or white (W). Let the unique states of the pixels be denoted by \ufffd!, \ufffd\u201d, \ufffd#, \ufffd$ and let the noticed (noisy) states be denoted by \ufffd!, \ufffd\u201d, \ufffd#, \ufffd$. The Markov Random Self-discipline items the relationships between neighbouring pixels in accordance to the next components: Pixels which could well maybe well be neighbours within the grid absorb pairwise potentials ?(?%, ?&), which wait on neighboring pixels to absorb the identical color (smoothness). The doable goal is defined as: ?(?%, ?&) = 2 ?? ?% = ?&, = 0.5 ?? ?% \u2260 ?& The neighborhood structure within the 2\u00d72 grid is as follows: o ?! is hooked as a lot as ?\u201d and ?#, o ?\u201d is hooked as a lot as ?! and ?$, o ?# is hooked as a lot as ?! and ?$, o ?$ is hooked as a lot as ?\u201d and ?#. 2. Observation doable in accordance to noisy pixels: Every noisy observation \ufffd% influences the corresponding pixel \ufffd% by means of an observation doable \ufffd(\ufffd\ufffd, \ufffd\ufffd). This doable represents how seemingly the noticed noisy pixel matches the staunch pixel designate. The observation doable is defined as: ?(?%, ?%) = 4.0 ?? ?% = ?% = 0.5 ?? ?% \u2260 ?% Calculate \u2018((*!+,,*\u201d+. | 1!+.,1\u2033+,,1#+.,1$+,) \u2018((*!+.,*\u201d+, |1!+.,1\u2033+,,1#+.,1$+,) Count on 6. (10 pts) A college campus is served by a rapidly of self sustaining transport robots that transport applications between loads of campus structures. The campus is split into four predominant zones: A1, A2, A3, and A4. Supply robots can either wait in a zone to win a bundle or circulate to a particular zone to stare for a bundle to carry. The demand for deliveries varies by zone, and at any given time, the probability of a robotic finding a bundle for transport in a particular zone is confirmed in Table 1 below: Zone\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Chance of finding a bundle A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.25 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.3 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.35 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.1 As soon as a transport robotic picks up a bundle, the destination is decided in accordance to student or college requests. Historical data on deliveries between zones is offered in Table 2 below: Supply \u2192 Destination\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Chance A1 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.3 A1 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.4 A1 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.3 A2 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.5 A2 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.2 A2 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.3 A3 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.4 A3 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a00.3 A3 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.3 A4 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.5 A4 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.25 A4 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 0.25 The transport price charged between different zones is confirmed in Table 3 below: Supply \u2192 Destination\u00a0 Supply Price A1 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $12 A1 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$8 A1 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$6 A2 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $10 A2 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $7 A2 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$9 A3 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $14 A3 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$9 A3 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$5 A4 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$15 A4 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $7 A4 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$4 The cost incurred for a transport robotic animated between different zones (with out a bundle) is listed in Table 4 below: Supply \u2192 Destination\u00a0 \u00a0 \u00a0 \u00a0 Shuttle Price A1 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $1.5 A1 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$2.0 A1 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $2.5 A2 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$1.0 A2 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $1.8 A2 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $2.2 A3 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $1.8 A3 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $1.5 A3 \u2192 A4\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 $1.2 A4 \u2192 A1\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$2.0 A4 \u2192 A2\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$1.8 A4 \u2192 A3\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0$1.0 Required: (a) Formulate an MDP mannequin that optimizes the robotic\u2019s technique. The MDP is defined by the tuple , i.e., the states, actions, transition probability matrices (for various actions), and reward functions. (b) Solve the MDP mannequin the usage of protection iteration with a discount ingredient of 0.95. Present: 1. The code you gentle to resolve it. 2. The designate of the principle two iterations of the protection iteration course of. (c) Solve the MDP mannequin the usage of a linear programming formula with a discount ingredient of 0.95. Present: 1. The LP formula. 2. The code for fixing it. Caught with loads of homework assignments and feeling pressured out ? Steal legitimate tutorial aid & Salvage 100% Plagiarism free papers Salvage A Free Quote<\/p>\n","protected":false},"excerpt":{"rendered":"
Instructions: Please provide typed answers in a observe doc or in pdf. Please attain no longer provide handwritten answers. If you occur to could well maybe absorb got gentle program to compute the acknowledge, please provide the code within the closing bundle with detailed feedback. Right here is an particular individual project, so no collaboration […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-7693","post","type-post","status-publish","format-standard","hentry","category-solutions"],"_links":{"self":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts\/7693","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/comments?post=7693"}],"version-history":[{"count":0,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/posts\/7693\/revisions"}],"wp:attachment":[{"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/media?parent=7693"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/categories?post=7693"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/academicwritersbay.com\/solutions\/wp-json\/wp\/v2\/tags?post=7693"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}