指纹读取器手册

四皇后问题，八皇后问题，特洛比方块等等一些数学问题算法实现- Four empresses questions, eight empresses questions, Turlogh and so on some mathematics question algorithms realizes compared to the block

查看各目录文件大小，可以很快查找出个文件的大小，当硬盘空间不足时。-See the directory file size, can quickly find out the size of files, when the hard disk space is insufficient.

用C++编写的基于插值算法的两种检索算法-prepared by the interpolation algorithm based on the two Search Algorithm

对输入的二维数组实现自组织聚类分析，入:类的个数k,样本数n:随机选取k个对象,初始化k个聚类中心;设置迭代计数器t=0;While(r≠0)把样本点分到距离最近的聚类中心所入:类的个数k,样本数n:随机选取k个对象,初始化k个聚类中心;设置迭代计数器t=0;While(r≠0)把样本点分到距离最近的聚类中心所入:类的个数k,样本数n:随机选取k个对象,初始化k个聚类中心;设置迭代计数器t=0;While(r≠0)把样本点分到距离最近的聚类中心所。

UNIX系统之下的快速傅立叶变换包-UNIX system fast Fourier transforms the package

unrar Unrar 源程序是专门配套用来解压 RAR 文件的程序，以 Linux 版本为例，可以通过 请点击左侧文件开始预览 ！预览只提供20%的代码片段，完整代码需下载后查看 加载中 侵权举报

用matlab开发的系统辩识原代码。利用最小二乘法实现辩识.-Using matlab developed the original system identification code. Realize the use of least squares identification.

所谓Johnson 计数器，其实说白了无非就是复杂一点的流水灯实验。流水灯加上了按键控制，流水灯的开启关闭和变化方向在按键的控制下进行。本实例是带停止控制的双向4bit Johnson 计数器，可以通过LED 灯直观的在学习板上进行演示。

在c语言环境下实现快速傅立叶变换的功能，c实现fft变换-In c language environment to achieve the function of fast Fourier transform, c realize fft transform

采用NLJ随机搜索的方法辨识一个以状态方法表示的非线性系统。选其初值 a1(0) =50 , a2(0) =100 , a3(0) =100 , a4(0) =50 , a5(0) =10 , 选范围为 r(1)(i)=0.5 a(0)(i) , 取数据长度 L ＝40, t =0.005 , 性能指标 J＝ 。迭代计算结果得 a 的估计值 1=17.6043243, 1=17.5977, 2=72.9573, 3=51.3014, 4=22.9889, 5=5.99965, J = 0.000000916 。-Using NLJ random search method to identify a method that the state of the nonlinear system. Election of its initial value a1 (0) = 50, a2 (0) = 100, a3 (0) = 100, a4 (0) = 50, a5 (0) = 10, choose the range of r (1) (i) = 0.5 a (0) (i), check data length L = 40, t = 0.005, performance index J =. Iterative calculation results have a estimated value of 1 = 17.6043243, 1 = 17.5977, 2 = 72.9573, 3 = 51.3014, 4 = 22.9889, 5 = 5.99965, J = 0.000000916.