搜索资源列表
FRAT
- 离散有限Radon变换FRAT,包含正反变换
fano
- 设有离散无记忆信源X,P(X).二进制费诺编码为:1.将信源符号按概率从大到小的顺序排列2.将信源分成两组――按两组概率之差为最小分.3.上面一组编码为0,下面一组编码为1,一直分到一组只有一个信源为止.4.将一个信源分组得到的0和1全部连接起来,组成该信源的码字,信源即得到自己的费诺编码.-There be no X remembering the message source in case that having being scattered, binary Feinuo of P (X
Discrete_Time_Queue
- 离散时间堆栈系统 The queue can store up to five packets. All packets are processed on a first come – first served basis. Assume that when a packet is serviced all other packets in a queue (if any) are shifted instantaneously towards the output. Each slot d
1-4
- 离散中的求主析取范式和主合取范式 用MFC工具完成-The Lord of discrete disjunctive and conjunctive normal form the main tools used to complete MFC
1d-heat-transfer
- 用FVM编程求解一维导热、对流、相变等问题,网格离散-Solving the one-dimensional heat conduction, convection, phase change and other issues with FVM programming, discrete grid
DCT
- 按照离散余弦变换的定义编写的C++程序,可以在VC上运行-DCT C++