基于神经网络的数字识别方法

你自己漫漫理解吧，我市转载的-your own long understood it, reproduced in the city

SOR解n维线性方程组 用vc语言完成SOR解n维线性方程组-SOR n-dimensional solution of linear equations using vc language SOR complete solution of n-dimensional linear equations

已经一整数n，求1！+2!+3!+4！+5！+6！+……+n！，n

采用C++开发的源程序，可用于对灰度图片LBP特征提取，然后可对提取特征后的图片送入分类器进行识别，LBP特征具有很强的鲁棒性

双曲线回归方程 HyperbolaRegress.cs 注意！该模型要求a与b的值要大于0！使用该模型时应注意验证这个限制条件。我在实现模型时未加入任何出错流程控制。X不能为0。 方程模型为 public override double[] buildFormula() 得到系数数组，存放顺序与模型系数相反，即该数组中系数的值依次是b,a。 public override double forecast(double x) 预测函数，根据模型得到预测结果。 public override double computeR2() -Hyperbola regression equation HyperbolaRegress.cs attention! The model demands a and b value is greater than 0! Caution should be taken when using the model verify the conditions of this restriction. I realize the model error is not to join any flow control. X should not to 0. Equation model for public override double [] buildFormula () get coefficient array, the storage order and model coefficients contrary, that is, the array is followed by the value of coefficient b, a. public override double forecast (double x) prediction function, according to the results of model prediction. public override double computeR2 ()

本编程实例实现了将多幅相同大小(16x16)有重叠的图像，通过拼接获得目标图像(890x16)的算法，并通过图像显示了最终的数据处理结果。其中包括简单的坏点校正，空气校正，增益校正，图像平滑处理。该程序运行环境为qt4.8+vs2010，并带有一组验证数据，可以直接运行程序并显示运行结果。扫描目标为圆柱形容器中装有水和一根焊锡丝。若要看到输出结果请修改程序中的数据文件目录至目标文件路径，否则程序会出错

这里实现了一个最优化控制的算法，牛顿梯度法的源代码，运行于matlab平台下。-here to achieve optimization of a control algorithm, Newton gradient of the source code, which runs on Matlab platforms.

两维弹性边界元程序-two dimensional elastic boundary element program

Bresenham法画圆  C语言入门程序，画图板应用程序，调试后能成功运行，进攻入门学习用

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。 编程任务：对于给定n堆石子,编程计算合并成一堆的最小得分和最大得分。-Playground in a circle around the stones are placed n heap. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. Programming tasks: for a given n stack stone, into a pile of programming the calculation of the minimum scores and maximum scores.