• 2021

    • 2-23 3 First-Order Hereditary Harrop Formulas 导读
    • 2-18 2 First-Order Horn Clauses 导读
    • 2-17 Tips for Reco Theme
    • 2-17 关于本站
    • 1-30 现代操作系统 实验记录
    • 1-26 《Programming with Higher-Order Logic》阅读笔记
  • 2020

    • 12-30 Final Review
    • 12-27 Test Yourself (Part 1)
    • 12-27 Test Yourself (Part 2)
    • 12-25 Final Review
    • 12-18 OS10 - Virtual Memory
    • 12-18 15-2 Optimization and Neural Nets
    • 12-15 15-1 Perceptrons and Logistic Regression
    • 12-11 OS9 - Main Memory
    • 12-11 14-2 Naive Bayes
    • 12-8 14-1 Particle Filtering
    • 12-4 OS8 - Deadlocks
    • 12-4 OS7 - Synchronization Examples
    • 12-4 13-2 Hidden Markov Models
    • 12-1 13-1 Decision Networks and Value of Information
    • 11-30 Randomized Algorithms
    • 11-27 OS6 - Synchronization Tools
    • 11-27 12 Bayes' Nets - Sampling
    • 11-24 11-2 Bayes' Nets - Inference
    • 11-23 Local Search
    • 11-23 Approximation Algorithms
    • 11-23 Extending Tractability
    • 11-16 Intractability (II)
    • 11-13 OS5 - CPU Scheduling
    • 11-13 11-1 Bayes Net (III)
    • 11-13 10-2 Bayes Net (II)
    • 11-10 10-1 Bayes' Nets
    • 11-9 Intractability (I)
    • 11-9 Network Flow (III)
    • 11-6 9-2 Probabilistic Reasoning
    • 11-2 Network Flow (II)
    • 10-30 OS4 - Threads
    • 10-26 Network Flow I
    • 10-26 Dynamic Programming (II)
    • 10-23 CA3 - Memory Hierarchy Design
    • 10-23 6-2 Reinforcement Learning (II)
    • 10-20 6-1 Reinforcement Learning
    • 10-19 Dynamic Programming (I)
    • 10-16 OS3 - Processes
    • 10-16 CA3 - Instruction Set Architecture
    • 10-16 5-2 Markov Decision Process (II)
    • 10-13 5-1 Markov Decision Process
    • 10-12 Divide and Conquer (II)
    • 10-9 Chapter 5 Semantic Actions
    • 10-7 CSAPP 实验记录
    • 10-2 Divide and Conquer (I)
    • 9-29 4 Uncertainty and Utilities
    • 9-28 Greedy in Graph
    • 9-25 OS2 - Structures
    • 9-25 3-2 Adversarial Search
    • 9-22 3-1 Constraint Satisfaction Problems
    • 9-21 Graph & Greedy Algorithm
    • 9-18 CA1 - Introduction
    • 9-18 2-2 Heuristics & Constraint Satisfaction Problems
    • 9-15 2-1 Uninformed Search (cont'd) & Informed Search
    • 9-14 Algorithm Analysis
    • 9-11 Introduction
    • 9-11 1-2 Uninformed Search
    • 9-8 1-1 Introduction
    • 9-7 Stable Matching
    • 9-1 September 2020 - Week 1
    • 8-25 August 2020 - Week 4
    • 8-20 Chapter 4 Abstract Syntax
    • 8-19 August 2020 - Week 3
    • 8-15 Chapter 3 Parser
    • 8-13 August 2020 - Week 2
    • 8-12 LeetCode 刷题记录
    • 8-7 Chapter 2 Lexical Analysis
    • 8-6 Modern Compiler Implementation in OCaml
    • 6-11 Concurrency
    • 6-2 Lambda Calculus 2
    • 5-26 Lambda Calculus
    • 5-25 6 I/O Topics and Storage
    • 5-21 Pointer And Address
    • 5-14 Run Time Error
    • 5-12 Control Flow
    • 4-28 Completeness of FOL
    • 4-26 5 The Processor - Pipeline
    • 4-26 9 Testing
    • 4-23 8 Mapping Models to Code
    • 4-23 Alternative Hoare Logic
    • 4-22 Gaussian Channel
    • 4-21 Completeness of Hoare Logic
    • 4-20 5 The Processor
    • 4-20 4 Instructions (Part D):Supporting Procedures in Computer Hardware
    • 4-20 7 Object Design - Specifying Interfaces
    • 4-20 Differential Entropy 2
    • 4-16 Denotation VS Triples 2
    • 4-15 Differential Entropy
    • 4-14 Denotations VS Triples 1
    • 4-13 4 Instructions (Part C)
    • 4-13 Channel Capacity 3
    • 4-9 7 Object Design - Reusing Pattern Solutions
    • 4-9 Denotation VS Small-Step
    • 4-8 Channel Capacity Theorems
    • 4-7 Small Step Semantics
    • 4-2 Denotational Semantics 4
    • 4-2 6 System Design - Addressing Design Goals
    • 4-1 Channel Capacity
    • 4-1 4 Instructions (Part B)
    • 3-31 Denotational Semantics 3
    • 3-30 Data Compression 3
    • 3-30 6 System Decomposition
    • 3-26 Denotational Semantics 2
    • 3-25 Data Compression 2
    • 3-25 4 Instructions (Part A)
    • 3-24 Denotational Semantics
    • 3-23 5 Analysis
    • 3-23 Data Compression
    • 3-19 4 Requirement Elicitation
    • 3-18 Entropy Rate
    • 3-18 3 Top Level View of Computer Function Interconnection (cont'd)
    • 3-17 First Order Logic
    • 3-16 3 Top Level View of Computer Function Interconnection
    • 3-16 3 Project Oraganization and Management
    • 3-16 AEP
    • 3-12 Hoare Logic 4
    • 3-11 Entropy (3)
    • 3-10 Hoare Logic 3
    • 3-9 2 Evolution and Performance (cont'd)
    • 3-9 2 Modeling with UML
    • 3-9 Entropy (2)
    • 3-5 1 Introduction (cont'd)
    • 3-5 Hoare Logic 2
    • 3-4 Entropy (1)
    • 3-4 2 Evolution and Performance
    • 3-3 Hoare Logic 1
    • 3-2 1 Introduction
    • 3-2 1 Introduction