这个例子显示了如何执行一个重复序列的转换使用

使用MFC做出的可绘制圆形和椭圆的简单代码。用以MFC的初步学习和使用。在本程序中详细介绍了具体的使用和步骤，让读者可以方便的领会其设计思路。

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.

用最小二乘法拟和数据，得到一条最接近所给数据的直线-least squares method to be used and the data obtained by one closest to the straight-line data

SLAM_simulator_SP_map model

离散数学重言式判别以及逻辑表达式求值原代码-Discrete Mathematics tautology discriminant and logic expressions evaluates the original code

采用高斯背景建模以及帧差法提取出运动物体，然后用camshift算法进行跟踪。对于背景不动的场景，跟踪效果较好。能够很好地学习opencv中相关的函数，算法。对于初学者有很大的帮助。

用C++语言实现的基于小波分析的源代码,实现了小波分析的诸多算法-With C++ Language based on wavelet analysis of the source code, the realization of the wavelet analysis of many algorithms

#include < stdio.h > #include < stdlib.h > int main) { char str [20] ； printf ("Digite uma stringn"） ； setbuf(stdin,NULL) ； gets(str) ； int i; 为 (我 = 0 ； 我 < 4; i + +) { printf("%c",str[i]) ； } 返回 0 ； }

! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jacobian. The (driver) subroutines called by the user are given in the 8 ! table below, and are well documented internally. The user need not 9 ! be concerned with any other subroutines in HOMPACK90. -! 2 ! HOMPACK90 is a suite of FORTRAN 90 subroutines for solving nonlinear 3 ! systems of equations by homotopy methods. There are subroutines for 4 ! fixed point, zero finding, and general homotopy curve tracking problems, 5 ! utilizing both dense and sparse Jacobian matrices, and implementing 6 ! three different algorithms: ODE-based, normal flow, and augmented 7 ! Jac

It s simple implementation of Genetic Algorithm on 8-puzzle and as result it can say either there is or not a set of movement to go from initial state to a given final state.-It s simple implementation of Genetic Algorithm on 8-puzzle and as result it can say either there is or not a set of movement to go from initial state to a given final state.