巨量資料分析
Big Data Analytics
| 節 | 週二 |
|---|---|
5 13:20–14:10 | 巨量資料分析 A901 3 節連堂 |
6 14:20–15:10 | |
7 15:30–16:20 |
* 根據陽明交大上課時間表所列
This is the second course that introduces deterministic and probabilistic optimization models such as dynamic programming, integer programming, nonlinear programming, Markov chain and queueing theory. This course focuses on modeling approaches, fundamental solution methodologies and their applications to the real world.
Calculus and Probability Theory
演習課教學助理每週舉行課程及作業講解,學生可自由參加。(The homework assignments will be lectured by our Teaching Assistant weekly and students' participation is optional.) 相關教學資料提供於教學平台。 (Relevant teaching materials are provided on the Virtual Learning Environment.) https://e3.nycu.edu.tw *** 詳情請至 [教材列表] 下載課程綱要。
學期作業、考試、評量 (Homework, Examination, and Grading): 成績評量方法 (Grading): (a) 二次共同考試 (Two Common Examinations):Total 70% (35% for each exam). (b) 平時成績 (Individual Homework Assignments, Attendance, and Others): Total 30% *** 考試時間、詳情平時成績分配方法,請至 [教材列表] 下載課程綱要。
- DTMC, CTMC, and Queueing Theory
- Integer Programming and Discrete Optimization
- Non-linear Programming
- Stochastic Process and Markov Chain
| 週次 | 主題 |
|---|---|
| 第 1 週 | 28.1 Stochastic Processes 28.2 Markov Chains |
| 第 2 週 | 28.3 Chapman-Kolmogorov Equations28.4 Classification of States of a Markov Chain |
| 第 3 週 | 28.5 Long-Run Properties of Markov Chain |
| 第 4 週 | 28.6 First Passage Times28.7 Absorbing States |
| 第 5 週 | 17.1 Prototype Example17.2 Basic Structure of Queueing Models17.3 Examples of Real Queueing Systems17.4 The Role of the Exponential Distribution |
| 第 6 週 | 17.5 The Birth-and-Death Process17.6 Queueing Models Based on the Birth-and-Death Process |
| 第 7 週 | 17.9 Queueing Networks12.1 Prototype Example12.2 Some BIP Applications |
| 第 8 週 | Midterm Exam (35%) |
| 第 9 週 | 12.3 Innovative Uses of Binary Variables in Model Formulation12.4 Some Formulation Examples12.5 Some Perspectives on Solving Integer Programming Problem |
| 第 10 週 | 12.6 The Branch-and-Bound Technique and its Application to Binary integer Programming12.7 A Branch-and-Bounds Algorithm for the Mixed Integer Programming |
| 第 11 週 | 13.1 Sample applications13.2 Graphical Illustration of Nonlinear Programming Problems |
| 第 12 週 | 13.3 Types of Nonlinear Programming Problems13.4 One-Variable Unconstrained Optimization |
| 第 13 週 | 13.5 Multivariable Unconstrained Optimization |
| 第 14 週 | 13.6 The Karush-Kuhn-Tucker(KKT) Conditions for Constrained Optimization |
| 第 15 週 | 13.7 Quadratic Programming |
| 第 16 週 | Final Exam (35%) |
Frederick S. Hillier and Gerald J. Lieberman, Introduction to Operations Research, 11th Edition, McGraw-Hill, 2021.
- 地點
- 各授課教師另行公布 (To Be Announced)
- 時間
- 各授課教師另行公布 (To Be Announced)
- 聯絡方式
- 各授課教師另行公布 (To Be Announced)