资源列表
Dijkstra-matlab
- 求第一个城市到其它城市的最短路径.用矩阵（为顶点个数）存放各边权的邻接矩阵，行向量、、、分别用来存放标号信息、标号顶点顺序、标号顶点索引、最短通路的值-The first city to find the shortest path to other cities. With a matrix (for the number of vertices) records of the right side of the adjacency matrix, row vector, were used
ZF
- 空时编码的基于Matlab的应用迫零算法的译码仿真-Space-time coding applications based on Matlab zero forcing decoding algorithm simulation
dimension
- 维娜滤波器的设计matlab代码以及仿真-The design of Sabina filter dimension
ch7a
- matlab中求解一维薛定谔方程中函数随时间的演化情况。-Selected to solve the one-dimensional Schrö dinger equation
gm
- 灰色预测 命令形式为x=[19519,19578,19637,19695,16602,25723,30379,34473,38485,40514,42400,48337] gm(x)-Grey command of the form x = [19519,19578,19637,19695,16602,25723,30379,34473,38485,40514,42400,48337] gm (x)
CCRm
- 可以计算DEA中的CCR模型，编程通过CCR乘子模式-Can be calculated in the CCR DEA model, programming model through the multiplier CCR
pai
- 用蒙特卡洛方法计算圆周率的程序,可以精确到第四位小数-a mento karlo method compiled in matlab
Lepingle_Ribemont_SDE
- 随机微分方程数值解！ Numercal Sulution Of Stochastic Differential Equations By Peter E.Kloeden Eckhard Platen PC-Exercise 11.4.1 Figure 11.4.1 求解方程 11.4.1-Numercal Sulution Of Stochastic Differential Equations By Peter E.Kloeden Eckhard Pla
RK4
- 数值分析中，显式4阶龙格－库塔法（Runge-Kutta）是用于求常微分方程数值解的重要迭代法。本算法优点是可以求高阶常微分方程（或多变量微分方程组）的数值解，并且可缩减求解时间-Runge-Kutta method
Luc_tiqu_dct
- matlab数字水印技术，用新的密码体制来实现数字水印-digital watermarking
qpsk
- 基于matlab的QPSK信号生成，已加噪。-QPSK signal generated
morse
- 对莫尔斯码的仿真实现，个人感觉比较简单。体现出了莫尔斯码1：3的点划比例，需要的人可以参考一下-Morse code simulation to achieve personal feeling is relatively simple. Reflect the point of Morse code 1:3 draw ratio of those who need it can reference