M.F., age 62, is brought to the emergency department by her son. While visiting her, he became alarmed when he noticed his mother seemed to have problems speaking and forming words. The right side of her face also appears to be "drooping."
M.F. suffers from a history of atrial fibrillation, high blood pressure, and diabetes. She is taking anti-hypertensive medications. She used to smoke but she quit 4 years ago. Cardiovascular disease runs in her family. Her father died of a heart attack at the age of 52.
A CT scan rules out a brain hemorrhage.
What type of stroke is M.F. experiencing?
What area of M.F.'s brain appears to be affected?
What are some of M.F.'s risk factors for cerebrovascular disease?
What role may atrial fibrillation play in M.F.'s case?
Why is the CT scan information important?
What treatments are available for M.F.?
In: Nursing
Oberweis is a dairy company based out of Chicago. Oberweis produces milk at a fixed rate of 6,000 gallons/hour. Oberweis serves clients who, in total, request 100,000 gallons of milk per day. Clients send trucks to pick up their orders, and trucks arrive uniformly from 8am to 6pm. If Oberweis runs out of milk, trucks will wait until enough is produced to satisfy their client’s requests. Per Oberweis policy, the company begins and ends each day with 24,000 gallons in finished goods inventory. The plant begins its daily production at 8am and closes once it has satisfied all client demand and replenished its finished goods inventory. In your analysis, treat trucks/milk as a continuous flow process.
1) If Oberweis were charged $30 per hour per waiting truck, how much would Oberweis be charged per day (in dollars)?
In: Accounting
A coffee roaster in Richardson has opened a retail store adjacent to the production plant. The plant manager wishes to optimize the inventory costs of the company’s best-selling coffee. The annual demand for the coffee is 36,000 bags and the plant works 240 days per yr. The plant can roast the coffee at a rate of 300 bags per day. The cost to prepare the equipment to start a production run is $350 and the annual inventory carrying cost is $3.6 per year. Use 2 decimal places in your calculations (if needed) and round your final answer to the closest whole number.
1. What should be the optimum quantity of coffee to produce?
2. What is the maximum inventory achieved during a production run?
3. How many production runs are needed to meet the annual demand?
4. What is the average inventory of coffee?
5. What is the minimum total annual cost of producing and storing the company’s best-selling coffee?
In: Accounting
You are considering constructing a new plant in a remote wilderness area to process the ore from a planned mining operation. You anticipate that the plant will take a year to build and cost $100 million upfront. Once built, it will generate cash flows of $15 million at the end of every year over the life of the plant. The plant will be useless 20 years after its completion once the mine runs out of ore. At that point you expect to pay $200 million to shut the plant down and restore the area to its pristine state. Using a cost of capital of 12%,
(please answer it in Excel with )
| a. | What is the NPV of the project? | ||||||
| b. | Is using the IRR rule reliable for this project? | ||||||
| c. | What is the IRR of this project? Find the non-zero IRR. | ||||||
| Upfront costs | $100 | ||||||
| Annual cash flows (million) | $15 | ||||||
| Number of periods (years) | 20 | ||||||
| Closing costs (million) | $200 | ||||||
| Cost of capital | 12% | ||||||
In: Finance
1) Conlon Enterprises reports the following information about resources.
| Cost Driver Rate | Cost Driver Volume | ||||
| Resources used | |||||
| Setups | $ | 375 | per run | 350 | runs |
| Clerical | 45 | per page | 1,000 | pages | |
| Resources supplied | |||||
| Setups | $ | 135,000 | |||
| Clerical | 60,000 | ||||
Required:
Compute unused setup and clerical resource capacity for Conlon Enterprises.
|
2)
Tri-State Mill uses a special sander to finish lumber. Data on
the sander and its usage follow.
| Cost Driver Rate | Cost Driver Volume | ||||
| Resources used | |||||
| Energy | $ | 0.90 | per machine-hour | 6,000 | machine-hours |
| Repairs | $ | 16.00 | per job | 600 | jobs |
| Resources supplied | |||||
| Energy | $ | 6,900 | |||
| Repairs | 12,000 | ||||
Required:
Compute unused resource capacity in energy and repairs for Tri-State Mill.
Unused Resource Capacity
Energy -
Repairs-
In: Accounting
American Auto is evaluating its marketing plan for the sedans, SUVs, and trucks the company produces. A TV ad featuring this SUV has been developed. The company estimates each showing of this commercial will cost $500,000 and increase sales of SUVs by 3% but reduce sales of trucks by 1% and have no effect on the sales of sedans. The company also has a print ad campaign developed that it can run in various nationally distributed magazines at a cost of $750,000 per title. It is estimated that each magazine title the ad runs in will increase the sales of sedans, SUVs, and trucks by 2%, 1%, and 4%, respectively. The company desires to increase sales of sedans, SUVs, and trucks by at least 3%, 14%, and 4%, respectively, in the least costly manner.
a. Formulate an LP model for this problem.
b. Sketch the feasible region.
c. What is the optimal solution? PLEASE SHOW HOW TO CALCULATE CONSTRAINT POINTS THAT NEED TO BE SHOWN ON GRAPH FOR FEASIBLE REGION THANK YOU
In: Operations Management
The Transportation Safety Authority (TSA) has developed a new test to detect large amounts of liquid in luggage bags. Based on many test runs, the TSA determines that if a bag does contain large amounts of liquid, there is a probability of 0.9 the test will detect it. If a bag does not contain large amounts of liquid, there is a 0.09 probability the test will conclude that it does (a false positive). Suppose that in reality only 1 in 100 bags actually contain large amounts of liquid.
a. What is the probability a randomly selected bag will have a positive test? Give your answer to four decimal places.
b. Given a randomly selected bag has a positive test, what is the probability it actually contains a large amount of liquid? Give your answer to four decimal places.
c. Given a randomly selected bag has a positive test, what is the probability it does not contain a large amount of liquid? Give your answer to four decimal places.
In: Statistics and Probability
Address Labeller Simple databases normally store address information as single line of data. In our database, fields are delimited by the percent sign '%' and can be placed in any order. Each field starts with a label "Street:", "City:", "State:", and "Zipcode:". Write an address labeller that extracts the fields from a database record entered by the user and prints a label if all fields are present. The program will report on any missing fields.
Sample runs: Enter an address database entry: State:New York%Street:12 Primrose Lane%Zipcode:11564%City:ValleyStream% 12 Primrose Lane ValleyStream, New York 11564
Enter an address database entry: Street:12 Primrose Lane%Zipcode:11564%State:New York%City:ValleyStream% 12 Primrose Lane ValleyStream, New York 11564
Enter an address database entry: Street:12 Primrose Lane%State:New York%City:ValleyStream% Error: Address does not contain zipcode
In: Computer Science
In an attempt to explain what an elder matrix is: it is a n by m matrix in which each row and each column is sorted in ascending order.
Inputs in the matrix can either be finite integers or ∞. the ∞symbol is used when accounting for nonexistent inputs.
for all questions below please answer using pseudocode and explainations
(a) create an algorithm EXTRACT-MIN on an Elder Matrix that is not
empty. the algorithm must run in O(m+n) time. The algorithm must
use a recursive function that solves an m by n problem by
recursively solving a (m-1) by n problem or a m by (n-1)
problem.
(b)create an algorithm INSERT of an integer into a m by n Elder
Matrix that runs in O(m+n) time.
(c) Using no other sorting method as a subroutine, show how to use
a n by n Elder Matrix to sort n2 numbers in O(n3) time. (Suppose we
let k = n2. Then this is an O(k1.5) sorting algorihm
In: Computer Science
Algorithm1 prefixAverages1(X, n)
Input array X of n integers
Output array A of prefix averages of X
A ← new array of n integers
for i ← 0 to n − 1 do
s ← X[0]
for j ← 1 to i do
s ← s + X[j]
A[i] ← s / (i + 1)
return A
-----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
Algorithm2 prefixAverages2(X, n)
Input array X of n integers
Output array A of prefix averages of X
A ← new array of n integers
s ← 0
for i ← 0 to n − 1 do
s ← s + X[i]
A[i] ← s / (i + 1)
return A
Code up methods for both algorithms. Show through different input examples and using the Current Time method call how the polynomial time algorithm runs slower than the linear time version. Use system.out.println statement to show your results.
programming language: java
In: Computer Science