人体检测的完整工程（包含测试图片），利用目标检测算法SVM,准确率达到97
Human detection complete works (including test images), the use of the target detection algorithm SVM, accuracy rate of 97 (2017-03-29, Visual C++, 1389KB, 下载18次)
KMP算法解决了BF算法效率低下的问题，并且在子串前缀重复时进行了性能优化
KMP algorithm solves the problem of low efficiency of BF algorithm, and when the prefix substring repeat performance optimization (2016-08-19, Visual C++, 19KB, 下载1次)
给定 n 个整数 a1,a2,…,an 组成的序列，如果对于 i< k< j,有 ak< |aj|，则称 aj
覆盖序列区间 ai,ai+1,…,aj，相应的覆盖区间长度为 j-i+1。
最大覆盖问题要求给定序列的最大覆盖区间长度 L。
例如，当 n 10，相应序列为：1,6,2,1,-2,3,5,2,-4,3 时，L 5。
★数据输入
输入数据第一行是一个整数 n，第二行是整数序列 a1,a2,…,an。
★数据输出
输出给定序列的最大覆盖区间长度 L。
cover quesitions (2016-07-25, Visual C++, 30KB, 下载1次)
卷积神经网络的c++ 实现版本，本文件主要供学习机器学习的同学使用，里面代码有详细注释
CNN matlab (2015-12-22, Visual C++, 14371KB, 下载48次)
编写程序要求：允许用户输入两整数求出并输出两整数大公约数(Common denominator)里介求公约数算法--欧几里德算法又称辗转相除法其计算理下：用a除b取余数a1 a1 = 0, 则b大公约数 否则用 b 除a1取余数a2 a2 = 0则a1大公约数 否则用 a1 除a2取余数a3a3 = 0则a2大公约数 否则用a2除a3取余数a4
Program requirement: allows the user to enter two integers and big Common divisor and output two integers (Common denominator) interface for Common divisor algorithms- in Euclidean algorithm is also called the division algorithm under the calculation principle: with a except b modulo a1 a1 = 0, b big Common divisor Otherwise with b in addition to the a1 modulo a2 a2 = 0 are common divisor a1 Otherwise use a1 except the a2 modulo a3a3 = 0 is a2 common divisor Otherwise with a2, a3 modulo a4
(2014-05-19, Visual C++, 4KB, 下载3次)
设计并训练三种神经网络使之分别逼近下列函数，精度Sm偏差小于20，Ry偏差小于1.5。 (各变量取值范围： =20～90, =35～55,a1=3～13, a2=0.3～3,Sd=0.05～0.45, =0.05～0.04,L2=0.015～0.06,T=7～110)
Design and training of three neural networks respectively approximation of the following function, precision Sm deviation is less than 20 Ry deviation is less than 1.5. (Each variable ranges: = 20 to 90, a = 35 to 55, a1 = 3 to 13, a2 = 0.3 to 3, Sd = 0.05 ~~ 0.45 = of 0.05 ~~ 0.04 L2 = 0.015 to 0.06, T = 7 ~~ 110) (2013-03-17, Visual C++, 3170KB, 下载8次)
SAT问题也称为合取范式的可满足问题，一个合取范式形如：A1∧A2∧…∧An，子句Ai（1≤i≤n）形如：a1∨a2∨…∨ak，其中ai为文字，为某一布尔变量或该布尔变量的非。SAT问题是指：是否存在一组对所有布尔变量的赋值（TRUE或FALSE），使得整个合取范式取指为真。
SAT problem, also known as conjunctive normal to meet a conjunctive normal form: A1 ∧ A2 ∧ ... ∧ An clause Ai (1 ≤ i ≤ n) of the form: a1 ∨ a2 ∨ ... ∨ ak ai to the text, is a Boolean variable or non Boolean variables. SAT problem is: Is there a group assignment of all Boolean variable (TRUE or FALSE), and makes the whole conjunctive normal fetch is true. (2012-11-22, Visual C++, 574KB, 下载14次)
字符串的匹配问题，有bf算法，有bm算法，有kmp算法，有兴趣一起交流
String matching problem, bf algorithm, bm algorithm, kmp algorithm, interested with the exchange (2012-11-19, Visual C++, 81KB, 下载3次)
这是一个智破连环的算法
【输入文件】
输入文件zplhz.in第一行包含三个整数：M、n和k（1 ￡ M, n￡ 100，1￡ k￡ 1000），分别表示B国连环阵由M个武器组成，A国有n个炸弹可以使用，炸弹攻击范围为k。以下M行，每行由一对整数xi，yi（0￡ xi，yi ￡ 10000）组成，表示第i（1￡ i￡ M）号武器的平面坐标。再接下来n行，每行由一对整数ui，vi(0 ￡ ui，vi￡ 10000)组成，表示第i（1￡ i￡ n）号炸弹的平面坐标。输入数据保证无误和有解。
测试数据中的xi、yi、ui、vi是随机生成的。
【输出文件】
输出文件zplhz.out的第一行包含一个整数x，表示实际使用的炸弹数。第二行包括x个整数，依次表示a1，a2，…，ax。
It is a wise broken serial algorithm
Input file [ ]
Input file zplhz.in first row contains three integer: M, N and K ( 1 M n profile, Profile Profile Profile 100, 1 K 1000 ), B respectively by M in serial array consisting of arms, state-owned n A bombs can use bomb attack, the range of K. The following M lines, each line consists of a pair of integers Xi, Yi ( Xi Yi Profile Profile 0, 10000 ), said I ( 1 I M Profile Profile ) weapons plane coordinate. Then n lines, each line consists of a pair of integers UI, VI ( UI VI Profile Profile 0, 10000 ), said I ( 1 i n Profile Profile ), bomb the plane coordinates. Input data to ensure the correct and solutions.
The test data of Xi, Yi, UI, VI is randomly generated.
Output file [ ]
Output file to the first zplhz.out line contains an integer x, said the actual number of bombs. Second elements including X integers, which expressed A1, a2, ... , ax. (2011-12-26, Visual C++, 2KB, 下载2次)
BF神经网络，用C语言写的，含有一个头文件，一个源文件。
BF neural network, written in C language, and contains a header file, a source file. (2011-10-21, Visual C++, 5KB, 下载2次)
BF算法实现，Bellman-Ford 网络优化算法，CSPF部署
Bellman-Ford (2009-05-15, Visual C++, 2KB, 下载23次)
给定n个矩阵｛A1,A2,…,An｝，其中Ai与Ai+1是可乘的，i=1,2 ,…,n-1。如何确定计算矩阵连乘积的计算次序，使得依此次序计算矩阵连乘积需要的数乘次数最少。
N matrix of a given (A1, A2, ..., An), which Ai and Ai+1 is the take, i = 1,2, ..., n-1. How to determine the calculation of the matrix product of the calculation of even order, the order of calculating the matrix and so the needs of even the product by the number of at least a few. (2009-05-07, Visual C++, 1KB, 下载1次)
神经网络基本算法源程序，包含四个基本算法：BF,ART I,RBF,自组织算法，有详细的帮助文件。
basic neural network algorithm source, contains four basic arithmetic : BF, ART I, RBF, self-organizing algorithm, a detailed help files. (2005-04-15, Visual C++, 143KB, 下载514次)