Discussion question

Discuss what is Network capacity Planning and how do you measure/determine the capacity of your network? Are there any tools to assist you in network capacity planning?

Operational excellence

Discussion:

 This week we discuss the overall process of developing new software.  Please also note the differences between software development and methods. 

Assignments:

 Information Systems for Business and Beyond Questions:

  • Chapter 9 – study questions 1-10, Exercise 3
  • Chapter 10 – study questions 1-10, Exercise 1

Information Technology and Organizational Learning Assignment:

  • Chapter 7 – Review the section on dealing with multiple locations and outsourcing.  Review figure 7.2 and note how virtual team communications further reiterates the importance of this model. 
  • Chapter 8 – Review the Siemens AG case study.  Note the importance of understanding the interrelationships amongst all the senior leaders at every location.  Pay special attention to Figure 8.1 and Figure 8.2. Note how the corporate CIO should engage with each of the regional leaders.  Why is this important? 

Research on the topic “The progress of Artificial Intelligence in IT industry”

 The topic for is  “The progress of Artificial Intelligence in the IT industry”. I will attach a document, in which there are subheadings I need a detailed explanation of the topic, research questions, hypothesis for the quantitative question, the purpose of study, the significance of study , assumption and limitation of the topic. I need 10 points for assumption and limitation 

Java Coding Problem

2. Write a program given a number in any base (base 2 to base 16) and rounds that number to a

specified place. Rounding up occurs when the digit to the right of the rounding place divided by the

number’s base is 0.5 or more. For example, 0.12468 rounded to 3 places is 0.125 because 6 divided by

8 is greater than 0.5; when rounded to 2 places, it’s 0.13 because 4 divided by 8 is 0.5; and it’s 0.1

when rounded to 1 place because 2 divided by 8 is less than 0.5. Input from the keyboard three (3)

values: a number, the base of that number, and the number of places to be rounded. Assume the

numbers entered will have at least one digit to the right of the place to be rounded and at least one digit

to the left of the decimal point. Also, assume the rounding place will never be 0 (round a whole

number). For each input, output to the screen the number rounded to the given number of places. Do

not output any digits beyond the rounded place. Finally, ask the user if he/she wishes to run the

program again (check case). Refer to the sample output below.

Sample Run:

Enter the value: 0.11101

Enter the base of the number: 2

Number of decimal places to round: 4

The resulting value: 0.1111

Run again (Y/N): y

Enter the value: 35.4321

Enter the base of the number: 7

Number of decimal places to round: 3

The resulting value: 35.432

Run again (Y/N): N

week-14

 What is the Dark Web? How is it accessed? How is it used by criminals? How can it be used in a positive way? How can be used by law enforcement and the intelligence services. How can be used by private individuals. 

CSE about AI

 Uplaod the answer as a pdf. The slides might help.

Part 1: State Spaces

1.1) [1pt] You will need to create a small problem to work from (i.e., find an initial state that is only a few moves away from a goal state).

Luckily, for the 8-puzzle this is straightforward. Start from the goal state and move tiles around several times to “mix up” the board

For example (See attached pictureRYM@…)

Now you give it a try. Start from the goal state and move the tiles 3 times to create an initial state.

1.2) [4pts] Now draw out the search space starting from the initial state you created in (1.1). Draw 4 levels of the tree (we need a limit since the tree would otherwise be infinite in size), meaning the root node (initial state) and 3 levels of successor states. When considering successor states, evaluate moves (and writing them left-to-right) in the following order:

  1. Move a tile up into the blank space
  2. Move a tile down into the blank space
  3. Move a tile left into the blank space
  4. Move a tile right into the blank space

Indicate in some way which nodes are goal states and which nodes have further successors (which you won’t explore because they are past 4 levels).

The idea here is to reproduce something like the trees demonstrated on the slides (e.g., slide 11 in Uninformed Search).

I highly recommend putting the first set of successors (2nd level of tree) on separate pages, so you have enough room to finish the tree!

Part 2: Uninformed Search

Now we move on to some actual algorithms.

2.1) [4pts] Using your initial state from Part 1, show how Breadth First Search (BFS) would explore states.

Show your work in detail, including the contents of the Open and Closed sets after each iteration.

Because the open set will grow quite large, you may abbreviate by leaving out parts of the open and closed sets which don’t change. However, make sure it is clear what is leaving the open set and what enters the open/closed sets (and where!).

Hint: As you work through the BFS operation, trace which states it explores on your tree from Part 1. Is it following the pattern you expect? If not, maybe you’ve made a mistake?

If you find yourself needing to do more than 10 iterations to find a goal state, then after the 10th iteration, you may simply report which state is visited, rather than the entire contents of the Open & Closed sets.

2.2) [0.5pts] If you had used Uniform Cost Search (UCS) instead of BFS above, how would your results change?

2.3) [4pts] Now repeat (2.1) but using Depth-Limited Search (DLS) with a depth limit of 4.

Remember that DLS needs to know the depth in the search tree of each state (number of actions to reach), so you will need to include that extra information in your open set. (The formatting is up to you, but you could use the UCS example on the slides for inspiration.)

Hint: When you generate successor (children) states, how do you know what their depth is? Can you calculate their depth if you know the predecessor (parent) depth?

2.4) [4pts] Again, repeat (2.1) using Iterative Deepening Search (IDS).

Keep in mind, IDS runs DLS multiple times with increasing depth limits, so this problem will be somewhat like repeating (2.3) multiple times. Make sure it is clear each time where the depth limit changes (and a new run of DLS starts).

Hint: You may be able to re-use (copy-paste) many pieces of your work from (2.3) to save time.

Part 3: Informed Search

3.1) [6pts] Finally, repeat (2.1) using A* search using the “misplaced tiles” heuristic (see slide 25).

Note, as with DLS, A* requires tracking extra information about a state in order to operate. At a minimum, you will need to track the total estimated path cost for each node ( f ). But I highly recommend tracking the path cost so far ( g ) as well, as it will make you’re job significantly easier.

Hint: The path cost so far ( g ) has a very strong relationship with the depth from DLS…