使用先生的粒子滤波

样条插值函数，插值边界条件为自然边界条件。运行编写环境C-spline interpolation function, interpolation boundary conditions for the natural boundary conditions. Operation C-environment

非线性方程组不能用消去和分解法进行求解，jacabi迭代和高斯迭代是最常用的两种迭代方法-Nonlinear equations can not be eliminated and the decomposition method to solve, jacabi iteration and Gauss iteration is the most commonly used two types of iterative methods

正弦波，T行波，方波设计报告- The sine wave, the T traveling wave, the square-wave design reported

在这个项目中，booth乘法器是使用进位先行加法器设计的。booth多处理器在许多DSP应用中都有应用。

城市轮廓线算法。采用分治发算法，输入为第一行房子个数，而后（左，高，右）。-Contour algorithm city. Made use of sub-rule algorithm, enter the number for the first line of the house, and then (left, high, right).

vs2005开发的apriori算法程序，实现算法的基本功能，获取关联规则-apriori algorithm vs2005 development process, achieve the basic functions of algorithm to obtain association rules

蚁群算法运用在聚类中，并且用C语言实现，并且会有界面展示蚁群聚类的过程。简单形象易懂

多核编程趋势在建立算法目前基本 knowlegeof 使用 #pragma omp parallelthis 乘法的 matrikswe can aplythe 基本结构复杂处理图像复杂会计 processetc algorithmlikesourde 代码包括一步一步的信息

给某个玩家100元的资本，让他不停押注直到输光，计算需要赌博多少次？ 如果把次数放在数组ruinLength[]中，进行1000次实验后，看看破产的最大次数、 最小次数和平均次数分别是多少？-100 to a player" s capital, so that he kept until the bet输光to calculate how many times the need for gambling? If the number on the array ruinLength [] in experiments carried out after 1000 to see the largest number of bankruptcy, the minimum number and the average number of how many were?

设计一个O(n*n)时间的算法，找出由n个数组成的序列的最长单调递增子序列--design an O (n2) time algorithm to identify by the number n of the longest sequence monotonically increasing sequences.