-
Floydmatlab
Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。(Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given vertex-weighted graph shortest path algorithm. By weight of a graph matrix find its shortest path between two points of each matrix.)
- 2011-08-14 01:44:36下载
- 积分：1
-
Fuzzy_Fast_Implementation
这个程序对快速实现模糊逻辑控制很有用。假设这个逻辑控制有两个输入和一个输出，用各种选择来实现它。(This procedure is the rapid realization of the usefulness of fuzzy logic control. Assuming that there are two logic control inputs and one output, with various options to achieve it.)
- 2009-04-14 19:14:44下载
- 积分：1
-
ex6
说明： （1）对地区因素对身高的影响进行单因素方差分析；（2）对性别、年龄、部位三个因素对耐痛性的影响的多因素方差分析((1) the impact of regional factors on the height of the single factor analysis of variance (2) gender, age, location of the three factors on the pain tolerance of the multi-factor analysis of variance)
- 2011-03-23 10:57:42下载
- 积分：1
-
Lesson-5
matlab example.DSB-SC Modulation with AWGN transmission medium (channel)
- 2011-09-03 21:23:09下载
- 积分：1
-
CHAPTER9
数字PID的matlab仿真程序，针对刘金琨的先进PID控制的matlab仿真，里面的部分程序进行了修改 第九章(Digital PID of matlab simulation program for Liu Jinkun matlab advanced PID control simulation, which part of the program were modified IX)
- 2011-04-22 21:20:07下载
- 积分：1
-
peakdet
波形的峰值检测程序，能检测波形各个点的峰值(Waveform peak detection program, can detect the peak point of the waveform )
- 2015-03-04 16:24:10下载
- 积分：1
-
ComputerVision
计算机视觉：让冰冷的机器看懂多彩的世界 科学人，附有原作者的matlab代码(Computer Vision: Let the cold machine read the colorful world of science people)
- 2015-03-27 16:31:03下载
- 积分：1
-
GPS_INS
GPS和INS松组合程序，以及相应的程序说明和数据，包含主函数和卡尔曼滤波，直接可以运行(GPS and INS loose combination of procedures, and the corresponding program instructions and data, contains the main functions and Kalman filter, can be run directly)
- 2016-08-22 09:06:13下载
- 积分：1
-
最大二分配法
如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
- 2021-01-20 10:38:41下载
- 积分：1
-
Highboost
frequency domain filters
- 2009-12-10 17:12:45下载
- 积分：1
