卷积神经网络，手写识别训练

三次样条插值逼近函数-cubic spline interpolation function approximation

2k近邻数据流聚类算法，采用vc++实现 The summary of what you will find in each of the files that make up your 2kDPDS application. 2kDPDS.dsp     This file (the project file) contains information at the project level and     is used to build a single project or subproject. Other users can share the     project (.dsp) file, but they should export the makefiles locally. 2kDPDS.h     This is the main header file for the application.  It includes other

飞思卡尔线性ccd曝光程序，自适应曝光，加了舵机，电机控制

IIR数字滤波器,设计方法,低通、高通、带通、带阻-IIR digital filter design, low pass, high pass, band-pass, band

糊涂先生给他的五个朋友写信，他写了五封信，但是当他的朋友收到信后，都告诉他：“你的信寄错了”。那么请你计算一下：出现这种情况的概率有多少？（假设糊涂先生是随机地往信封里装信的），你能不能把所有的情况都列出来呢？-confused to his five friends in a letter he wrote five letters, but when his friend received the letter, had told him : "You sent a letter wrong." Then you do some calculations : this happens the probability is the number? (Assuming confused is randomly installed to envelope the letter), you can put all the cases listed?

A*算法实现迷宫寻路功能，用启发式函数的编写以及各类启发式函数效果的比较。

非线性系统的C-C算法,程序运行良好,能为从事混沌方面研究的人员提供一定的便利.-Nonlinear Systems C-C algorithms, running good, to engage in research in the chaotic provide certain facilities.

应用背景快速傅里叶变换 (fast Fourier transform), 即利用计算机计算离散傅里叶变换（DFT)的高效、快速计算方法的统称，简称FFT。快速傅里叶变换是1965年由J.W.库利和T.W.图基提出的。采用这种算法能使计算机计算离散傅里叶变换所需要的乘法次数大为减少，特别是被变换的抽样点数N越多，FFT算法计算量的节省就越显著。 关键技术FFT的基本思想是把原始的N点序列，依次分解成一系列的短序列。充分利用DFT计算式中指数因子 所具有的对称性质和周期性质，进而求出这些短序列相应的DFT并进行适当组合，达到删除重复计算，减少乘法运算和简化结构的目的。

通过此程序可以把输入的年份判别是平年,还是闰年.-through this procedure can be imported in the year discriminant is non-leap year, or a leap year.

克鲁斯卡尔算法最小生成树，普里姆生成最小生成树