能为金山杀毒软件提供一个自动升级的东西,不需要注册,解压就可以使用....

这个是好东西，喜欢的就下，我都舍不得拿出来的自己去看吧，不介绍了-this is something good, like it, I want to come up with their own look at it, not introduced

lpc2xxx开发板easy-usb开发说明文档-lpc2xxx Development Board easy-usb development documentation. .

CDMA下行解调的MatLab程序，完成下行信号的解扩。-CDMA downlink demodulation process MatLab

For advanced geometry, most apps will prefer to load pre-authored meshes from a file. Fortunately, when using meshes, D3DX does most of the work for this, parsing a geometry file and creating vertx buffers for us. This tutorial shows how to use a D3DXMESH object, including loading it from a file and rendering it. One thing D3DX does not handle for us is the materials and textures for a mesh, so note that we have to handle those manually.

用于个人网站建设的液鲸时钟代码.用HTML语言编的 -for personal websites on the whales clock source. Using HTML language series

总个数确定后，每张盘curDisk的移动方向maybe_To是确定的且唯一的：如共有三个盘时，盘1始终向左移动。 这里，将柱子由左向右看成A(源柱子Source),B(借助的柱子Borrow),C(目标柱子Target). A的左看成C，B的左看成A，C的左看成B； A的有看成B，B的右看成C，C的右看成A； 每张盘的移动方法(因为不可能连续两次移动相同的盘！)： 一个盘curDisk现在在 柱子curStick上，那么curDisk另一个柱子(3个中除了2个的另1个) 只要有选择的选择一个柱子curStick,分析、判断其最上面的盘curDisk的能否向curDisk确定的唯一的方向移动；移动 完后 再 选择 另一个 柱子 分析 判断 就可以完成了 (这个算法特别适合于人玩这个“弱智”（我有同学这么说）游戏，我玩我的文曲星pc1000a上的Hanoi 9层游戏，需要5分钟就可以移动完毕)-total number identified, each set curDisk maybe_To direction of the movement of which is determined only : If there are three disk, was always left a mobile. Here, the columns from left to right as A (source pole Source), B (using the pole Borrow), C (target pole Target). A left as C, B to the left as A, C on the left as B; A as the B, B on the right side as C, the right as A; each set of mobile methods (as it is impossible for the same two mobile disk!) : a set curDisk curStick now on the pole, then curDisk another pole (three in addition to two other one), when given a choice, choose a pole

有关CAD/CAM的资料,希望对大家有帮助-Related to CAD/CAM data, and they hope to have everyone help

杨乐平老师的第二章例程-Yang Leping teachers chapter routines

计算机图形学,单边裁剪算法-computer graphics, unilateral cutting algorithm

此程序实现采用了两个算法；雅克比迭代算法和高斯塞得迭代算法，通过这两个算法可以计算任何其次线性方程组。在应用者两个算法之前，还进行判断所代的其次线性方程组是否能用该方法求解