Submit a 3 page concept paper IAW APA format on an approved topic (see pre-approved topics in the syllabus).
The TOPIC WILL BE “Government vs. commercial organization security issues”
Paper organization will include (use as headings):
Question 1
Suppose that you are employed as a data mining consultant for an Internet search engine company. Describe how data mining can help the company by giving specific examples of how techniques, such as clustering, classification, association rule mining, and anomaly detection can be applied.
Question 2
Identify at least two advantages and two disadvantages of using color to visually represent information.
Question 3
Consider the XOR problem where there are four training points: (1, 1, −),(1, 0, +),(0, 1, +),(0, 0, −). Transform the data into the following feature space:
Φ = (1, √ 2×1, √ 2×2, √ 2x1x2, x2 1, x2 2).
Find the maximum margin linear decision boundary in the transformed space.
Question 4
Consider the following set of candidate 3-itemsets: {1, 2, 3}, {1, 2, 6}, {1, 3, 4}, {2, 3, 4}, {2, 4, 5}, {3, 4, 6}, {4, 5, 6}
Construct a hash tree for the above candidate 3-itemsets. Assume the tree uses a hash function where all odd-numbered items are hashed to the left child of a node, while the even-numbered items are hashed to the right child. A candidate k-itemset is inserted into the tree by hashing on each successive item in the candidate and then following the appropriate branch of the tree according to the hash value. Once a leaf node is reached, the candidate is inserted based on one of the following conditions:
Condition 1: If the depth of the leaf node is equal to k (the root is assumed to be at depth 0), then the candidate is inserted regardless of the number of itemsets already stored at the node.
Condition 2: If the depth of the leaf node is less than k, then the candidate can be inserted as long as the number of itemsets stored at the node is less than maxsize. Assume maxsize = 2 for this question.
Condition 3: If the depth of the leaf node is less than k and the number of itemsets stored at the node is equal to maxsize, then the leaf node is converted into an internal node. New leaf nodes are created as children of the old leaf node. Candidate itemsets previously stored in the old leaf node are distributed to the children based on their hash values. The new candidate is also hashed to its appropriate leaf node.
How many leaf nodes are there in the candidate hash tree? How many internal nodes are there?
Consider a transaction that contains the following items: {1, 2, 3, 5, 6}. Using the hash tree constructed in part (a), which leaf nodes will be checked against the transaction? What are the candidate 3-itemsets contained in the transaction?
Question 5
Consider a group of documents that has been selected from a much larger set of diverse documents so that the selected documents are as dissimilar from one another as possible. If we consider documents that are not highly related (connected, similar) to one another as being anomalous, then all of the documents that we have selected might be classified as anomalies. Is it possible for a data set to consist only of anomalous objects or is this an abuse of the terminology?
Lab #1 — Building a Calculator
Your task for Lab #1 is to build a calculator in Java that has two modes, controllable by command-line options postfix and infix. In both modes the calculator will read lines of input from standard input. For each input line, the calculator will evaluate the expression that was input and print the result on a separate line. The program ends when it encounters the EOF character,similar to the behavior of most Unix utilities.
To simplify matters regarding dealing with different types of numbers, in this assignment, all numbers are to be represented internally as either Java floatprimitives or Floatobjects depending on your implementation choices.
Your calculator will implement the following operations:
Your calculator will implement expressions containing either a sole number or operations applied to numbers.
Mode #1 — Postfix Notation
The first mode that you will implement is one where the calculator accepts anexpression that is expressed in postfix notation. For those of you familiar with HP’s line of scientific and graphing calculators, postfix notation is also known as RPN or Reverse Polish Notation, in honor of the Polish logician Jan Łukasiewicz who invented Polish notation, also known as prefix notation.
Here are examples of expressions written in postfix notation with their conversions to infix notation and their evaluations:
2 3 +
2 + 3
5
2 3 + 5 *
(2 + 3) * 5
25
2 3 5 * +
2 + (3 * 5)
17
2 3 2 ^ * -10 –
2 * (3 ^ 2) – -10
28
How an RPN calculator works internally is as follows: it maintains an internal stack that is used to store operands and intermediate results. Let’s use the expression “4 3 + 5 *” as an example. The first thing that we do is lexical analysis on the input string by first splitting the string by its whitespace characters and then performing the proper type conversions on the numbers, resulting in a list that looks like this:
[4.0, 3.0, “+”, 5.0, “*”]Next, we iterate through the list. For each number, we push it onto the stack. Once we reach an operator on the list, we pop the stack twice, perform that operation on the popped numbers, and then push the result onto the stack. In this example, the elements 3.0 and 4.0 are popped from the stack. We then perform the “+” operation on the second and first elements popped from the stack (order matters for “-”, “/”, and “^”), and then push the result (12.0) onto the stack. Then, as we continue iterating through the list, we encounter 5.0, and thus we push it on the stack, resulting in a stack with the elements 12.0 (bottom) and 5.0 (top). Finally, the last token in the list is “*”, and so we pop the stack twice, multiplying 5.0 and 12.0 to get 60.0, and then we push it back on the stack.
When we have exhausted the list of tokens, we pop the stack and print the popped value as the result of the expression.
One of the nice properties of postfix notion is the lack of a need to specify operator precedence. It is this property that makes it possible to implement an RPN calculator without the need for specify a formal grammar for expressions. In fact, there are full-fledged programming languages such as Forth and PostScript that use postfix notation and rely on a stack.
Mode #2 — Infix Notation
Unlike a postfix calculator where parsing is a very straightforward task, parsing is not as straightforward in infix notation, since you have to concern yourself with expressions of arbitrary length and operator precedence. Your calculator will have to properly implement the PEMDAS (parentheses, exponents, multiplication, division, addition, subtraction) order of operations that are from elementary algebra.
Thankfully with the help of parser generators such as ANTLR, you won’t have to deal with the labor of implementing parsing algorithms.
Here is an excellent tutorial for using ANTLR:https://tomassetti.me/antlr-mega-tutorial/ (Links to an external site.). Please also refer to the main ANTLR website athttps://www.antlr.org (Links to an external site.).
Your goals are the following:
Some Examples:
$ java Calculator postfix
Calculator> 2 4 * 2 ^ 10 –
54
Calculator> 5
5
Calculator> 8 24 + 9 –
23
$ java Calculator infix
Calculator> (2 * 4)^2 – 10
54
Calculator> 5
5
Calculator> 8 + 24 – 9
23
Deliverable:
A collection of Java and ANTLR source code files in a *.zip archive, where the main method is located in a class called Calculator and in a file called Calculator.java.
Grading Rubric:
Mode #1 (Postfix Notation): 30%
Mode #2 (Infix Notation Grammar and Parsing): 50%
Mode #2 (Infix Notation Evaluation): 20%
Note:Your code must compile in order for it to receive any credit; any submission that does not compile will receive a grade of 0%.
Assignment:
Provide a reflection of at least 500 words (or 2 pages double spaced) of how the management of the organization can enhance their organizations’ ** (( NETWORK SECURITY.))** If you are not currently working, share how this could be applied to an (( EMPLOYMENT OPPORTUNITY IN YOUR FIELD OF STUDY {{ COMPUTER SCIENCE }} ).
Requirements:
Provide a 500 word (or 2 pages double spaced) minimum reflection.
Use of proper APA formatting and citations. If supporting evidence from outside resources is used those must be properly cited.
Demonstrate a connection to your current work environment. If you are not employed, demonstrate a connection to your desired work environment.
ENSURE YOUR WORK IS STRUCTURE LIKE THE SAMPLE PAPER
You should be REPORTING EVIDENCE and EXAMPLES from what you read.
Find, Read, and Share – THREE related sources of information
Report – Three things about the topic that you want to remember forever
Answer the following questions:
1) Explain the use of a Flasher Box
2) Why would the investigator be considered with EEPROM?
3) Explain the important points in evaluating dates and times on a device?
Your response to the DQ must be a minimum of 400 words. You must provide references for your response (APA format). You will need to reply to two (2) other fellow student’s posts (See the syllabus). The
Your responsibility is to aggregate the data to and showcase obvious trends in school performance.
Your final report should include each of the following:
As final considerations:
Analyze the differences between the four variations of the model. Select a company (can be fictious), briefly describe the company and recommend which type of model would you recommend and why. Provide rationale for your recommendation
The paper should be 3-5 pages and include a title page and a references page in APA format (title page and references do not count as page count).
In the first milestone, you identified a recent security incident that took place. There were multiple incidents that were chosen such as Capital One,Target, OPM, Equifax, Home Depot, and so many more.
In the second milestone, you will access the administrative, physical, and technical controls of the particular company then determine which one of these administrative, physical, and technical controls were not secure and led to the security incident.
This week you will work on Milestone 3. In milestone 3 you are building upon your first two milestones and describe the mitigation strategy, results, etc. on the organization. For example, if you chose Equifax in milestone 1 you introduced your topic, in milestone 2 you described the controls that surrounded the organization, and now in Milestone, you will evaluate the results of the security incident. All of these milestones tie into each other as you evaluate the circumstances of the incident and the results.
The minimum is 2 written pages and this does not include the title or reference page. You must properly APA format your response.
What to do
Identify a physical or computer layout problem – for example, have you ever noticed the mute button on some video conferencing services – they suck? What about the doors to the coolers are Sheetz (this is a regional convenience store)
READ the assigned chapters from Norman and Shneiderman for the week, propose a solution to the problem you have identified.
Use programming frameworks, mock-up tools, hand drawings, and/or other methods to construct a solution to the identified problem.
There are several other great tools out therefor prototyping
What to turn in
Create a presentation (with voice), or a paper, or a video (via VidGrid) detailing the following:
NOTE: You must use citations whenever appropriate. I encourage you to seek external examples and do additional reading on the topic.
https://drive.google.com/file/d/1V-oEaLSon-7lI-VXWG0AgPPmoxjQyMCk/view?usp=sharing
