DRJ Owen的非线性有限元程序（静力部分）。

资源描述地震勘探中，频率-波数域PSPI波动方程正演模拟C语言程序，适合与初学正演的人，其在相移法的基础上利用插值提高了算法精度，同时相比时域有限差分运算更快，但仍然不能适应横向速度变化过大的速度模型。

加减乘除练习用的程序，它可以让学生练习加减乘除等数学运算。-arithmetic practice with the procedure, it can allow students to practice arithmetic and other mathematical calculations.

利用PML吸收边界条件计算对称阵子天线的辐射，并且画出动态图像-PML absorbing boundary conditions for the use of Symmetric stream of the antenna radiation, and to draw dynamic image

应用背景This paper considers the problem of interference mitigation in multi-cell multi-antenna time division duplex (TDD) wireless systems for downlink transmission. An efficient way to obtain channel state information (CSI) at the base station is by using uplink pilots and reciprocity of the downlink channel. At the same time, it has been shown that pilots from different cells contaminate each other, resulting in corruption of precoding matrices used by base stations, and high inter-cell interference. This paper studies the effects of shifting the location of pilots in time frames used in neighboring cells, and its effectiveness in obtaining better channel estimates, and, thereby, inter-cell interference reduction.关键技术Wireless cellular network designs with multiple antennas have been adopted by several modern wireless systems, which aim for high throughput as well as high

非常详细的高精度碰撞检测代码，精确到三角形、边、点，优化过滑动时的碰撞检测，完全没有震动现象。代码中把三角形等元素具体成类参与计算的方法很有参考价值。 代码内含3d向量计算函数，在ogengl、d3d下均可运行。

POKER 计算值   斗地主  扎金花都离不开它  This article for the budding poker AI programmer provides a foundation for a simple implementation of No-Limit Texas Holdem Poker AI, covering the basics of hand strength evaluation and betting. By following the recipe set out here, you will quickly become able to implement a reasonably strong poker AI, and have a solid foundation on which to build. I assume you are familiar with the basic terminology of poker.

包括了一维最优化算法 如：0.618法、分数法、二次差值法、三次插值法等源代码 还包括了无约束最优化部分的 共轭梯度法、DFP变尺度法（用导数或者用差分代替导数）、阻尼最小二乘法、鲍威尔法、模式搜索法、单纯性法等程序源代码 其次，约束最优化部分，提供了混合罚函数法（DFP)，混合罚函数法(POWELL)，综合约束函数双下降法、可变容差法、复合形法、网格法、随机实验法、解线性规划的单纯型法等等方法的源代码。

猴子吃桃的问题： 此程序是用递归做出来的，方法很简单-monkeys eat a peach : This procedure is done using the recursive method is very simple

动态规划计算最短路，只需输入点集合距离即可计算出最短路。-min route

矩阵类 可实现转置，求逆，求秩，求行列式值，求正定，重载了各种运算符-Matrices can be realized transpose, inverse, and rank, and the determinant value, and positive definite, a variety of operator overloading