Write a fully executed R-Markdown program and submit a pdf file solving and answering questions listed below under Problems at the end of chapter 5. For clarity, make sure to give an appropriate title to each section.
Problem 5: (a, b, c,)
Problem 6: (a, b, c, d)
this is book name
Data Mining for Business Analytics: Concepts, Techniques, and Applications in R
you can get online
After reading the assigned chapter please answer the following questions. Make sure you ask a question and answer another student question as well.
1) How is personal information safeguarded? Provides some standard procedures mainly used by businesses to safegaurd their data. 2) What are the vulnerabilities? Provides some examples. 3) What do we mean by secured system? Name some of the best practices for securing your personal computer.
Please, with 300 words plus, elaborate on each of these attacks and provide genuine examples and with supporting facts.
To Ensure Getting a Full-Grade, check the Rubric as I will be using it to grade you!!!
Recall that a magic square is a 2-dimensional square array with n rows and n columns where each row,
col, and diagonal add up to the same value. The value that every row, column, and diagonal adds up to is
called the magic sum. For example, here is a magic square for the case n = 4 with a magic sum of 34:
6 10 7 11 3 8 9 14 12 1 16 5 13 15 2 4
If a size n magic square contains all of the number from 1 to n2 exactly once (as in the example above) we
call this a standard magic square and it is not hard to show that the magic sum of a standard size n magic
square is n×(n2 +1)
2 .
You are to write a program that will find standard magic squares in three different ways, by
implementing the following 3 algorithms.
Purely random. Randomly put the numbers from 1 to n2 into an n × n array and then check to see if it is
a magic square. Fill the array from top to bottom, left to right order. In other words, first fill the first row
from left to right, then the second row, etc. Do this repeated until either a magic square is found or some
limit for the number of tries is reached. The limit will be a parameter to your magic square method.
The hardest part of implementing this is finding an efficient way to it. For example, in the 4 × 4 case,
how do we get the numbers from 1 to 16 randomly into the array? The way I did it was to create a 16
element array (in general you will create a n × n array) and put the numbers from 1 to 16 into that array. I
then randomly found one of the 16 elements, put it into the magic square array, and switched that element to
the end of the array so that I would never use it again. For the next step I randomly selected an element from
the first 15 spots in the array, put that in the magic sum array, and then swapped it so that it is 1 from the end
of the array.
Here’s how the example above got started. Let’s call my 16-element array num. It starts looking like this:
num: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
The algorithm found a random location in the 16-element array, in this case it’s location 5 with value 6, put
the 6 in the first position of the magic square and then swapped that 6 with 16 at the end of the num array,
giving us:
num: 1 2 3 4 5 16 7 8 9 10 11 12 13 14 15 6
Next the algorithm found a random location in the first 15 spots of num, in this case it was 10 which was
then put into the magic square and moved to the right of num giving us:
num: 1 2 3 4 5 16 7 8 9 15 11 12 13 14 10 6
Continue this until the entire magic square array is filled.
If you have an alternative way for doing this bring it up in a Discussion.
For finding random numbers you can either use Math.random or the Random class. Look these up in the
Java docs here and here. I think the Random class is easier to use but just be sure not to instantiate too many
Random objects. You only need 1.
Last element of each row not random. This algorithm is the same as the purely random algorithm
except when placing an element at the end of the row do not choose randomly but select the only element
that works based on the magic sum. Looking at the 4 × 4 example above, the algorithm would have chosen
6, 10, and 7 randomly but now the only number that will work for the last spot is 11, so simply place that
number in that spot in the array. The implementation of this is going to be similar to the purely random one,
but you will need some addition code or methods to find the number for that last spot of each row. Don’t
forget that it might not always be possible to find that last value. For example, suppose the first 3 random
values put in the magic square array are 2, 3, and 5. Since the magic sum of a 4 × 4 array is 34 we would
need the value 24, but the largest number available is 16.
You should notice that this algorithm finds solutions much faster than the purely random one. In fact, my
purely random program only found solutions to n = 3 cases in a reasonable amount of time. n = 4 would
frequently take more than 100,000,000 tries. But n = 4 works well with this algorithm, finding solutions
quite quickly. The average number of tries necessary for this algorithm to find a magic square is just a little
over 5,000,000.
Pair heuristic. This only works for cases where n is even and I will describe it for the n = 4 case. Recall
that the magic sum for an n = 4 array is 34. Put elements randomly into the rows in pairs where each pair
sums to 17, ½ the magic sum value. For example, here is a magic square found using that algorithm.
1 12 5 16 15 9 8 2 14 6 11 3 4 7 10 13
In this case the first random value found was 5. It was randomly placed in the first row. Notice this is
different from how the other two algorithms work. 12 is the value that pairs with 5 to get to 17 so we place
12 randomly in one of the remaining open positions. The next random number found was 1 and it was placed
randomly in one of the remaining positions and then its pair, 16, was placed in the only remaining spot in the
first row.
This algorithm performs considerably better than the previous algorithm, requiring on average of only
about 600,000 tries to find a solution.
I look forward to your thoughts about other general algorithms that will allow us to find magic squares
for even larger n’s.
Below is an outline of the class and the methods that need to be implemented for that class. Do not make
any changes to the classes, variables, names, etc. Just add code. Questions? Start or continue a Discussion.
This assignment is as much about following instructions as it is about programming. Be sure your
methods do exactly what is expected of them and all rules mentioned below and in Canvas and class
discussions are followed.
What follows are general rules that you must follow for this and, as applicable, all other programs you
write in this class. Failure to follow these rules will cost you points.
1. I will eventually post a final test program. A sample test program is already posted to help get you
started. Don’t wait for my final test program to appear to start debugging your program. You should
begin testing with your own test programs. Also, the final test program I post may not be the same test
program I run on your programs. You cannot assume your program is correct just because it works on the
posted test program.
2. Submit your program through Canvas with the name prog1.java. Be sure that my main (test) program is
in a different file from your class(es) and you should not submit my test program. Also, do not make your
classes “public”. If you deviate from any of these rules you will lose points because doing so makes it
much more difficult for me to manage and test your programs.
3. The top of your prog1.java file (and all java code that you turn in to me in the future) should begin with
comments that show: (i) Your name; (ii) Comp 282 and clear mention of what time your class meets; (iii)
The assignment number; (iv) The date the assignment was handed in (which is not necessarily the same
as the due date); (v) A brief description of what is contained in the file.
4. For all Java code you turn in:
a) Choose clear and suggestive variable names.
b) Be sure lines do not wrap to the first column of the next line or disappear off the end of the page.
c) Use comments generously to describe how your methods work. Comments should appear
inside your methods, too – not just at the top. That said, don’t overdo the comments.
d) There should be no more than one return statement in any method.
e) Do not use break statements to exit loops.
f) Do not use global variables. If you are not sure if you are using them, ask.
g) Programs should be 100% your own work, as stated in the syllabus
Answer each of these questions in a paragraph with at least five sentences: Include the question and number your responses accordingly. Provide a citation for each answer.
1. Describe Digital Literacy (how to know what is real on the web).
2. None of these people exist. What does this mean to you?
3. Why is Wikipedia more reliable than a paper encyclopedia?
4. How useful are crowdsourced answers?
5. What are some drawbacks to crowd-sourced answers?
6. Do people generally utilize the diversity of sources on the Internet effectively?
7. How reliant are we and how reliant should we be on getting our news from social media?
8. How do humans remain vigilant when we turn over authority to computers? Have you tried to navigate without GPS?
9. If models are simplifications of reality, why do we rely on them?
10. Why was this model, used by Amazon for hiring, wrong?
11. Why did Skynet declare war on the human race?
First summarize the purpose of the presentation and the data being analyzed. Then summarize the questions posed in the analysis of the data and the conclusions formed from the analysis. Finally, briefly outline what is contained in the rest of the presentation.
Give a description of the most important data used for analysis in this section. This should include outlining the types of data, count, any pre-processing needed, if there were missing values and steps taken, any need for formatting, normalizing, or transforming categorical values to quantitative variables.
Give the methods you used to gather the data and the set up used for analysis.
Include in this section what was analyzed and the conclusions you made from the analysis. Insert any charts you created from the data in this section. Should be based on analysis techniques that have been covered in class including: descriptive statistics, correlations, ANOVA, linear regression, and multiple linear regression.
Restate the questions you raised in the Introduction, as well as the most relevant results from the analysis. If your presentation contains more than one set of data or analysis, this is the place to compare the different results as needed. Include any questions or recommendations for additional data as needed.
I have attached the files and you have to make slides from these files according to the instructions. You will not need anything else as I already attached the files
Information Technology and Organizational Learning Assignment:
Note the assignment should have the information from the Information Technology and Organizational Learning textbook.
The above submission should be one -page in length and adhere to APA formatting
standards.
*Remember the APA cover page and the references (if required) do not count towards the page length*
TEXTBOOK
Title: Information Technology and Organizational Learning
ISBN: 9781351387583
Authors: Arthur M. Langer
Publisher: CRC Press
Publication Date: 2017-10-17
Edition: 3rd ED.
Scenario
Changing access controls can have some undesirable effects. Therefore, it is important to carefully consider changes before making them and provide mechanisms to reverse changes if they have unexpected consequences.
Always Fresh management has asked you to develop procedures for changing any access controls. The purpose of these procedures is to ensure that staff:
§ Understand and document the purpose of each access control change request
§ Know what access controls were in place before any changes
§ Get an approval of change by management
§ Understand the scope of the change, both with respect to users, computers, and objects
§ Have evaluated the expected impact of the change
§ Know how to evaluate whether the change meets the goals
§ Understand how to undo any change if necessary
Create a guide that security personnel will use that includes procedures for implementing an access control change.
The procedure guide must contain the steps Always Fresh security personnel should take to evaluate and implement an access control change. You can assume any change requests you receive are approved.
Ensure that your procedures include the following:
§ Status or setting prior to any change
§ Reason for the change
§ Change to implement
§ Scope of the change
§ Impact of the change
§ Status or setting after the change
§ Process to evaluate the change
3 references needed in APA format
1000 words
In your current business environment, or one you were in at one time, which of the four cloud computing service models do you think might be good for that company to consider?
How would you implement specific cloud computing service models in order to change the way that company does business?
I work at ManTech International Corporation.
Articles, Websites, and Video References:
Ristov, S., Gusev, M., & Kostoska, M. (2012). Cloud computing security in business information systems.
Types of cloud computing. (n.d.). Amazon Cloud Services.
1. Based upon the current state of the art of robotics applications, which industries are most likely to embrace robotics? Why?
2. Watch the following two videos: https://www.youtube.com/watch?v=GHc63Xgc0-8 and https://www.youtube.com/watch?v=ggN8wCWSIx4 for a different view on impact of AI on future jobs. What are your takeaways from these videos? What is the more likely scenario in your view? How can you prepare for the day when humans indeed may not need to apply for many jobs?
3. Conduct research to identify the most recent developments in self-driving cars.
Please write a research paper of about 22-25 pages.
Attached below are the requirements for the paper.
Topic: The relationship between project management and overall performance of a company
