- 博客(1)
- 资源 (11)
- 收藏
- 关注
原创 Go Routine原理分析与探讨
协程 什么是协程 协程(coroutine)通常也叫用户态线程,关于coroutine术语的解释最初发表在论文http://melconway.com/Home/pdf/compiler.pdf。在wiki上,可以找到各种语言实现的协程库程序。这篇文章主要讲明白为什么会有协程,协程工作原理以及关于协程问题的探讨。 首先大家需要明白用户态和内核态以及其工作原理,这是理解这篇文章的基础,在这里不...
2020-05-01 11:04:28 547
Blockstream改良版侧链白皮书-解除三方操作风险
Blockstream发布的白皮书,详细介绍了一个名为Strong Federations的系统。这一系统是侧链(Sidechain)项目Liquid的基础,旨在提高隐私性、降低成本、加速交易所和经纪商之间的价值转移及结算流程。
2018-08-29
MIT计算机图形学课程6.837课件
SES # TOPICS KEY DATES
Lec 00 Introduction and Course Overview
Lec 01 Bezier Curves and Splines Assignment 0
Lec 02 Curves Properties and Conversion, Surface Representation
Lec 03 Coordinates and Transformations
Lec 04 Hierarchical Modeling
Lec 05 Color Assignment 1
Lec 06 Basics of Computer Animation—Skinning/Enveloping
Lec 07 Particle Systems and ODEs
Lec 08 Particle Systems and ODE Solvers II, Mass Spring Modeling Assignment 2
Lec 09 Implicit Integration, Collision Detection
Lec 10 Collision Detection and Response
Quiz
Lec 11 Ray Casting and Rendering
Lec 12 Ray Casting II
Lec 13 Ray Tracing
Lec 14 Acceleration Structures for Ray Casting Assignment 3
Lec 15 Shading and Material Appearance
Lec 16 Texture Mapping and Shaders
Lec 17 Sampling, Aliasing, and Mipmaps
Lec 18 Global Illumination and Monte Carlo Assignment 4
Lec 19 Image-Based Rendering and Lighting
Lec 20 Output Devices
Lec 21 Graphics Pipeline and Rasterization
Lec 22 Graphics Pipeline and Rasterization II
Lec 23 Real-time Shadows
Lec 24 Graphics Hardware and Computer Games Assignment 5
2018-05-03
MIT人工智能课程6.034课件
1 Introduction and scope
2 Reasoning: goal trees and problem solving
3 Reasoning: goal trees and rule-based expert systems
4 Search: depth-first, hill climbing, beam
5 Search: optimal, branch and bound, A*
6 Search: games, minimax, and alpha-beta
7 Constraints: interpreting line drawings
8 Constraints: search, domain reduction
9 Constraints: visual object recognition
10 Introduction to learning, nearest neighbors
11 Learning: identification trees, disorder
12 Learning: neural nets, back propagation
13 Learning: genetic algorithms
14 Learning: sparse spaces, phonology
15 Learning: near misses, felicity conditions
16 Learning: support vector machines
17 Learning: boosting
18 Representations: classes, trajectories, transitions
19 Architectures: GPS, SOAR, Subsumption, Society of Mind
20 The AI business
21 Probabilistic inference I
22 Probabilistic inference II
23 Model merging, cross-modal coupling, course summary
PROBLEM SETS TOPICS CODE FILES
Problem Set 0 (PDF) Python programming, symbolic algebra Code for Problem Set 0 (ZIP) (This ZIP file contains: 5 .py files.)
Problem Set 1 (PDF) Forward chaining, backward chaining and goal trees Code for Problem Set 1 (ZIP) (This ZIP file contains: 7 .py files.)
Problem Set 2 (PDF) Search, using heuristics, optimal search, graph heuristics Code for Problem Set 2 (ZIP) (This ZIP file contains: 5 .py files.)
Problem Set 3 (PDF) Game search Code for Problem Set 3 (ZIP) (This ZIP file contains: 7 .py files.)
Problem Set 4 (PDF) Constraint satisfaction problems, k-nearest neighbors, decision trees Code for Problem Set 4 (ZIP) (This ZIP file contains: 12 .py files, 6 .ord files, 4 .csv files and 2 .dat files. sudoku_csp.py is courtesy of Justin Cullen, and is used with permission.)
Problem Set 5 (PDF) Neural nets, boosting Code for Problem Set 5 (ZIP - 1.2MB) (This ZIP file contains: 12 .py files, 2 .dat files, 5 .csv files, 6 .ord files, 1 .out file, and 9 .tab files.)
2018-05-03
EOS白皮书 一个区块链操作系统
EOS白皮书中文版
1. 背景
2. 区块链应用的要求
3.共识算法(DPOS)
4.帐户
5. 应用程序的确定性并行执行
6. 令牌模型和资源使用
7. 治理
8. 脚本&虚拟机
9. 跨链交互
10. 结论
2018-04-08
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人