-
pca02
PCA可以用于图像处理的盲检测，可以得到较好的效果(PCA can be used for image processing, blind detection, better results can be obtained)
- 2010-10-11 15:04:09下载
- 积分：1
-
MATLABchengxu
机械出版社出版的《数值分析与应用》的源程序，有最优化和数值分析算法的各种程序，对于搞研究有用(Machine Press book "Numerical Analysis and Applications" to the source, there are optimization and numerical analysis algorithms of the various procedures for the study useful to engage in)
- 2009-12-18 22:16:11下载
- 积分：1
-
adaptEq
基础自适应均衡化利用lms或rls方法,通俗易懂,适合初学者(Adaptive equalization based on the use of LMS or rls methods, user-friendly, suitable for beginners)
- 2008-06-05 10:29:32下载
- 积分：1
-
Wireless-sensor-network-survey
无线传感器网络的一个最新发展情况，概述了其发展过程以及最新发展方向(One of the latest developments in the case of wireless sensor networks, an overview of the development process as well as the latest development direction)
- 2012-10-22 21:18:54下载
- 积分：1
-
entropy
采用熵值法求特征分量的权重，一般可用于特征选择与特征提取(Entroy algorithm ia used to be calculate the weight of each element,and is helpful in the selection and extraction of features)
- 2014-02-25 10:52:28下载
- 积分：1
-
PR_10
基于图像拉普拉斯信息的图像分割matlab代码(image segmentation code based on image laplace information )
- 2012-05-12 12:58:51下载
- 积分：1
-
80211aPmimo
This file is 802.11a+mimo system based on matlab simulink.
Which contains nine mdl files, is what I do MIMO-OFDM find papers are available are welcome to download.
This will work in Matlab 2006b.
- 2013-09-04 13:22:11下载
- 积分：1
-
DFIG-wind-farm
风电场双馈异步电机仿真，希望对大家有所帮助(Doubly-fed induction motor wind farm simulation, we hope to help)
- 2015-04-13 19:05:29下载
- 积分：1
-
confusion_matrix
将机器学习分类的结果生成混淆矩阵，并画出混淆矩阵。。。。。。。。(generating confusion matrix and draw it)
- 2020-07-15 19:08:50下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
