All posts by : chebby

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?

Many business environments have both visible and invisible physical security controls. You see them at the post office, at the corner store, and in certain areas of your own computing environment. They are so pervasive that some people choose where they live based on their presence, as in gated access communities or secure apartment complexes. Alison is a security analyst for a major technology corporation that specializes in data management. This company includes an in house security staff (guards, administrators, and so on) that is capable of handling physical security breaches. Brad experienced an intrusion—into his personal vehicle in the company parking lot. He asks Alison whether she observed or recorded anyone breaking into and entering his vehicle, but this is a personal item and not a company possession, and she has no control or regulation over damage to employee assets. This is understandably unnerving for Brad, but he understands that she’s protecting the business and not his belongings.

When or where would you think it would be necessary to implement security measures for both?

Subject: Distributed Computing

Deadline: 12 hours

Language: PYTHON

Please summarize, in your own words, a description of enterprise risk management. Why do you feel ERM is different from traditional risk management?

Project Description:

You are a real estate analyst who works for Mountain View Realty in the North Utah County area. You have consolidated a list of houses sold during the past few months and want to analyze the data. For a simple analysis, you will outline the data and use the Subtotal feature. You will then create two PivotTables and a PivotChart to perform more in-depth analysis.

 Select from the following list four (4) topics and discuss. Use only 50-words max per topic to discuss and present your answer.  The discussion questions this week are from Chapter 5  (Jamsa, 2013).

Chapter 5 topics:

• Define and describe SSO.
• Define and describe IDaaS.
• Define SAML and describe its purpose.
• Define and describe provisioning.
• Define and describe FIDM.
• List factors that make mobile ID management difficult.

You are supposed to do online research and find out one case study where Apache Pig was used to solve a particular problem. I am expecting 4 page write-up. Please provide as much technical details as possible about solution through Apache Pig. Please draw technical diagrams to explain the solution. 

I am expecting maximum one page for business problem and 3 pages of technical solution. 

I want everyone to do research and provide their own write-up.

Please draw your own diagrams and don’t go more than 4 pages in total.

 Task: Create one (1) instrument that could be used to gather data for your mock dissertation topic. The instrument should be designed to be exactly how it would be deployed to collect data. Since instrumentation usually goes through several steps of field testing, for purposes of this assignment you can submit a deployment-ready draft of your instrument without field testing it. Be sure the instrument collects data appropriately to measure your research question.  If your study will not use an instrument to collect data because your data is archival and already exists, you will discuss your process for data retrieval.

Some examples in below link

Many people believe that the use of biometrics is an invasion of privacy. For example, an eye scanning device records the inner structure of a person’s eye and stores that image in a database. Critics worry that databases of human traits used to maintain corporate security may actually pose a privacy threat to individuals, if such data were used in other ways. In your view, are such concerns justified? Why or why not?