All posts by : chebby

In the Group Discussion board for Data Visualization, answer the questions below.

o Go to Tableau Public gallery at https://public.tableau.com/en-us/s/gallery and find 2 to 3 vizzes you like, click on the vizz and then download them with the button in the bottom-right corner to try to understand how they were made.

o Go to Stephen Few’s blog “The Perceptual Edge” ( perceptualedge.com) and to the section of “Examples.” In this section, he provides critiques of various dashboard examples. Read a handful of these examples.

o Go to dundas.com. Select the “Gallery” section of the site. Once there, click the “Digital Dashboard” selection. You will be shown a variety of different dashboard demos. Run a couple of the demos.

Discuss these questions with the group:

• which 2 or 3 vizzes interested you?
• what were some of the good design points and bad design points of the vizzes & demos?
• What sorts of information and metrics were shown on the vizzes & demos?

  1. Operational Excellence2. Information Governance3. Data Science and Big Data Analytics4. InfoTech Import in Strat Plan5. Emerging Threats and Countermeasures6. Cloud Computing7.InfoTech in a Global Economy  I want to some points for these will useful for my job duties1. Azure Cloud storage2. Dynamics CRM(Customer Relationship Management)3. Developer

• JavaScript
• Angular JS
• JQuery
• HTML/ HTML5, CSS
• SharePoint
• SSIS & SSRS

You shall write a C++ program that:

1. Reads an arbitrary number of whitespace-delimited tokens from standard input.
2. Determines and prints (to standard output) two decimal integer values:
   1. The number of input tokens that are valid Scrabble words (case-insensitive), i.e. those that can be found in /srv/datasets/scrabble-hybrid.
   2. The total number of points that all those words would be worth in Scrabble, according to the letter values in /srv/datasets/scrabble-letter-values.

Specific Requirements

1. You may assume that the number of valid words and the total number of points will not exceed the range of an unsigned 64-bit integer.
2. Open and read the contents of each relevant data file exactly once.
3. Make sure to use STL components that will avoid any gross inefficiencies (excessive computation and/or storage) in your program. Your program should at least be able to process each of the example inputs below in no more than 5 seconds, on our server.
4. Print the two integer values in the order specified above, and make sure your output contains no other numeric decimal values. Otherwise, the format of output is up to you.

 Discussion : Define and describe virtualization. List the pros and cons of virtualization. 

Paper requirements:

For week 8, you will write a paper on virtualization. The following are the items to discuss in the paper:

• Define and describe virtualization.
• List the pros and cons of virtualization.
• List reasons why companies should virtualize.
• Define and describe the hypervisor. 
• Define and describe green computing.

Paper requirements:

• Minimum 1200 words (excluding title page, table of contents, abstract, and references pages)
• Minimum of four (4) references
• Format your paper consistent with APA guidelines
• When submitting the assignment, please ensure you are submitting as an attached MS Word document.

Please review Chapter 32: Constructive Dialogue and ERM: Lessons from the Financial Crisis Case and provide response for following questions.

1. What are the preconditions for conducting constructive dialogue in an organization?

2. Is effective risk management possible without constructive dialogue?

3. What are the forces that tend to undermine effective risk management in an organization?

4. Given its obvious value in helping an organization to understand the major risks that could prevent it from accomplishing its mission and objectives, why was the financial sector, including a risk-sensitive organization such as Goldman Sachs, so slow in adopting ERM?

You are required to respond to the questions thoroughly, in 250 -to-300 words for each question. Be sure to include at least three reference sources. APA rules for formatting, quoting, paraphrasing, citing, and listing of sources are to be followed.

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.