EMD-C

该软件主要应用是采用高斯正反算进行换带计算的。(The software application is used mainly Gaussian with positive and negative exchange balance calculation.)

利用蚁群算法求解TSP问题， 从Location.dat文件输入每个城市的坐标。(The use of Ant Colony Algorithm for TSP problems Location.dat file input from the coordinates of each city.)

解线性方程组的迭代法 雅可比迭代、高斯—赛德尔迭代、超松弛迭代法 (Solving linear equations iterative method Jacobi iteration, Gauss- Seidel iteration SOR method)

这是一个最最简单计算器，提供给大家参考一下(dadasddasdasd fafdsafasfafad)

fluent多相流DPM模型中使用用户自定义函数对颗粒进行统计(DPM fluent multiphase flow model using user-defined functions for particle statistics)

计算多项流的好程序，简单好用，计算量小。可以较好的模拟二维的两项变化情况(Calculating a number of streams of the program, easy to use, small amount of calculation. Can better simulate the two-dimensional variation)

算术编码是用符号的概率和它的编码间隔两俩个基本参数来描述的。算术编码可以是静态的或是自适应的。(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.)

针对传统的算法如遗传算法、粒子群算法等在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.)

An example of using a matrix object in order to pass values and complete a function.

说明：  邓肯张在ansys中的二次开发，适合于土体有限元分析(second development of duncan-zhang in ansys,it s be used to ansys)