| ¶g |
½Ò |
½Òµ{³æ¤¸ |
¾\Ū¸ê®Æ |
«ÂI¤é´Á |
| 1 |
1 |
½Òµ{·§nªì¤¶ Introduction, Overview |
|
|
| 2 |
2 |
¾÷²v½Æ²ß Probability Review |
°Ñ¦Ò®Ñ2.13»P2.14 Sections 2.13, 2.14 |
|
| |
3 |
¦æ¤H¬ï¶V°ÝÃD Pedestrian Crossing Problem |
°Ñ¦Ò®Ñ2.13, 2.14, 3.3.1¤p¸` Sections 2.13, 2.14, 3.3.1 |
|
| 3 |
4 |
ÀH¾÷Åܶµ¨ç¼Æ¤@ Functions of Random Variables I |
|
|
| 4 |
5 |
ÀH¾÷Åܶµ¨ç¼Æ¤G Functions of Random Variables II |
½Ò°ó¸É¥R¸ê®Æ¡A°Ñ¦Ò®Ñ3.5¤p¸` Lecture Note, Section 3.5 |
|
| |
6 |
´X¦ó¾÷²v¤@ Geometrical Probability I |
½Ò°ó¸É¥R¸ê®Æ¡A°Ñ¦Ò®Ñ2.1¤p¸` Lecture Note, Section 2.1 |
|
| 5 |
7 |
´X¦ó¾÷²v¤G Geometrical Probability II |
|
|
| |
8 |
¹B¿é¼Ò¦¡ Some Transportation Models |
|
|
| 6 |
9 |
µ¥Ô²z½×ªì¤¶¡G§Q¦«¤ó©w²z Introduction to Queues: Little's Law |
|
|
| 7 |
10 |
°¨¥i¤Ò¥Í¦ºÃìµ¥Ô²z½× Markov Birth-and-Death Queues |
|
|
| |
11 |
°¨¥i¤Òµ¥Ô²z½×Á`¦X¹B¥Î More General Markov Queues |
|
|
| 8 |
12 |
M/G/1µ¥Ô²z½×¤Î¨ä©µ¦ù The M/G/1 Queue and Extensions |
|
|
| |
13 |
¾Ã¶ë©w»ù Congestion Pricing |
|
|
| 9 |
|
|
|
ÀH°ó´úÅç¤@ Quiz #1 |
| |
14 |
µ¥Ô²z½×ªº°ÊºAªí²{ Dynamic Behavior of Queues |
°Ñ¦Ò®Ñ5.1, 5.2, 5.3¤p¸`¡]5.3.5¤p¸`°£¥~¡^ Sections 5.1, 5.2, 5.3(excluding 5.3.5) |
|
| 10 |
15 |
¦hºûµ¥Ô¼Ò¦¡ Hypercube Queueing Model |
°Ñ¦Ò®Ñ5.4¤p¸`¡]5.4.5¤p¸`°£¥~¡^¡B5.8¤p¸` Sections 5.4(excluding 5.4.5), 5.8 |
|
| |
16 |
µ¥Ô±À½×¸Ñºâ¤u¨ã The Queue Inference Engine |
|
|
| 11 |
17 |
ºô¸ô¡Gªì¤¶ Networks: Introduction |
°Ñ¦Ò®Ñ6.1, 6.2¤p¸`¡]6.2.2»P6.2.3¤p¸`°£¥~¡^¡B6.3¤p¸` Sections 6.1, 6.2(excluding 6.2.2 and 6.2.3), 6.3 |
|
| 12 |
18 |
³]¬I°Ï¦ì°ÝÃD Facility Location Problems |
|
|
| |
19 |
¾÷²v«¬°Ï¦ì°ÝÃD Probabilistic Location Problems |
°Ñ¦Ò®Ñ6.5¤p¸`¡]6.5.6»P6.5.7¤p¸`°£¥~¡^ Section 6.5(excluding 6.5.6 and 6.5.7) |
|
| 13 |
20 |
Ãä¬É²[»\»P¸`ÂI²[»\ Edge and Node Covering |
°Ñ¦Ò®Ñ6.4¤p¸` Section 6.4 |
|
| |
21 |
¾÷²v«¬¸ô½u³W¹º°ÝÃD Probabilistic Routing Problems |
°Ñ¦Ò®Ñ6.4¤p¸` Section 6.4 |
|
| 14 |
22 |
¼ÒÀÀÀH¾÷ Simulating Randomness |
|
|
| |
|
|
|
ÀH°ó´úÅç¤G Quiz #2 |
| 15 |
23 |
²z½×¤§À³¥Î Implementation |
|
|
| |
24 |
¾Ç´Á½Òµ{µ²§ô Final Round Up! |
|