All posts by : chebby

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

At least one scholarly source should be used in the initial discussion thread. Be sure to use information from your readings and other sources from the UC Library. Use proper citations and references in your post.

Please run a Google search of the term, “United States Supreme Court Carpenter v. United States 2018.” 

Please write an essay of not less than 500 words, summarizing the court’s decision.

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.

Should request prior authorization of the company to be addressed to ensure that all students are working on unique companies.

Even though this is a technical document, for academic purposes, all sources should be cited and referenced.

You may modify some of the sections per the company they have selected but all students will need to complete a DR Plan for the Portfolio Requirement. 

SafeAssign should be turned on and reviewed since it will flag a lot of the common elements but we want to make sure the students are writing the content from scratch.

How plagiarism detector is coded in python

Need a research paper. Please open the word file to see the guidelines. I have provided a template so you can follow that or you can have your own style. But strictly follow the guidelines provided. I need someone who has knowledge in cybersecurity. 

The attachments have all requirements.

 Chapter 10 introduced ten blockchain implementation obstacles. choose two obstacles from those discussed in chapter 10, then describe them and how they could disrupt blockchain acceptance. Also, describe how you would overcome each of these obstacles. Then think of three questions you’d like to ask other students and add these to the end of your thread. The questions should be taken from material you read in Chapter 10 or 11.  

In 200 words,

Do a bit  if research into File Inclusion Vulnerability.

• What is it?
• Why is it dangerous?
• What is the difference of low and remote inclusion?
• What methods can me employed to prevent a security breach?
• What programming languages are vulnerable to this type of attack.

Question 1

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 2

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?

Extremely Urgent