urgent and needed in 6 hours

Review the draft papers. Before Tuesday, post a critique for two (2) or more of these selection papers including your evaluation of how well the students justified their recommendations.

3. Before 11:59 PM ET Tuesday, post a reply to 2 different selection papers (reply in their threads) which contain your vote for the best technology selection recommendations. Along with your vote, provide a brief one paragraph justification for your choice. (These count as your follow-up postings to your peers.)

Summary of topics

There are TWO tasks that you would need to do( they are separate): 

Task 1:

Write a summary of the below points for a  total 300 words (100 words for each question with three research papers as reference)

 1.  What are the business costs or risks of poof data quality? Support your discussion with at least 3 references.

2.  What is data mining? Support your discussion with at least 3 references.

3.  What is text mining? Support your discussion with at least 3 references.

TASK 2:

Write a reply to the two responses in the attached document ( Response 1 and Response 2) with 150 words for each. 

There should be no plagiarism. Attach a plagiarism report with 0 % similarity index. 

forming effective searching

Directions

As outlined in the lecture, there are various types of strategies and tools that students can use to develop search phrases to find exactly what they need without mining through hundreds of results.

In this assignment, you will develop a search phrase to best locate the information posed in the prompt. Then, using at least 50 words for each search scenario, explain why you picked this approach. Finally, perform the search in question and evaluate the results. In at least 50 words, explain if your search results were what you expected and why or why not this was the case.

Example: You want to find information on the President Teddy Roosevelt.

Search Phrase developed: “Teddy Roosevelt” president

Strategy: I chose this strategy because using quotation marks around the name Teddy Roosevelt will ensure that both pieces of the name are searched for together. When quotation marks aren’t used, results showing the first name and the second name will all show up, which will populate many results unrelated to Teddy Roosevelt such as Franklin D. Roosevelt.

Search Results:

Wikipedia:https://en.wikipedia.org/wiki/Theodore_Roosevelt#:~:text=Theodore%20Roosevelt%20Jr.%20(%2F%CB%88,States%20from%201901%20to%201909.

History: https://www.history.com/topics/us-presidents/theodore-roosevelt

History: https://www.history.com/news/teddy-roosevelt-legacies

Analysis: Yes, these search results were what I expected to see based on my search. The results reflected my usage of the quotation marks as sites that discussed Teddy Roosevelt’s role as president were returned first. All of the sites included both Teddy Roosevelt’s name as well as the word president.

1, You want to find information on Buffalo, NY but not anything related to the Buffalo Bills football team.

⦁ Develop and document a search phrase that you would use in a search engine to find this information.

⦁ Explain why you chose this strategy using at least 50 words.

⦁ After performing the search yourself, document the first 2-3 result entries that were returned. Analyze if the search results were what you expected using at least 50 words.

2, You want to find information on recipes for stuffed peppers that do not include rice.

⦁ Develop and document a search phrase that you would use in a search engine to find this information.

⦁ Explain why you chose this strategy using at least 50 words.

⦁ After performing the search yourself, document the first 2-3 result entries that were returned. Analyze if the search results were what you expected using at least 50 words.

3, You want to find videos about astronomy only on YouTube.

⦁ Develop and document a search phrase that you would use in a search engine to find this information.

⦁ Explain why you chose this strategy using at least 50 words.

⦁ After performing the search yourself, document the first 2-3 result entries that were returned. Analyze if the search results were what you expected using at least 50 words.

4, You want to combine the search for both woodworking and welding.

⦁ Develop and document a search phrase that you would use in a search engine to find this information.

⦁ Explain why you chose this strategy using at least 50 words.

⦁ After performing the search yourself, document the first 2-3 result entries that were returned. Analyze if the search results were what you expected using at least 25 words.

5. You want to find information related only to gestational diabetes.

⦁ Develop and document a search phrase that you would use in a search engine to find this information.

⦁ Explain why you chose this strategy using at least 50 words.

⦁ After performing the search yourself, document the first 2-3 result entries that were returned. Analyze if the search results were what you expected using at least 50 words.

OR_Discussion_2

  1. Organizational performance is the fifth aspect of the model, reflect on the question, do certain leadership behaviors improve and sustain performance at the individual, group, and organizational level?  Please explain your response.
  2. There were two types of innovation addressed this week (product and process innovation), please note your own personal definition of these concepts and offer an example of both.

Please be sure to answer all of the questions above in the initial post.

Assignment

Students will create a Disaster Recovery Plan for either the organization they work for or one they wish to work for in the future.  The plan will follow the template/example provided.

SDLC Program & Programming

 Test out the Google App Engine – Quickstart for Python 2 Standard Environment

This quick start shows you how to create a small App Engine application that displays a short message. 

analyze asymmetric and symmetric encryption

 You will need to analyze asymmetric and symmetric encryption.  Evaluate the differences between the two of them and which one that you would determine is the most secure.  The writing assignment requires a minimum of two written pages to evaluate history.  You must use a minimum of three scholarly articles to complete the assignment.  The assignment must be properly APA formatted with a separate title and reference page.  

Please read the above description carefully. Thank you.

the time complexity of algorithms.

 

Researchers from the School of BioSciences have requested our help with one of their

experiments. They are performing behavioural experiments with zebrafish. At any one instance in

time there are a large number of zebrafish in the aquarium. For their particular experiment, the

biologist take a snapshot of the aquarium and then need to find the longest series of zebrafish such

the length of each fish along the horizontal direction in the aquarium is increasing. They also need

to know the number of zebra fish in this series.

For example, the snapshot of the aquarium resulted in fish lengths of [2, 5, 3, 7, 11, 1, 12, 4, 15, 14, 6, 16].

One possible longest series of increasing lengths in this case is [2, 3, 7, 11, 12, 14, 16] with 7 zebrafish.

We say one possible longest series of increasing lengths here because it is not necessarily unique.

For example, the length 14 in the output could be replaced with 15: [2, 3, 7, 11, 12, 15, 16] and also

be valid.

In this question you will consider algorithms for finding the longest series of increasing lengths

via the function LongestIncreasingLengths(A[0, · · · , n − 1]), as well as the size of this output

array.

(a) [1+2+1 = 4 Marks] Consider a recursive algorithm:

i [1 Mark]Write down a recurrence relation for the function LongestIncreasingLengths.

ii [2 Marks] Using this recurrence relation, write a recursive algorithm in pseudocode for

LongestIncreasingLengths that only calculates the array size of the longest series of

increasing lengths. You do not need to output the actual array containing the longest

series of increasing lengths in this part of the question. For the example above with input

A = [2, 5, 3, 7, 11, 1, 12, 4, 15, 14, 6, 16], the output should just be 7. The pseudocode should

be about 10 lines of code.

iii [1 Mark] What is the time complexity of this recursive algorithm? Justify your answer.

(b) [5+1+1 = 7 Marks]

i [5 Marks] Building on from your recursive algorithm in part (a), write down a dynamic

programming implementation in pseudocode for the function

LongestIncreasingLengths(A[0, · · · , n − 1]) to find the longest series of increasing

lengths. This should also output the size of the longest series of increasing lengths. The

pseudocode should be about 20 lines of code.

ii [1 Mark] Explain how the recurrence relation used for your dynamic programming imple-

mentation involves overlapping instances.

iii [1 Mark] What is the time complexity of your algorithm and how much auxiliary space

was required. Justify your answer.

(c) [1+2 = 3 Marks] The time complexity of the recursive algorithm for LongestIncreasingLengths

was exponential, while the dynamic programming algorithm lead to a polynomial

time complexity (note, you need to determine that polynomial above). Here we will investigate

an algorithm for the function LongestIncreasingLengths that has a time complexity of

O(n log n).

Consider building a set of arrays for the input array A[0, · · · , n − 1]. As we scan along A, we

will compare A[i] with the final element in each array in this set. This comparison will satisfy

the following conditions:

(1) If A[i] is smaller than the final element in each array, start a new array of size 1 with A[i].

(2) If A[i] is larger than the final element in each array, copy the longest array and append

A[i] to this new array.

(3) If A[i] is in between, find the array with the final element that is greater than A[i] and

replace that element with A[i].

i [1 Mark] Write down the set of arrays that satisfy these rules for the input array

A = [0, 8, 4, 12, 2, 10, 6, 14, 1, 9, 5, 13, 3, 11, 7, 15].

ii [2 Marks] Building from these conditions, explain how an algorithm for the function

LongestIncreasingLengths could run with time complexity O(n log n). You may make

use any algorithm introduced in the lectures to help you with your explanation. Note: you

do not have to write this algorithm in pseudocode. We are expecting that you write a short

paragraph or a short list of bullet points describing the important steps of the algorithm

to explain the time complexity.

Hint: what if you only consider the final elements of this set of arrays as a single array?

Research Paper and discussion

Part 1 : Research paper 

What are baseline security requirements that should be applied to the design and implementation of applications, databases, systems, network infrastructure, and information processing when considering cloud computing within an enterprise risk management framework?

Your paper should meet the following requirements:

  • Be approximately four to six pages in length, not including the required cover page and reference page.
  • Follow APA7 guidelines. Your paper should include an introduction, a body with fully developed content, and a conclusion.
  • Support your answers with the readings from the course and at least two scholarly journal articles to support your positions, claims, and observations, in addition to your textbook. The UC Library is a great place to find resources.

Part 2 : discussion ( 500 words including 2 responses )

  • What are some of the potential risks involved with cloud computing?
  • Does the research and model in this article propose a viable solution to cloud-based risk management?

Please make your initial post and two response posts substantive. A substantive post will do at least two of the following:

  • Ask an interesting, thoughtful question pertaining to the topic
  • Answer a question (in detail) posted by another student or the instructor
  • Provide extensive additional information on the topic
  • Explain, define, or analyze the topic in detail
  • Share an applicable personal experience
  • Provide an outside source (for example, an article from the UC Library) that applies to the topic, along with additional information about the topic or the source (please cite properly in APA 7)
  • Make an argument concerning the topic