Gauss

算术编码是用符号的概率和它的编码间隔两俩个基本参数来描述的。算术编码可以是静态的或是自适应的。(Arithmetic coding to both of two basic parameters to describe the probability of the symbol and its coding interval. Arithmetic coding can be static or adaptive.)

说明：  经过优化的C代码实现的Gauss-Seidel 迭代算法(Optimized C code of the Gauss-Seidel iterative algorithm)

一个对Fluent中k-e湍流模型的修正udf程序，c语言(One pair ke turbulence model in Fluent udf amendment procedures)

最小二乘法拟合形如f(x)=(a+bx)/(1+cx)的函数（9.2.2(1))，并解决人口预测问题(9.2.2(2))(Least squares fit of the form f (x) = (a+bx)/(1+cx) function (9.2.2 (1)), and to solve the population prediction problem (9.2.2 (2)))

C++实现的FFT，详细，简单，内含多个测试类(using C++ implements fft，including serials class)

程序是关于计算两相黎曼问题的一个求解器。可以直接设置。(The code is a solver about the two-phase Riemann problem. the user can use it directly.)

针对传统的算法如遗传算法、粒子群算法等在TSP问题上求解精确性和求解规模上都还有一定的不足，本文提出了一种基于动态规划思想的粒子群优化算法。该算法用动态规划的方法实现粒子间的信息交互和粒子的进化，并且将粒子群中的粒子按无标度信息指导网络拓扑图的方式进行连接。仿真结果表明该方法能有效地减小误差率，提高解的精确，同时还保持了较低的计算复杂度，具有良好的稳健性。(TSP problem solving for the traditional algorithms such as genetic algorithms, particle swarm optimization accuracy and solving the scale, there is a certain lack of a dynamic programming algorithm-based particle swarm optimization algorithm. The algorithm using dynamic programming method to achieve the evolution of information exchange between the particles and the particles, and particle swarm particle scale-free information guide network topology map to connect. The simulation results show that this method can effectively reduce the error rate and improve the solution precision, while maintaining a low computational complexity, good soundness.)

说明：  此程序为满足条码不能带IOQ三位字母的计算方法(Bar code can not be three letters with the calculation of IOQ)

可实现OFDM电力载波通信的前导序列检测，能进行连续多个前导检测(Can achieve OFDM power carrier communication leading sequence detection, can carry out a number of continuous preamble detection)

计算机流体理论方面的文献，动网格的划分和计算(Literature, of the theory of computational fluid dynamic division and calculation of the grid)