神经网络的优化

一个acm算法题目 问题描述： 有一个黑盒子，可视为一个15×10的二维矩阵，里面有一些空隙，在二维矩阵中用0表示空隙，用1表示被占有。现有一个仪器，可以从4个方向对盒子进行分行透视：从左到右，从左下到右上，从下到上，从右下到左上。透视可得到该二维矩阵的该行1的个数。要求，还原此矩阵。 输入：4行，每一行分别代表从左到右，从左下到右上，从下到上，从右下到左上透视所得的数据 输出：该矩阵 使用的方法是回溯法，具体见程序-a acm algorithm topic Problem description : a black box, as a 15 x 10 two-dimensional matrix, there are some gaps in two-dimensional matrix using 0 indicates the gap, with a show that occupies. An existing equipment, from the direction of four branches box for perspective : from left to right, from the lower left to upper right, from bottom to top, from the lower right to upper left. Perspective availability of the two-dimensional matrix of the line a number. Demand reduction of this matrix. Input : 4 firms on behalf of every line from left to right, from the lower left to upper right, from bottom to top, from the upper left to lower right perspective on data obtained from the output : the matrix method is the use of backtracking, see the specific procedures

fisher分类器Fisher判别法是历史上最早提出的判别方法之一，其基本思想是将n类m维数据集尽可能地投影到一个方向（一条直线），使得类与类之间尽可能分开。从形式上看，该方法就是所谓的一种降维处理方法。

计算机科学与技术专业的课程设计slr算法-computer science and technology courses for professional design algorithm slr

vc++6.0 使用MFC实现的计算器小程序，可以执行-vc++ 6.0 ??用MFC实现的 ?扑闫 ????绦????梢灾

完成矩阵的输入、输出。具有相同行数和列数的矩阵间的加法、减法。符合矩阵乘法规则要求的矩阵间的乘法。方阵间的除法，方阵的求逆。矩阵的求转置矩阵等功能-Complete matrix of input and output. With the same number of rows and rows of the matrix between the adder, subtraction. In line with the requirements of the rules of matrix multiplication between matrix multiplication. Between square division, the inverse square. Matrix transpose matrix functions

隐式曲面求解的源代码，用户可以输入隐式曲面，得到mxmxm的网格数据-Implicit surface to solve the source code, users can enter implicit surface, the grid data mxmxm

bp算法的VC程序-bp algorithm VC Program

请认真书写上传资料的详细功能、包含内容说明(至少要20个字)。尽量不要让站长把时间都花费在为您修正说明上。压缩包解压时不能有密码。

最小二乘法拟合曲线，在TC2.0中编译通过-least squares fitting, in which compile WITH TC 2.0

给定n 个物品, 物品i重为wi 并且价值为 vi ，背包所能承载的最大容量为 W. 0-1 背包问题即是选择含有着最大总价值的物品的子集且它的容量 ≤W ． 用动态规划实现-given n goods, items i weight of wi and value of vi, the backpack can carry a maximum capacity of W. 0-1 knapsack problem that is a choice with a maximum total value of the goods but a subset of the W capacity. Dynamic Programming