资源列表
混沌序列的相空间重构的MATLABT程序
- C语言和MATLAB混合编程实现，混沌序列的相空间重构的MATLABT程序。(C language and MATLAB hybrid programming, chaotic sequence phase space reconstruction of the MATLABT program.)
J2GEZI
- 声全息成像算法，通过傅立叶变换和逆傅里叶变换将采样平面信息传递到目标平面，并重建目标平面信息。(In this algorithm, the sampling plane information is transmitted to the target plane by Fu Liye transform and inverse Fourier transform, and the target plane information is reconstructed.)
holography
- 全息成像算法，将平面1上字母A转传递到平面2上并呈现数字1。实现不同平面信息转换。(Holographic imaging algorithm, the plane 1 on the letter A transfer to the plane 2, and presents the number 1. Implement different plane information conversion.)
IFTA
- 迭代傅立叶变换算法程序，查看迭代过程误差变化及重建图像(Iterative Fu Liye transform algorithm program, view the iterative process, error changes and reconstruction images)
eg
- 重建全息图像的matlab算法,，利用了离散变换。(The matlab algorithm for reconstructing holographic images uses discrete transform.)
EXP6_Compress
- 调用霍夫曼编码和香农费诺压缩和解码图片，并计算压缩率(Call Hoffman encoding to compress and decode pictures, and calculate compression rates)
efbc08dd5d5e
- 1、LorenzData.mat - Lorenz 离散序列的数据文件，5000个点，内有变量：x,y,z 2、Volterra_main_luzhenbo.m - Volterra自适应预测主文件 3、Volterra_train.m - Volterra自适应预测训练部分 4、Volterra_test.m - Volterra自适应预测测试部分 5、PhaSpaRecon.m -混沌序列的相空间重构 6、TrainTestSample.m -相空间中点的轨迹分解成：训练样本与测试
armijo-constant-diminishing
- 使用梯度下降法求无约束问题最优解,包括最速下降法，常数步长下降法等。(Find the best solution to the unconstrained problem, using gradient descent method.)
EARTHQUAKE
- 为框架结构ANSYS地震时程分析，内含5个命令流： 1、Ea—_An_01为加固前静力分析 2、Ea—_An_02为加固前模态分析 3、Ea—_An_03为加固前地震分析 4、Ea—_An_04为剪力墙加固地震分析 5、Ea—_An_04为钢板加固地震分析(For the framework of ANSYS seismic time history analysis, 5 command streams are included: 1, Ea - _An_01 are static
Spectral Clustering
- 实现简单的谱聚类，将两个半圆形的数据分成两类。(Implement a simple spectral clustering, two semi-circular data into two categories.)
最小错误率贝叶斯决策
- 基于最小错误率的贝叶斯决策 （1）要决策分类的类别数是一定的；（2）每一类出现的“先验概率”已知；（3）每一类的“类条件概率密度”已知；(Bayesian Decision Based on Minimum Error Rate(1) the "prior probabilities" of each class are known; (2) the "conditional probability density" of each class is kn
ACO_TSP
- 利用蚁群算法求解旅行商问题，求解100个城市的最短路程(Using Ant Colony Optimization to solve TSP problem)