External link to HA425 Operational Analysis and Quality ImprovementAs demands on the U.S. public health system continue to increase more quality improvement strategies are needed to support the system and improve outcomes. Public health agencies like leaders in other industries are developing quality improvement approaches for application in public health settings. Bringing together local state and national healthcare practitioners and other stakeholders in quality improvement and quality assurance efforts has yielded several best practices and lessons for public health stakeholders. However more work is needed if quality improvement is to become standard practice in public health. Instructions In this assignment you will read the article “Quality Improvement in Public Health: Lessons Learned from a Multi-State Learning Collaborative.” You will list the major concepts within the article and explain the positive outcomes in the two case studies. Further explore the how quality improvement programs could be systematically used in public health systems and explain the goals values and vision that should be considered in implementing such programs. Finally consider the future after such programs have been created and findings have been determined. How would ensure that the findings are implemented and followed in public health and public health policy in the future? This paper should be at least 1000 words in length. The paper has at least three references. Your writing should be well ed logical and unified as well as original and insightful. All sources used should be properly cited using APA formatting. Requirements

Assignment Questions

HA425 Operational Analysis and Quality ImprovementAs demands on the U.S. public health system continue to increase more quality improvement strategies are needed to support the system and improve outcomes. Public health agencies like leaders in other industries are developing quality improvement approaches for application in public health settings. Bringing together local state and national healthcare practitioners and other stakeholders in quality improvement and quality assurance efforts has yielded several best practices and lessons for public health stakeholders. However more work is needed if quality improvement is to become standard practice in public health. Instructions In this assignment you will read the article “Quality Improvement in Public Health: Lessons Learned from a Multi-State Learning Collaborative.” You will list the major concepts within the article and explain the positive outcomes in the two case studies. Further explore the how quality improvement programs could be systematically used in public health systems and explain the goals values and vision that should be considered in implementing such programs. Finally consider the future after such programs have been created and findings have been determined. How would ensure that the findings are implemented and followed in public health and public health policy in the future? This paper should be at least 1000 words in length. The paper has at least three references. Your writing should be well ed logical and unified as well as original and insightful. All sources used should be properly cited using APA formatting. Requirements

December 9, 2020

External link to HA425 Operational Analysis and Quality ImprovementAs demands on the U.S. public health system continue to increase more quality improvement strategies are needed to support the system and improve outcomes. Public health agencies like leaders in other industries are developing quality improvement approaches for application in public health settings. Bringing together local state and national healthcare practitioners and other stakeholders in quality improvement and quality assurance efforts has yielded several best practices and lessons for public health stakeholders. However more work is needed if quality improvement is to become standard practice in public health. Instructions In this assignment you will read the article “Quality Improvement in Public Health: Lessons Learned from a Multi-State Learning Collaborative.” You will list the major concepts within the article and explain the positive outcomes in the two case studies. Further explore the how quality improvement programs could be systematically used in public health systems and explain the goals values and vision that should be considered in implementing such programs. Finally consider the future after such programs have been created and findings have been determined. How would ensure that the findings are implemented and followed in public health and public health policy in the future? This paper should be at least 1000 words in length. The paper has at least three references. Your writing should be well ed logical and unified as well as original and insightful. All sources used should be properly cited using APA formatting. Requirements

Assignment Questions

HA425 Operational Analysis and Quality ImprovementAs demands on the U.S. public health system continue to increase more quality improvement strategies are needed to support the system and improve outcomes. Public health agencies like leaders in other industries are developing quality improvement approaches for application in public health settings. Bringing together local state and national healthcare practitioners and other stakeholders in quality improvement and quality assurance efforts has yielded several best practices and lessons for public health stakeholders. However more work is needed if quality improvement is to become standard practice in public health. Instructions In this assignment you will read the article “Quality Improvement in Public Health: Lessons Learned from a Multi-State Learning Collaborative.” You will list the major concepts within the article and explain the positive outcomes in the two case studies. Further explore the how quality improvement programs could be systematically used in public health systems and explain the goals values and vision that should be considered in implementing such programs. Finally consider the future after such programs have been created and findings have been determined. How would ensure that the findings are implemented and followed in public health and public health policy in the future? This paper should be at least 1000 words in length. The paper has at least three references. Your writing should be well ed logical and unified as well as original and insightful. All sources used should be properly cited using APA formatting. Requirements

December 9, 2020

External link to I need help with my ELECTRICAL ENERGY CONVERSION class final exam.All of the materials are from this book: Electrical Machinery Fundamentals S. J. Chapman McGraw-Hill 5th Edition 2012. The exam will include appendix A chapter 123456789 however the focus will be on materials regarding transformers (single-phase and three-phase) synchronous machine (generator and motor) induction motor DC machine (generator and motor). this exam will have two parts: Conceptual and analysis questions. The conceptual questions would have be in the format of multiple-choice and/or fill-in blank space and/or true-false. The exam will be 120 minutes long.

Assignment Questions

I need help with my ELECTRICAL ENERGY CONVERSION class final exam.All of the materials are from this book: Electrical Machinery Fundamentals S. J. Chapman McGraw-Hill 5th Edition 2012. The exam will include appendix A chapter 123456789 however the focus will be on materials regarding transformers (single-phase and three-phase) synchronous machine (generator and motor) induction motor DC machine (generator and motor). this exam will have two parts: Conceptual and analysis questions. The conceptual questions would have be in the format of multiple-choice and/or fill-in blank space and/or true-false. The exam will be 120 minutes long.

December 9, 2020

External link to Encryption/Decryption Project on Verilog Using Vivado programI have already all the files and the modules for this project BUT for some reason when I do run simulation it does not work It show Xs and Zs for some reason Can you help me get this project to work on Vivado I will include all of the files and modules used and needed for this I just need someone to help me get this to work when doing a simulation i think it is missing some modules / Test Bench to work correctly.

Assignment Questions

Encryption/Decryption Project on Verilog Using Vivado programI have already all the files and the modules for this project BUT for some reason when I do run simulation it does not work It show Xs and Zs for some reason Can you help me get this project to work on Vivado I will include all of the files and modules used and needed for this I just need someone to help me get this to work when doing a simulation i think it is missing some modules / Test Bench to work correctly.

December 9, 2020

External link to Reflection Essayi need one draft and one final essay (after i give feedback to you then start the final essay) 2-3pages deadlne: first draft (12/10 1pm) Final draft: 12/16

Assignment Questions

Reflection Essayi need one draft and one final essay (after i give feedback to you then start the final essay) 2-3pages deadlne: first draft (12/10 1pm) Final draft: 12/16

December 9, 2020

External link to olve algorithm questions useing pseudo code using pseudocode there is an example of pseudocode in attachment. An independent set of a graph G = (VE) is a set S ⊆ V of vertices such that for every two vertices u and v there is not an edge (uv) in E. Also recall the definition of a vertex cover i.e. a set T of vertices such that for every edge (uv) ∈ E at least one of u and v is in T. Prove that S is an independent set if any only if V − S is a vertex cover. [10 marks] Consider the decision version of the Maximum Independent Set problem: given a graph G = (VE) and an integer k decide whether there is an independent set S of size at least k in G (i.e. whether |S| ≥ k.) Also recall the decision version of the (minimum) Vertex Cover problem: given a graph G = (VE) and an integer k decide whether there is a vertex cover of size at most k in G. Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(1) time. Design a polynomial time algorithm B that uses the algorithm A which solves the decision version of the Maximum Independent Set problem. Provide an argument for the correctness of the algorithm. What is the implication of the existence of algorithm B on the computational complexity of the decision version of the Maximum Independent Set problem? [15 marks] Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(n22k) time where n = |V | and k is the input integer parameter for the decision version of Vertex Cover. Does algorithm B solve the decision version of the Maximum Independent Set problem in time O(n2 2k) where n = |V | and k is the input integer parameter for the decision version of Maximum Independent Set? Justify your answer. [5 marks] Dr. Rasi Flosi-Starkasi has prepared 50 problems for the exam of his module “Advanced Algorithmic Techniques”. Each one of these problems has two attributes: -Its type: it is either a problem on graph algorithms approximation algorithms or randomised algorithms. -Its difficulty: it is either easy moderate or difficult. For example it could be that Problem #34 is an easy problem on approximation algorithms. Dr. Flosi-Starkasi would like to prepare an exam consisting of 24 of those problems but he wants to make sure that the exam containts 8 problems on graph algorithms 8 problems on approximation algorithms and 8 problems on randomised algorithms and at the same time 8 easy problems 8 moderate problems and 8 difficult problems. Model this problem as a maximum flow problem by explaining all the parameters of the flow network. Explain how to find a feasible exam set (i.e. satisfying the constraints set by Dr. Flosi-Starkasi above) from the maximum flow in the network if it exists or how to decide that it does not exist. [20 marks] It turned out that the exam set by Dr. Flosi-Starkasi in the previous part of the problem was really boring. For that reason he decided to record an additional attribute for each problem its entertainment value which is a real number between 0 and 1. Dr. Flosi-Starkasi would now like to find a feasible exam (satisfying the constraints set in the previous part) which maximises the total entertainment value (i.e. the sum of the entertainment values of the problems included in the exam). Model this problem and an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [15 marks] Dr. Rasi Flosi-Starkasi aims to schedule a series of 1-hour Q&A sessions with n students and has set up a doodle poll where there are m available time slots. Every student has indicated which slots they could attend and it turns out that any student appears in at least 1 and at most k time slots in the doodle poll. Dr. Flosi-Starkasi would like to minimise the number of sessions that he will have to do making sure that he does at least one session for every student (i.e. every student will have a chance to attend some session). Model this problem as an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [10 marks] Write the LP-relaxation of the ILP that you constructed above. [5 marks] Design a rounding scheme for the LP-relaxation that results in an approximation algorithm for the problem with approximation ratio at most k. Argue about the correctness of your algorithm. [15 marks]

Assignment Questions

olve algorithm questions useing pseudo code using pseudocode there is an example of pseudocode in attachment. An independent set of a graph G = (VE) is a set S ⊆ V of vertices such that for every two vertices u and v there is not an edge (uv) in E. Also recall the definition of a vertex cover i.e. a set T of vertices such that for every edge (uv) ∈ E at least one of u and v is in T. Prove that S is an independent set if any only if V − S is a vertex cover. [10 marks] Consider the decision version of the Maximum Independent Set problem: given a graph G = (VE) and an integer k decide whether there is an independent set S of size at least k in G (i.e. whether |S| ≥ k.) Also recall the decision version of the (minimum) Vertex Cover problem: given a graph G = (VE) and an integer k decide whether there is a vertex cover of size at most k in G. Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(1) time. Design a polynomial time algorithm B that uses the algorithm A which solves the decision version of the Maximum Independent Set problem. Provide an argument for the correctness of the algorithm. What is the implication of the existence of algorithm B on the computational complexity of the decision version of the Maximum Independent Set problem? [15 marks] Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(n22k) time where n = |V | and k is the input integer parameter for the decision version of Vertex Cover. Does algorithm B solve the decision version of the Maximum Independent Set problem in time O(n2 2k) where n = |V | and k is the input integer parameter for the decision version of Maximum Independent Set? Justify your answer. [5 marks] Dr. Rasi Flosi-Starkasi has prepared 50 problems for the exam of his module “Advanced Algorithmic Techniques”. Each one of these problems has two attributes: -Its type: it is either a problem on graph algorithms approximation algorithms or randomised algorithms. -Its difficulty: it is either easy moderate or difficult. For example it could be that Problem #34 is an easy problem on approximation algorithms. Dr. Flosi-Starkasi would like to prepare an exam consisting of 24 of those problems but he wants to make sure that the exam containts 8 problems on graph algorithms 8 problems on approximation algorithms and 8 problems on randomised algorithms and at the same time 8 easy problems 8 moderate problems and 8 difficult problems. Model this problem as a maximum flow problem by explaining all the parameters of the flow network. Explain how to find a feasible exam set (i.e. satisfying the constraints set by Dr. Flosi-Starkasi above) from the maximum flow in the network if it exists or how to decide that it does not exist. [20 marks] It turned out that the exam set by Dr. Flosi-Starkasi in the previous part of the problem was really boring. For that reason he decided to record an additional attribute for each problem its entertainment value which is a real number between 0 and 1. Dr. Flosi-Starkasi would now like to find a feasible exam (satisfying the constraints set in the previous part) which maximises the total entertainment value (i.e. the sum of the entertainment values of the problems included in the exam). Model this problem and an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [15 marks] Dr. Rasi Flosi-Starkasi aims to schedule a series of 1-hour Q&A sessions with n students and has set up a doodle poll where there are m available time slots. Every student has indicated which slots they could attend and it turns out that any student appears in at least 1 and at most k time slots in the doodle poll. Dr. Flosi-Starkasi would like to minimise the number of sessions that he will have to do making sure that he does at least one session for every student (i.e. every student will have a chance to attend some session). Model this problem as an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [10 marks] Write the LP-relaxation of the ILP that you constructed above. [5 marks] Design a rounding scheme for the LP-relaxation that results in an approximation algorithm for the problem with approximation ratio at most k. Argue about the correctness of your algorithm. [15 marks]

December 9, 2020

External link to can you help me on my aerodynamics final?ı need help on my final. It’s on December 9th amd ı have 2 hours to complete it.

Assignment Questions

can you help me on my aerodynamics final?ı need help on my final. It’s on December 9th amd ı have 2 hours to complete it.

December 9, 2020

External link to BIO003 Introduction to Biology-Endagered organism: Amur Leopard (Note: NOT extinct) – 2 – 3 page paper. The paper must be double spaced in Times New Roman Font 12 with 1-inch margins. -Attach a list of references to your paper. Structure: Author. (Date published if available; n.d.–no date– if not). Title of article. Title of web site. Retrieved date. From URL.

Assignment Questions

BIO003 Introduction to Biology-Endagered organism: Amur Leopard (Note: NOT extinct) – 2 – 3 page paper. The paper must be double spaced in Times New Roman Font 12 with 1-inch margins. -Attach a list of references to your paper. Structure: Author. (Date published if available; n.d.–no date– if not). Title of article. Title of web site. Retrieved date. From URL.

December 9, 2020

External link to What is marketing research and how marketing research helped Mr. Abdullah in preparing the report.“AL Yahya Stationary Company LLC” is a reputed company in Sultanate of Oman dealing with stationary products. Earlier they use to sell the stationary products only to the corporates ministries . Recently they recruited a new sales manager Mr. Abdullah al Saadi. Mr. Abdullah after doing an extensive marketing research has prepared a report and submitted the plan to the management for approval. The report has got the following suggestions for improving the business. The management liked the proposal of Mr. Abdullah and permitted him to implement his suggestions. Questions

Assignment Questions

What is marketing research and how marketing research helped Mr. Abdullah in preparing the report.“AL Yahya Stationary Company LLC” is a reputed company in Sultanate of Oman dealing with stationary products. Earlier they use to sell the stationary products only to the corporates ministries . Recently they recruited a new sales manager Mr. Abdullah al Saadi. Mr. Abdullah after doing an extensive marketing research has prepared a report and submitted the plan to the management for approval. The report has got the following suggestions for improving the business. The management liked the proposal of Mr. Abdullah and permitted him to implement his suggestions. Questions

December 9, 2020

External link to olve algorithm questions useing pseudo code using pseudocode there is an example of pseudocode in attachment. An independent set of a graph G = (VE) is a set S ⊆ V of vertices such that for every two vertices u and v there is not an edge (uv) in E. Also recall the definition of a vertex cover i.e. a set T of vertices such that for every edge (uv) ∈ E at least one of u and v is in T. Prove that S is an independent set if any only if V − S is a vertex cover. [10 marks] Consider the decision version of the Maximum Independent Set problem: given a graph G = (VE) and an integer k decide whether there is an independent set S of size at least k in G (i.e. whether |S| ≥ k.) Also recall the decision version of the (minimum) Vertex Cover problem: given a graph G = (VE) and an integer k decide whether there is a vertex cover of size at most k in G. Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(1) time. Design a polynomial time algorithm B that uses the algorithm A which solves the decision version of the Maximum Independent Set problem. Provide an argument for the correctness of the algorithm. What is the implication of the existence of algorithm B on the computational complexity of the decision version of the Maximum Independent Set problem? [15 marks] Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(n22k) time where n = |V | and k is the input integer parameter for the decision version of Vertex Cover. Does algorithm B solve the decision version of the Maximum Independent Set problem in time O(n2 2k) where n = |V | and k is the input integer parameter for the decision version of Maximum Independent Set? Justify your answer. [5 marks] Dr. Rasi Flosi-Starkasi has prepared 50 problems for the exam of his module “Advanced Algorithmic Techniques”. Each one of these problems has two attributes: -Its type: it is either a problem on graph algorithms approximation algorithms or randomised algorithms. -Its difficulty: it is either easy moderate or difficult. For example it could be that Problem #34 is an easy problem on approximation algorithms. Dr. Flosi-Starkasi would like to prepare an exam consisting of 24 of those problems but he wants to make sure that the exam containts 8 problems on graph algorithms 8 problems on approximation algorithms and 8 problems on randomised algorithms and at the same time 8 easy problems 8 moderate problems and 8 difficult problems. Model this problem as a maximum flow problem by explaining all the parameters of the flow network. Explain how to find a feasible exam set (i.e. satisfying the constraints set by Dr. Flosi-Starkasi above) from the maximum flow in the network if it exists or how to decide that it does not exist. [20 marks] It turned out that the exam set by Dr. Flosi-Starkasi in the previous part of the problem was really boring. For that reason he decided to record an additional attribute for each problem its entertainment value which is a real number between 0 and 1. Dr. Flosi-Starkasi would now like to find a feasible exam (satisfying the constraints set in the previous part) which maximises the total entertainment value (i.e. the sum of the entertainment values of the problems included in the exam). Model this problem and an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [15 marks] Dr. Rasi Flosi-Starkasi aims to schedule a series of 1-hour Q&A sessions with n students and has set up a doodle poll where there are m available time slots. Every student has indicated which slots they could attend and it turns out that any student appears in at least 1 and at most k time slots in the doodle poll. Dr. Flosi-Starkasi would like to minimise the number of sessions that he will have to do making sure that he does at least one session for every student (i.e. every student will have a chance to attend some session). Model this problem as an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [10 marks] Write the LP-relaxation of the ILP that you constructed above. [5 marks] Design a rounding scheme for the LP-relaxation that results in an approximation algorithm for the problem with approximation ratio at most k. Argue about the correctness of your algorithm. [15 marks]

Assignment Questions

olve algorithm questions useing pseudo code using pseudocode there is an example of pseudocode in attachment. An independent set of a graph G = (VE) is a set S ⊆ V of vertices such that for every two vertices u and v there is not an edge (uv) in E. Also recall the definition of a vertex cover i.e. a set T of vertices such that for every edge (uv) ∈ E at least one of u and v is in T. Prove that S is an independent set if any only if V − S is a vertex cover. [10 marks] Consider the decision version of the Maximum Independent Set problem: given a graph G = (VE) and an integer k decide whether there is an independent set S of size at least k in G (i.e. whether |S| ≥ k.) Also recall the decision version of the (minimum) Vertex Cover problem: given a graph G = (VE) and an integer k decide whether there is a vertex cover of size at most k in G. Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(1) time. Design a polynomial time algorithm B that uses the algorithm A which solves the decision version of the Maximum Independent Set problem. Provide an argument for the correctness of the algorithm. What is the implication of the existence of algorithm B on the computational complexity of the decision version of the Maximum Independent Set problem? [15 marks] Assume that you have an algorithm A for solving the decision version of the Vertex Cover problem in O(n22k) time where n = |V | and k is the input integer parameter for the decision version of Vertex Cover. Does algorithm B solve the decision version of the Maximum Independent Set problem in time O(n2 2k) where n = |V | and k is the input integer parameter for the decision version of Maximum Independent Set? Justify your answer. [5 marks] Dr. Rasi Flosi-Starkasi has prepared 50 problems for the exam of his module “Advanced Algorithmic Techniques”. Each one of these problems has two attributes: -Its type: it is either a problem on graph algorithms approximation algorithms or randomised algorithms. -Its difficulty: it is either easy moderate or difficult. For example it could be that Problem #34 is an easy problem on approximation algorithms. Dr. Flosi-Starkasi would like to prepare an exam consisting of 24 of those problems but he wants to make sure that the exam containts 8 problems on graph algorithms 8 problems on approximation algorithms and 8 problems on randomised algorithms and at the same time 8 easy problems 8 moderate problems and 8 difficult problems. Model this problem as a maximum flow problem by explaining all the parameters of the flow network. Explain how to find a feasible exam set (i.e. satisfying the constraints set by Dr. Flosi-Starkasi above) from the maximum flow in the network if it exists or how to decide that it does not exist. [20 marks] It turned out that the exam set by Dr. Flosi-Starkasi in the previous part of the problem was really boring. For that reason he decided to record an additional attribute for each problem its entertainment value which is a real number between 0 and 1. Dr. Flosi-Starkasi would now like to find a feasible exam (satisfying the constraints set in the previous part) which maximises the total entertainment value (i.e. the sum of the entertainment values of the problems included in the exam). Model this problem and an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [15 marks] Dr. Rasi Flosi-Starkasi aims to schedule a series of 1-hour Q&A sessions with n students and has set up a doodle poll where there are m available time slots. Every student has indicated which slots they could attend and it turns out that any student appears in at least 1 and at most k time slots in the doodle poll. Dr. Flosi-Starkasi would like to minimise the number of sessions that he will have to do making sure that he does at least one session for every student (i.e. every student will have a chance to attend some session). Model this problem as an integer linear program (ILP). Explain the variables and the constraints of your ILP. . [10 marks] Write the LP-relaxation of the ILP that you constructed above. [5 marks] Design a rounding scheme for the LP-relaxation that results in an approximation algorithm for the problem with approximation ratio at most k. Argue about the correctness of your algorithm. [15 marks]

December 9, 2020