Assessing critical thinking through scaffolded asynchronous online discussion

1. Assessing critical thinking through scaffolded asynchronous online discussion Yiong Hwee, TEO National Institute of Education Nanyang Technological University, Singaporeyhteo@nie.edu.sg Evaluations & Assessment Conference Adelaide November 24-25, 2003

2. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 2 Outline

3. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 3 Singapore Education Initiatives Thinking Programme & Project Work (PW) in schools Masterplan for IT in Education (1997-2002) In-service teacher training at NIE Hypermedia design module (Jul 03; 8 weeks) Design a hypermedia project Engage in Computer-supported Collaborative Learning (CSCL) using Knowledge Community There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �

4. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 4 Collaborative Critique Framework Value of critique of design projects Use examples of professional work to establish standards Use examples of students work to define high and low quality work (Thomas & Mergendoller, 2000) Why use asynchronous online critique? There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �

5. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 5 Research Question What types of thinking skills and levels of information processing are exhibited by in-service teachers in a scaffolded online group discussion?

6. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 6 Collaborative Critique Framework In-service teachers critique past year student hypermedia project in online discussion: 5 � step critique process 1. Identify project process, audience & expertise 2. Justify strengths and suggest improvements 3. Justify weaknesses and suggest improvements 4. Weigh alternatives 5. Transfer to own project There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �There are increasing interests for providing survivable network services recently. We categorize survivable network techniques into two parts. One is to prevent failure. The other is to design and operate the network to deal with potential failures. It is hard to eliminate the failure. So we are concentrating on network design and restoration schemes, more specifically, on spare capacity allocation and restoration procedures when topology is given. We set our general goal for this paper as following: �

7. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 7 Thinking Skills Dimensions of Thinking (Marzano, 1998) Map of Thinking Domain Framework (Swartz & Parks, 1994) Socratic Questioning Method (Socrates; Richard Paul, 1995) All reasoning has a purpose, is based on assumptions, done from some point of view, and based on information & evidence; All reasoning leads somewhere, has implications and consequences From above matrix formulations, we found following benefits: First, the state information required for SCA is C, it has size of L^2 Using C as the state information and advertise it over the network will hide per-flow based information. Apparently it gives better survivability. It also provide security and privacy over the network since different flows will not learn others routes. This is very important when they are belonging to competitors on the same carrier network. Using this matrix method, we can formulate a arc-flow based formulation and prove that SCA problem is NP-complete instead of NP-complete. It is not the main topic in this paper so we will escape it here. The next important finding is we can design an approximation algorithm using matrices above. From above matrix formulations, we found following benefits: First, the state information required for SCA is C, it has size of L^2 Using C as the state information and advertise it over the network will hide per-flow based information. Apparently it gives better survivability. It also provide security and privacy over the network since different flows will not learn others routes. This is very important when they are belonging to competitors on the same carrier network. Using this matrix method, we can formulate a arc-flow based formulation and prove that SCA problem is NP-complete instead of NP-complete. It is not the main topic in this paper so we will escape it here. The next important finding is we can design an approximation algorithm using matrices above.

8. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 8 Socratic Thinking Prompts From above matrix formulations, we found following benefits: First, the state information required for SCA is C, it has size of L^2 Using C as the state information and advertise it over the network will hide per-flow based information. Apparently it gives better survivability. It also provide security and privacy over the network since different flows will not learn others routes. This is very important when they are belonging to competitors on the same carrier network. Using this matrix method, we can formulate a arc-flow based formulation and prove that SCA problem is NP-complete instead of NP-complete. It is not the main topic in this paper so we will escape it here. The next important finding is we can design an approximation algorithm using matrices above. From above matrix formulations, we found following benefits: First, the state information required for SCA is C, it has size of L^2 Using C as the state information and advertise it over the network will hide per-flow based information. Apparently it gives better survivability. It also provide security and privacy over the network since different flows will not learn others routes. This is very important when they are belonging to competitors on the same carrier network. Using this matrix method, we can formulate a arc-flow based formulation and prove that SCA problem is NP-complete instead of NP-complete. It is not the main topic in this paper so we will escape it here. The next important finding is we can design an approximation algorithm using matrices above.

9. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 9 Using Knowledge Community to Scaffold Thinking First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

10. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 10 Using Knowledge Community to Scaffold Thinking First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

11. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 11 Using Knowledge Community to Assess Participation &Thinking Evaluation of online participation Statistics on reading & writing behaviour First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

12. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 12 Evaluation of types of Socratic thinking Message units according to Socratic Thinking Types First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

13. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 13 Evaluation of types of Socratic thinking Sorting by Scaffold Prompts First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

14. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 14 Evaluation of level ofinformation processing Henri (1992) method of coding Critical thinking � surface level �I do not agree that the quit button is redundant� Critical thinking � in depth level �A different viewpoint is that the choice of content is excellent. Pupils can relate to the content chosen since it depicts pupil�s own daily experience i.e. doing various activities in a day.� First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

15. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 15 Conclusion Preliminary Analysis Promising potential of �scaffolding prompts� of KC reveals that More students take a stand Comments were focused Comments were longer, detailed, with justifications Software-scaffolding enable students to use all thinking types BUT they are weak in �Probing Assumptions� (4.3%) & �Probing Implications & Consequences� (5.8%) First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

16. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 16 Conclusion Educators can help students to improve their thinking in certain areas where they are weak and further study can help us design better thinking scaffolds in online discussion forums First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

17. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 17 Future Research How does scaffolding prompts help pre-service teachers in online discussion? What have pre-service teachers learned and benefited from producing a group educational video?

18. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 18 THANK YOU! yhteo@nie.edu.sg (Knowledge Community: www.globalkc.net)

19. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 19 Research Question 1: How does critiquing professional productions and past student video projects help pre-service teachers� learning? Method: Content Analysis of discussion log of both groups Online survey questionnaire at end of course: MCQ & essay type questions Critiquing Video Cases First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

20. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 20 Critiquing Video Cases Q1: My knowledge of what makes a good educational video was First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

21. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 21 Q: Seeing & discussing past student projects is a good way to define what low and high quality work look like Critiquing Video Cases First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

22. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 22 Critiquing Video Cases : Transfer of Learning Q: My group has incorporated some of the insights and knowledge gained from the online video critique discussion in our own video production. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

23. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 23 Research Question 1: How does critiquing professional productions and past student video projects help pre-service teachers� learning? Free response in survey questionnaire & Content Analysis ��have a better idea of how the standards differ and allow me to gauge where my project stands� ��see clearly what are the certain do�s and don�t�s when producing a video� ��give direction and pre-empt mistakes in my own production� �learn from more people�s comments rather than just within my group members� �Engaging in video critique by looking at people�s comments and critiquing is a fun activity� Critiquing Video Cases :Qualitative Results First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

24. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 24 Q: The use of asynchronous online discussion has more advantages over face-to-face discussion. Asynchronous Online Discussion First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

25. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 25 Q: After reading my peers� comments, some of my beliefs and ideas changed. Asynchronous Online Discussion First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

26. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 26 Research Question 2 : What benefits do pre-service teachers report that asynchronous online discussion has on their learning? Free response in survey questionnaire & Content Analysis Reading peers� comments broadens point of view and obtaining a different perspective Confirmed advantages of asynchronous discussion: tend to contribute more as not afraid of �reprisals� face-to-face Permanent record encourages reflective thinking Overcome limitations of distance and time Critiquing Video Cases :Qualitative Results First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.

27. Y H Teo Assessing critical thinking through scaffolded asynchronous online discussion 27 Role of Scaffolding Stems Q: The use of scaffolding prompts before posting a note helps me focus my thoughts First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing. First, we will decompose the original multi-commodity problem into multiple smaller problems. Each of these smaller problems includes a single flow and tries to find its backup path by using shortest path algorithm and information in C. C is used for calculate the link cost for the shortest path algorithm. This cost is called incremental spare reservation vector v_r. Each element in v_r is the value the the addition spare reservation needed on the relating link when this link is used as the backup path. After find out the backup path, the related additional spare capacity will be augmented accordingly. The corresponding state information C is then updated as well. The next flow will using this new C and update its backup path, and so on, so forth. The other point of the algorithm is that each flow can update its backup path whenever there is no failure happened on network. Hence, each flow can keep updating its backup path whenever C changed until there is no update for any flow. Since our backup path routing is to provision the preplanned spare capacity allocation with minimum cost, and each flow will keep updating its backup path, we call this routing algorithm successive survivable routing.