1.1 A Decision Tree Model and its Analysis 1.2 Another Decision Tree Model and it Analysis 1.3 The Need for a Systematic Theory of Probability 1.4 Exercises

线性回归 ●最小二乘法 ●梯度下降 二分类任务 ●对数几率回归-Logistic Regression ●线性判别分析-Linear Discriminate Analysis 多分类任务 ●一对一 ●一对其余 ●多对多 类别不平衡问题

第一章 药物的鉴别试验 第二章 药物的杂质检查药物的纯度要求 第三章 定量分析样品前处理与测定方法的效能 第四章 巴比妥类药物的分析 第一章 绪论 第二章 中药制定量分析方法 第三章 中药制剂的定性鉴别 第四章 中药制剂的检查 第五章 中药制剂中各类化学成分分析 第六章 动物药、矿物药的分析 第七章 各种类型中药制剂的分析 第八章 生物样品内中药制剂化学成分的测定 第九章 中药制剂质量标准的制定

4. Welfare Analysis and Other Issues a. Measuring Welfare b. First Order and Second Order Losses C. Taxes and Welfare d. Household Production (did last class) e. The Hedonic Approach

第一节 热传导方程及热边界条件 第二节 热分析有限元法的一般步骤

第一节 动态分析有限元法的特点 第二节 动态分析有限元法的一般步骤

◼ 9.1 热分析技术概述 ◼ 9.2 热重分析 （TG） ◼ 9.3 差热分析（DTA) ◼ 9.4 差示扫描量热法（DSC) ◼ 9.5 动态热机械分析（DMTA）

1. Input-output economics, the foundation of CGE & GSC (a) the input-output table (b) national accounts (c) the one-country input-output model (d) the Leontief paradox (e) effective rates of protection (e) the multi-regional or multi-national I-O model - starting point for CSC analysis 2. CGE modelling (a) Johansen’s model of Norway (b) Johansen’s solution matrix versus Leontief’s inverse (c) trade in a CGE model, Armington to Melitz 3. Applying existing CGE models to supply chain issues (a) Walmsley & Minor on reversing NAFTA (b) Dixon, Rimmer and Waschik on Buy-America(n) 4. Towards a CGE model with supply chain features: designs, components, assembly and sales 5. Concluding remarks

 Introduction  Secure state  Security analysis-linear sensitivity analysis method

1 The Role of Algorithms in Computing 2 Getting Started 3 Growth of Functions 4 Divide-and-Conquer 5 Probabilistic Analysis and Randomized Algorithms 6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics 10 Elementary Data Structures 11 Hash Tables 12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures 15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis 18 B-Trees 19 Fibonacci Heaps 20 van Emde Boas Trees 21 Data Structures for Disjoint Sets 22 Elementary Graph Algorithms 23 Minimum Spanning Trees 24 Single-Source Shortest Paths 25 All-Pairs Shortest Paths 26 Maximum Flow 27 Multithreaded Algorithms 28 Matrix Operations 29 Linear Programming 30 Polynomials and the FFT 31 Number-Theoretic Algorithms 32 String Matching 33 Computational Geometry 34 NP-Completeness 35 Approximation Algorithms