资源列表
noise1234
- 一个基于MATLAB去噪的程序，实现了对高斯噪声的消除，效果非常好，希望大家喜欢-a denoising procedures, a pair of Gaussian noise, the elimination of the effect was very good, hope you like them
Elman
- MATLAB程序编写的神经网络ELMAN算法，实现故障模式识别-MATLAB programming Elman neural network algorithm, the fault pattern recognition
breakpoint
- 用MATLAB小波工具箱实现的信号奇异点的检测-MATLAB toolbox realize the singular point of the signal detection
bpnetworkdown
- MATLAB实现BP神经网络故障模式识别的示例-MATLAB BP neural network fault examples of pattern recognition
decompose
- MATLAB实现声音信号的小波分解与重构（内副数据）-MATLAB voice signals in the wavelet decomposition and reconstruction (with Vice data)
NLMS_algorithm_demo
- NLMS algorithm demo Note : The author doesn t take any responsibility for any harm caused by the use of this file-NLMS algorithm demo Note : The author does not take any responsibility for a ny harm caused by the use of this file
qipanfugaiwenti
- 棋盘覆盖问题：在一个2的k次幂乘以2的k次幂个方格组成的棋盘中，恰有一个方格与其他方格不同，称该方格为一特殊方格，且称该棋盘为一特殊棋盘。在棋盘覆盖问题中，用四种不同形态的L型骨牌覆盖给定的特殊棋盘上除特殊方格以外的所有方格。 -chessboard coverage : two in a k-th power of 2 multiplied by the k-th power grid consisting of a chessboard, and a box with the other
SGAperfect
- 基本遗传算法，又称为SGA算法，其中包括了详尽的注释，执行效果还不错！-basic genetic algorithm, also known as SGA algorithm, which included a detailed notes, the implementation of the results were pretty good!
Diagram
- 图的操作,包括,图的基本存储方法,有关图的操作算法并用C语言编程实现,图的搜索路径的遍历方法,以邻接矩阵和邻接表的方式存储连通图。然后分别用优先深度算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。深度优先遍历的递归算法 （1）深度优先遍历算法（2）邻接表表示的深度优先搜索算法（3）邻接矩阵表示的深度优先搜索算法.-plan of operation, including, map the basic storage methods, the operation of the map algor
wimgapitest
- 调用wimgapi实现的一个将wim文件apply到目录的例子。-call wimgapi achieve a wim document will apply to list the examples.
Linewatch
- 线性表的基本操作,基本操作：插入、删除、查找以及线性表合并等运算在顺序存储结构和链接存储结构上的运算。-linear form the basic operation, the basic operations : insert, delete, Search and linear forms merging operations in order to link storage structures and storage structure on the operation.
Twoforktrees
- 二叉树操作,掌握指针变量的含义，二叉树的结构特征，以及各种存储结构的特点及使用范围；指针类型描述、访问和处理二叉树的运算。程序1： 按先序次序输入二叉树中结点的值（一个字符），`0`表示空树，生成二叉树的二叉链表存储结构， a为指向根结点的指针。然后按中序顺序遍历二叉树。算法思想：先访问左子树,再访问根结点,最后访问右子树。-binary tree operation, grasp the meaning indicator variables, binary tree structure, a