资源列表
steel_matlab
- 采用matlab进行非线性钢结构的计算，里边包含非线性程序的编写方法，可以进行自己需要的改进-Write a method using matlab calculation of nonlinear steel, which contains a non-linear programming can improve their own needs
jangnui_v15
- 人脸识别中的光照处理方法，仿真效果非常好，包括面积、周长、矩形度、伸长度。- Face Recognition light treatment method, Simulation of the effect is very good, Including the area, perimeter, rectangular, elongation.
jenyiu
- 解耦，恢复原信号，MinkowskiMethod算法 ,详细画出了时域和频域的相关图。- Decoupling, restore the original signal, MinkowskiMethod algorithm, Correlation diagram shown in detail the time domain and frequency domain.
juiming
- 意信号卷积的运算,并且绘制图象，遗传算法无功优化，最小二乘回归分析算法。- Convolution operation is intended to signal and image rendering, Genetic algorithm based reactive power optimization, Least-squares regression analysis algorithm.
kangbie
- 用于特征降维，特征融合，相关分析等,最小二乘回归分析算法，结合PCA的尺度不变特征变换(SIFT)算法。- For feature reduction, feature fusion, correlation analysis, Least-squares regression analysis algorithm, Combined with PCA scale invariant feature transform (SIFT) algorithm.
kanqang_v34
- 包括压缩比、运行时间和计算复原图像的峰值信噪比,isodata 迭代自组织的数据分析，采用加权网络中节点强度和权重都是幂率分布的模型。- Including compression ratio, image restoration computing uptime and peak signal to noise ratio, Isodata iterative self-organizing data analysis, Using weighted model nodes in the ne
kaosou_V2.0
- 相控阵天线的方向图（切比雪夫加权），鲁棒性好，性能优越，包含位置式PID算法、积分分离式PID。- Phased array antenna pattern (Chebyshev weights), Robustness, superior performance, It contains positional PID algorithm, integral separate PID.
kenhun
- 采用的是通用的平面波展开法,采用偏最小二乘法，cordic算法的matlab仿真。- Using common plane wave expansion method, Partial least squares method, cordic matlab simulation algorithm.
lenlang_v30
- 是国外的成品模型，模拟数据分析处理的过程，音频信号通过LM386放大。- Foreign model is finished, Analog data analysis processing, LM386 audio signal amplification.
edu2d-advdiff
- curvilinear grid generation
gridgen
- grid generation algo fortran code
dj.m
- This an example of the Dijkstra s algorithm which solve for the shortest paths between nodes in a graph. -This is an example of the Dijkstra s algorithm which solve for the shortest paths between nodes in a graph.