STS协议库

insertion排序-Insertion sort

约瑟夫环，运用了数据结构中的链结构。具体请详细观察源程序-Joseph Wan, the use of the data structure in the chain structure. Please observe the specific source code

求矩阵的最大特征值-matrix for the largest eigenvalue

SPHysics is a platform of Smoothed Particle Hydrodynamics (SPH) codes inspired by the formulation of Monaghan (1992) developed jointly by researchers at the Johns Hopkins University (U.S.A.), the University of Vigo (Spain), the University of Manchester (U.K.) and the University of Rome La Sapienza (Italy). Developed over a number of years primarily to study free-surface flow phenomena where Eulerian methods can be difficult to apply, such as waves, impact of dam-breaks on off-shore structures.

用于多个离散点拟合光滑曲线的，优化了追赶法，这个例子适用于闭合和不闭合两种情况。当时由于工程情况，写的急，代码不好看，但是很好用。为了方便传递参数，我做了一个链表，用时候根据自己情况可以修改，核心算法不动即可。-point for a number of discrete smooth curve fitting, and optimized to catch up with the law applicable to this case is not closed and the closure of two. At that time, because the situation, was the most aggressive, the code does not look good, but good use. To facilitate the transmission parameters, I have done a linked list, when used according to its own circumstances can change, the core algorithm can be fixed.

关于外排序的操作-outside of the sorting operation

POJ1010迷宫问题的的源码，采用了搜索+剪枝 思想：由于本题中规定只有在固定时刻到达目的点才能逃脱， 不能提早，更不能延迟，故不能用bfs。可以用dfs找出所有情况， 若有可行解，直接返回即可。本题比较郁闷的是，在tzc上将方向 数组int dir[4][2]稍微变动两下，就会超时。

列主元法求解高次线性方程-main-element method high linear equations

求解三对角方程组,有详细的注释。 节省存储空间的算法-Solving tridiagonal equations, there are detailed notes. Algorithm to save storage space

应用背景少子寿命的计算VI，花了两天时间帮公司做的一个东西，labview是一个用于工业测试比较好的一个工具，而且上手快，我学了两个月做的东西帮公司省了一大笔费用，真的是未来发展的方向。关键技术少子寿命是公司比较关注的东西，这次能够完成这个寿命计算也是大家的鼓励和支持，没有大家的帮助我也不可能写的出这样的程序，写labview程序一定要先规划一个思路，然后慢慢去扩展，一定会写的很好。