-
CHAP7
digital communication answers chapter 7
- 2009-04-25 14:42:22下载
- 积分：1
-
omp
基于正交分量的OMP稀疏分解参考程序，要求分解信号分量具有正交性(Sparse orthogonal decomposition OMP component reference procedure that requires the signal components with the orthogonal decomposition)
- 2010-11-20 20:36:56下载
- 积分：1
-
Begin
Small scale HPP optimization
- 2013-07-11 21:56:24下载
- 积分：1
-
NeuralNetwork_Backpropagation_Regression
使用MATLAB实现的BP神经网络的回归功能，代码非常的简洁(using MATLAB BP neural network regression function, the code is very simple)
- 2007-05-22 21:44:36下载
- 积分：1
-
LVQ
LVQ神经网络的分类——乳腺肿瘤诊断 (LVQ neural network classification- breast cancer diagnosis)
- 2011-09-14 16:13:28下载
- 积分：1
-
PID
pid算法原理解释，对初入学习PID的同学有很大帮助(pid algorithm principle explanation for entering the learning of the students are very helpful PID)
- 2013-08-27 23:04:06下载
- 积分：1
-
Matlab2010
适合MATLAB入门人员,包含语法说明，实例教程等，很详细的资料(MATLAB for entry personnel, including syntax descriptions, tutorials, examples, very detailed information)
- 2014-10-30 11:42:16下载
- 积分：1
-
KNN
K最邻近密度估计技术是一种分类方法，不是聚类方法。
不是最优方法，实践中比较流行。
通俗但不一定易懂的规则是：
1.计算待分类数据和不同类中每一个数据的距离（欧氏或马氏）。
2.选出最小的前K数据个距离，这里用到选择排序法。
3.对比这前K个距离，找出K个数据中包含最多的是那个类的数据，即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method.
It is not the best method, but it is popular in practice.
Popular but not necessarily understandable rule is:
1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov).
2. select the minimum distance from the previous K data, where the choice sorting method is used.
3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)
- 2020-10-23 14:37:22下载
- 积分：1
-
PRACTICALS
Charging_Capacitor Experiment
- 2013-10-04 14:50:55下载
- 积分：1
-
Heat-Conduction
一维定长热传导方程，时间项采用向后差分，隐式求解。(One dimensional heat conduction equation of time length, using backward difference, implicit solution.
)
- 2015-03-28 11:41:39下载
- 积分：1
