All posts by : chebby

 Course : InfoTech Import in Strat Plan 

Provide a reflection of at least 500 words (or 2 pages double spaced) of how the knowledge, skills, or theories of this course have been applied, or could be applied, in a practical manner to your current work environment. If you are not currently working, share times when you have or could observe these theories and knowledge could be applied to an employment opportunity in your field of study. 

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.
• Share a personal connection that identifies specific knowledge and theories from this course.
• Demonstrate a connection to your current work environment. If you are not employed, demonstrate a connection to your desired work environment. 
• You should not provide an overview of the assignments assigned in the course. The assignment asks that you reflect how the knowledge and skills obtained through meeting course objectives were applied or could be applied in the workplace.

You are ready to prepare the final version of the EDMS business requirements document (BRD) incorporating the assignments you completed and faculty feedback provided for Weeks 1–5. You will present your BRD to the Board of Directors for Hollywood Organic Co-op.

Write at least 4 to 6 pages for the final business requirements document for the new EDMS and prepare an 8- to 10-slide media-rich presentation summary of the BRD to the Hollywood Organic Co-op’s Board of Directors.

Analyze the critical components of your information security program as it relates to Hollywood Organic Co-op. Justify how the security objectives for the EDMS align with the business objectives.

Identify and describe document access controls and best practices, including:

Viewing

Editing

Copy/paste (including screen capture)

Printing

Forwarding e-­mail containing secured e­-documents

Identify, define, and describe document access policies and best practices including:

Text documents

Spreadsheets

Financial statements

E-mail messages

Policy and procedure manuals

Research

Customer and project data

Personnel files

Medical records

Intranet pages

Other sensitive information

Identify, define, and describe all stages of the document life cycle and best practices including:

Creation

Storage

Categorizing

Metadata tagging

Delivery or sharing

Repurposing

Review and reporting archiving and/or destruction

Format citations according to APA guidelines.

 Hypothetically speaking, you are assigned to a committee of three to decide on a dress code for Campbellsville University Staff and Faculty. All three committee members must agree to pass this policy. In this situation you are one of the two agreeing to a dress code. What steps might you take to gain the cooperation of the third party after the policy has been initiated. 

Need 350 words content.

Topic: Perform a Vulnerability Assessment of your place of employment or living area. If you use your work area make sure you inform the Security Manager to get permission as to what you are doing. If you live in a gated community inform the security guard of your activities.

Instructions: Please download the Assignment 1 Vulnerability Assessment template (MS Word), which is already in APA 7 format, using size 12 Times New Roman font, 1-inch margins, TOC, Headings and Reference page. If you insert images or tables in your report make sure you label them appropriately according to APA. (click here for link).

For this assignment: The 4 Heading-1s are required. Each Heading-1 must have at least 3 Heading-2s. Each Heading must have at least 2 properly formatted paragraphs with 3 properly formatted sentences each. Once completed name your file: YourName_Assignment_1_Vulnerability_Assessment.docx and submit to the appropriate assignment folder.

Assignment 1 Vulnerability Assessment Template.docx

Also review the additional files attached for detailed information on Vulnerability Assessments.

• CPTED Security Handbook.pdf
• CPTED-Audit-Checklist.pdf
• CPTED-Guidebook.pdf
• CPTEP Site Survey Presentation.pdf
• FEMA Presentation.pdf

an aqurium is 10m long, 5m wide and 6m deep 

what is the volume of the aquarium?

Need to drawing class diagram

Discuss Shared technology vulnerabilities in the cloud?

Propose and defend a topic for your final project.  Write  500 words or more explaining why this topic is important for your peers to understand. Be focused and specific. 

Use at least five sources. Include at least 3 quotes from your sources enclosed in quotation marks and cited in-line by reference to your reference list.  Example: “words you copied” (citation) These quotes should be one full sentence not altered or paraphrased. Cite your sources.

Pick a manufacturing industry that is transportation and apply data mining to an individual step in the process. Please also address decision tree classifiers as part of the research paper.

Need 4 pages research paper with references. Use proper APA formatting. Do not plagiarize. Cite other people’s work; they have put much effort into getting their work published and deserve to be recognized.

 Domino Loops in Scheme Dominoes are small rectangular game tiles with dots embossed at both ends. They are used to play a variety of games involving patterns on a tabletop. A standard “doublesix” domino set has 28 tiles: one for each possible pair of values from (0 . 0) to (6 . 6). In general, a “double-N” domino set would consist of (???? + 1)(???? + 2)/2 tiles. One possible pattern to make with dominos is a loop, in which the tiles are laid in a circle, end-to-end, with identical numbers of spots on all adjacent ends. In a doubletwo domino set, with six tiles, ((0 . 0) (0 . 1) (1 . 1) (1 . 2) (2 . 2) (2 . 0)) is a domino loop. You are to write a program in Scheme that prints all domino loops in a double-N domino set. Specifically, you are to flesh out the following program: (define domino-loops (lambda (n) (filter loop? (permutations (dominoes n))) ) ) (define filter (lambda (f L) ; return list of those elements in L which pass through filter f (if (null? L) L (let ((N (f (car L)))) (if (null? N) (filter f (cdr L)) (cons N (filter f (cdr L))) ) ) ) ) ) The expression (domino-loops 2) would evaluate to (((2 . 2) (2 . 1) (1 . 1) (1 . 0) (0 . 0) (0 . 2)) ((2 . 2) (2 . 0) (0 . 0) (0 . 1) (1 . 1) (1 . 2)) ((2 . 1) (1 . 1) (1 . 0) (0 . 0) (0 . 2) (2 . 2)) ((2 . 0) (0 . 0) (0 . 1) (1 . 1) (1 . 2) (2 . 2)) ((1 . 2) (2 . 2) (2 . 0) (0 . 0) (0 . 1) (1 . 1)) ((1 . 1) (1 . 2) (2 . 2) (2 . 0) (0 . 0) (0 . 1)) ((1 . 1) (1 . 0) (0 . 0) (0 . 2) (2 . 2) (2 . 1)) ((1 . 0) (0 . 0) (0 . 2) (2 . 2) (2 . 1) (1 . 1)) ((0 . 2) (2 . 2) (2 . 1) (1 . 1) (1 . 0) (0 . 0)) ((0 . 1) (1 . 1) (1 . 2) (2 . 2) (2 . 0) (0 . 0)) ((0 . 0) (0 . 2) (2 . 2) (2 . 1) (1 . 1) (1 . 0)) ((0 . 0) (0 . 1) (1 . 1) (1 . 2) (2 . 2) (2 . 0))) (NB: order in this list doesn’t matter. If your code prints the loops in a different order that’s fine.) For larger values of N, where N is even, the number of loops grows exponentially. Note, however, that there are no domino loops when N is odd. There are many possible ways to write your program. Perhaps the simplest (but not the fastest) is to generate all permutations of a list of the tiles in the domino set, and check to see which are loops. You are required to adopt this approach, as described in more detail below. You can implement a more efficient solution for extra credit. Note that the number of permutations of a double-N domino set is ((???? + 1)(???? + 2)/2)!. For N=6 (the standard number), this is about 3.05×1029 . Clearly you can’t afford to construct a data structure of that size. My own (slow) solution to the assignment generates the double-2 loops quite quickly. It takes a couple minutes to determine that there are no double-3 loops. When asked for double-4 loops it thrashes. Requirements You must begin with the code shown above. These three sub-functions will be tested individually, giving partial credit for the ones that work correctly: 1. (dominoes N) returns a list containing the (N+1)(N+2)/2 tiles in a double-N domino set, with each tile represented as a dotted pair (an improper list). Order doesn’t matter. (dominoes 2) ==> ((2 . 2) (2 . 1) (2 . 0) (1 . 1) (1 . 0) (0 . 0)) 2. (permutations L) given a list L as argument, generates all permutations of the elements of the list, and returns these as a list of lists. (permutations ‘(a b c)) ==> ((a b c) (b a c) (b c a) (a c b) (c a b) (c b a)) (Again, order doesn’t matter, though obviously all permutations must be present.) Hint: if you know all the permutations of a list of (N-1) items, you can create a permutation of N items by inserting the additional item somewhere into one of the shorter permutations: at the beginning, at the end, or in-between two other elements. 3. (loop? L) given a list L as argument, where the elements of L are dotted pairs, returns L if it is a domino loop; else returns the empty list. Note that the first and last dominoes in the list must match, just like the ones in the middle of the list. Also note that a straightforward implementation of your permutations function will give you lists that should be considered loops, but in which you need to “flip” certain dominoes in order to make all the ends match up. For example, in a double-2 domino set, ((0 . 0) (0 . 1) (1 . 1) (1 . 2) (2 . 2) (0 . 2)) should be considered a domino loop, even though the last tile needs to be flipped. Important: ⚫ You are required to use only the functional features of Scheme; functions with an exclamation point in their names (e.g. set!) and input/output mechanisms other than load and the regular read-eval-print loop are not allowed. ⚫ Output function may not be needed. Returning the result list is sufficient. ⚫ Defining any helper function(list) is allowed, but modifying the interface of three functions isn’t. ⚫ Make sure your scheme program is workable in different PC. (Test it on your friend’s PC) 10 points deducted for the inexecutable program. 

cryptography