Directions:

For this post, select a current traumatic event in the news involving children and/or adolescents. Consider possible PTSD symptoms commonly seen with this type of trauma. Also, consider how you might be affected if you were to work with a child or adolescent who was traumatized by this event.

With these thoughts in mind:

Post a brief description of the traumatic event you selected. Then, describe two symptoms of posttraumatic stress disorder (PTSD) commonly seen with this type of trauma and explain why. Be specific. Finally, explain one way you might be affected when working with children or adolescents who have experienced this traumatic event and why.

FILLER TEXT

FILLER TEXT(5), 448-454. FILLER TEXT

FILLER TEXT

Looking for a solution written from scratch with No plagiarism and No AI?

WHY CHOOSE US?

We deliver quality original papers	Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected
Free revisions	We offer our clients multiple free revisions just to ensure you get what you want.
Discounted prices	All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount
100% originality	We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI
On-time delivery	We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay

 

1.

Consider the problem of finding a path in the grid shown in Figure 3.14 from the position ss to the position gg. A piece can move on the grid horizontally or vertically, one square at a time. No step may be made into a forbidden shaded area.

Figure 3.14: A grid-searching problem

(a)

On the grid shown in Figure 3.14, number the nodes expanded (in order) for a depth-first search from ss to gg, given that the order of the operators is up, left, right, and down. Assume there is cycle pruning. What is the first path found?

(b)

On a copy of the same grid, number the nodes expanded, in order, for a greedy best-first search from ss to gg. Manhattan distance should be used as the evaluation function. The Manhattan distance between two points is the distance in the xx-direction plus the distance in the yy-direction. It corresponds to the distance traveled along city streets arranged in a grid. Assume multiple-path pruning. What is the first path found?

(c)

On a copy of the same grid, number the nodes expanded, in order, for a heuristic depth-first search from ss to gg, given Manhattan distance as the evaluation function. Assume cycle pruning. What is the path found?

(d)

Number the nodes in order for an A∗A* search, with multiple-path pruning, for the same grid. What is the path found?

(e)

Show how to solve the same problem using dynamic programming. Give the cost_to_goal value for each node, and show which path is found.

(f)

Based on this experience, discuss which algorithms are best suited for this problem.

(g)

Suppose that the grid extended infinitely in all directions. That is, there is no boundary, but ss, gg, and the blocks are in the same positions relative to each other. Which methods would no longer find a path? Which would be the best method, and why?

2.

This question investigates using graph searching to design video presentations. Suppose there exists a database of video segments, together with their length in seconds and the topics covered, set up as follows:

Segment	Length	Topics covered
seg0	10	[welcome]
seg1	30	[skiing, views]
seg2	50	[welcome, artificial_intelligence, robots]
seg3	40	[graphics, dragons]
seg4	50	[skiing, robots]

Represent a node as a pair:

⟨To_Cover,Segs⟩,⟨T⁢o⁢_⁢C⁢o⁢v⁢e⁢r,S⁢e⁢g⁢s⟩,

where SegsS⁢e⁢g⁢s is a list of segments that must be in the presentation, and To_CoverT⁢o⁢_⁢C⁢o⁢v⁢e⁢r is a list of topics that also must be covered. Assume that none of the segments in SegsS⁢e⁢g⁢s cover any of the topics in To_CoverT⁢o⁢_⁢C⁢o⁢v⁢e⁢r.

The neighbors of a node are obtained by first selecting a topic from To_CoverT⁢o⁢_⁢C⁢o⁢v⁢e⁢r. There is a neighbor for each segment that covers the selected topic. [Part of this exercise is to think about the exact structure of these neighbors.]

For example, given the aforementioned database of segments, the neighbors of the node ⟨[welcome,robots],[]⟩⟨[w⁢e⁢l⁢c⁢o⁢m⁢e,r⁢o⁢b⁢o⁢t⁢s],[]⟩, assuming that welcomew⁢e⁢l⁢c⁢o⁢m⁢e was selected, are ⟨[],[seg2]⟩⟨[],[s⁢e⁢g⁢2]⟩ and ⟨[robots],[seg0]⟩⟨[r⁢o⁢b⁢o⁢t⁢s],[s⁢e⁢g⁢0]⟩.

Thus, each arc adds exactly one segment but can cover one or more topics. Suppose that the cost of the arc is equal to the time of the segment added.

The goal is to design a presentation that covers all of the topics in MustCoverM⁢u⁢s⁢t⁢C⁢o⁢v⁢e⁢r. The starting node is ⟨MustCover,[]⟩⟨M⁢u⁢s⁢t⁢C⁢o⁢v⁢e⁢r,[]⟩, and the goal nodes are of the form ⟨[],Presentation⟩⟨[],P⁢r⁢e⁢s⁢e⁢n⁢t⁢a⁢t⁢i⁢o⁢n⟩. The cost of the path from a start node to a goal node is the time of the presentation. Thus, an optimal presentation is a shortest presentation that covers all of the topics in MustCoverM⁢u⁢s⁢t⁢C⁢o⁢v⁢e⁢r.

(a)

Suppose that the goal is to cover the topics [welcome,skiing,robots][w⁢e⁢l⁢c⁢o⁢m⁢e,s⁢k⁢i⁢i⁢n⁢g,r⁢o⁢b⁢o⁢t⁢s] and the algorithm always select the leftmost topic to find the neighbors for each node. Draw the search space expanded for a lowest-cost-first search until the first solution is found. This should show all nodes expanded, which node is a goal node, and the frontier when the goal was found.

(b)

Give a non-trivial heuristic function hh that is admissible. [Note that h(n)=0h⁢(n)=0 for all nn is the trivial heuristic function.] Does it satisfy the monotone restriction for a heuristic function?

Looking for a solution written from scratch with No plagiarism and No AI?

WHY CHOOSE US?

We deliver quality original papers	Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected
Free revisions	We offer our clients multiple free revisions just to ensure you get what you want.
Discounted prices	All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount
100% originality	We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI
On-time delivery	We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay

 

Critical Thinking: Security Policies (50 Points)

The policies that organizations put in place are similar to laws in that they are directives for how to act properly. Like laws, policies should be impartial and fair, and are often founded on ethical and moral belief systems of the people who create them. In some cases, especially when organizations expand into foreign countries, they experience a form of culture shock when the laws of their new host country conflict with their internal policies.

Suppose that SLS Corporation has expanded its operations into your country. Setting aside any legal requirements that SLS make to its policies to conform to your local laws, does SLS have an ethical imperative to modify its policies to better meet the needs of its stakeholders and their geographical region/country?

Directions:

• Your paper should be 4-5 pages in length, not including the title or reference pages.
• You must include a minimum of two (2) credible sources. Use the Saudi Digital Library to find your resources.
• Your paper must follow Saudi Electronic University academic writing standards and APA style guidelines, as appropriate.

There is SafeAssign Plagiarism Checker, If your score is above 25%, you will want to edit your assignment before submitting it for grading.

course name: CS562 – Enterprise Cybersecurity

Course Materials: Whitman, M. E., & Mattord, H. J. (2018). Principles of information security (6th ed.). Boston, MA: Cengage Learning. ISBN: 9781285448367

• Chapter 4: Planning for Security in Principles of Information Security
• INFOSEC Resources. (2018, February 6). Key elements of an information security policy. In General Security, Incident Response.
• INFOSEC Resources. (2019, February 16). Top 10 security awareness training topics for your employees. Security Awareness

Looking for a solution written from scratch with No plagiarism and No AI?

WHY CHOOSE US?

We deliver quality original papers	Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected
Free revisions	We offer our clients multiple free revisions just to ensure you get what you want.
Discounted prices	All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount
100% originality	We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI
On-time delivery	We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay

 

To start, please watch this video:

https://www.youtube.com/watch?v=OYzShF0mT0U

I would like this week’s reflection to be a chance to search inside yourselves and discover a bit more about your identity. An identity which you have the ability to create, and recreate, and then recreate again if you feel the urge to do so. Always remember, the footprint and impact you choose to leave on this planet and our society is YOUR choice. Contrary to all the naysayers, this is YOUR life. Contrary to all the negative energy you may come across that seems so hard to avoid and not let affect you, this is YOUR life.

One of the joys I hope to bring to your lives is the discovery that you do in fact control your attitude, your future, and the influence you have on others around you (whether good or bad, this is your choice). Unfortunately, there is a tremendous amount of hatred circumventing our existence. This hatred spreads like wildfire and causes much violence and unrest within and across the many cultures of the world. Where and when does it stop? It stops from the realization that not only do you NOT have to be a part of it, but you can actually reverse it by spreading kindness and compassion to others. Kindness and compassion are contagious and can be taught and learned.

One way I have learned to teach this is by showing others how to reflect on their daily habits and unveil the subconscious thoughts and attitudes that perpetuate these same habits. Meditation is an amazing tool to help one search inside themselves, by using brief moments in our chaotic daily lives to think, and exist, at a much deeper level through reflection and awareness. Slow, deep, full breaths help us slow down the world around us in order to see things a bit more clearly. Clearly enough to recognize the potential that you possess. The potential to help others in need. The potential to bring a greater sense of fulfillment to your own lives.

Now, please watch this video.

https://www.youtube.com/watch?v=Aw71zanwMnY

Take a moment at this point to sit up in a tall, comfortable position……. and breath…… slow…. deep…. breaths…. please take as long as feels good here before you continue….

Hopefully you are feeling a bit more relaxed and thinking a bit more clearly now. Maintaining your composure, please answer the following questions. Be honest. As always, no judgment on my end. Since your classmates may also be reading your post only share what you feel comfortable with others reading. *Be sure your total response is at least 500 words.

(1) Are you happy with what is currently going on in your life? Why? Why not?

(2) Envisioning your ideal future, what are a few major achievements you will fulfill?

(3) What are your honest thoughts about and past experiences with meditation? (I 100% promise I would never make a negative judgment based on your response).

(4) Why do you think you feel this way?

(5) Do you believe you are in control of your life? Why is this?

(6) What do you think is the connection between Search Inside Yourself and Intercultural Communication Competence?

Looking for a solution written from scratch with No plagiarism and No AI?

WHY CHOOSE US?

We deliver quality original papers	Our experts write quality original papers using academic databases.We dont use AI in our work. We refund your money if AI is detected
Free revisions	We offer our clients multiple free revisions just to ensure you get what you want.
Discounted prices	All our prices are discounted which makes it affordable to you. Use code FIRST15 to get your discount
100% originality	We deliver papers that are written from scratch to deliver 100% originality. Our papers are free from plagiarism and NO similarity.We have ZERO TOLERANCE TO USE OF AI
On-time delivery	We will deliver your paper on time even on short notice or  short deadline, overnight essay or even an urgent essay