基本的MFC算法

用C写的可以实现求解满秩线性方程组以及最小二乘曲线拟合的函数-written in C can be achieved full rank solving linear equations and least-squares curve fitting the function

计算SOA中噪声性能的程序-calculation procedures noise performance

应用背景基于野火K60的直立的程序，拿来就可以用。改改参数，就可以直立了。建议学习这个程序之前看看清华的直立方案的视频。对理解程序有很大帮助，用的是融合滤波。配合虚拟示波器看融合后的波形是否跟踪的很好。关键技术野火，K60,清华直立方案，融合滤波，虚拟示波器，

A program for solving equations using Newton s Method.Just need to modify the data in the main function. If there is any bugs, please contact chenxiang@cad.zju.edu.cn

Implemantation of the noising method algorithm for traveller salseman problem on java.

0 / 1背包问题是一个N P-复杂问题，为了解决该问题，，将用回溯算法解决该问题。既然想选择一个对象的子集，将它们装入背包，以便获得的收益最大，则解空间应组织成子集树的形状（如图1 6 - 2所示）。该回溯算法与4 . 2节的装载问题很类似。首先形成一个递归算法，去找到可获得的最大收益。然后，对该算法加以改进，形成代码。改进后的代码可找到获得最大收益时包含在背包中的对象的集合。-0/1 knapsack problem is a P-complex issues, in order to solve the problem, and will be used backtracking algorithm to solve the problem. As to the choice of a subset of object, they will load a backpack, in order to obtain the greatest profits, the solution should be organized into space subset of the shape of the tree (Figure 1 6-2 below). The backtracking algorithms and 4. Two loading problem is very similar. Forming a recursive algorithm to get the maximum benefit available. Then, this algorithm is modified to form code. Improved code can be found at the maximum benefits included in the backpack of a collection of objects.

产生随机数，包含产生随机数的代码！-generate random number,including the code.

求素数，并且保存于文本文件，并且下次执行还可以接着上次的结果继续找下去 所以总有一天你会找到最大的素数……每天就像挂Q一样挂一下这个程序就行了-Seek primes, and stored in a text file, and the next performance can also be followed by the last results continue to look down so that one day you will find the largest prime number ... ... the same day, just hanging Q hang about this program on the list ... ...

混沌序列的相空间重构的MATLABT程序,相信一定能给您带来惊喜.-chaotic sequence of phase space remodeling MATLABT procedures, I believe that you can bring surprises.

资源描述二维码的生成工具，以动态链接库形式进行编译，预留接口是(w_char,w_char)其中的第一个参数是输入的内容，第二个是地址