oracle的内部培训资料，可能有些老，但还是很实用

DSP LF2407A 板上拨码开关例程　已跑通了-On-board DSP LF2407A DIP switch routine has been run over the

DHTML menu source codes. You can use this file souce codes to create your own menus.

坐标方位角反算，其中包括角度化弧度，弧度化角度的模块。-survey code ,very easy and useful

labview程序编程技巧演示，用labview编写windows应用计算器小程序-LabVIEW programming skills demonstration, prepared by LabVIEW applications windows calculator applet

经典小游戏源代码 用vc++实现的 欢迎使用-small game classic source code used to achieve vc welcome to use!

基于TC534的数据采集卡设计，格式为word，论文，看清楚下载，或许对你有帮助-The TC534-based data acquisition card design, the format for the word, papers, look at download, and perhaps help you

数字秒表具有正及时倒计时功能包括一些设计要求和原资料-timer

经典js, 经典js, 经典js, 经典js, -failed to translate

模拟退火算法求解货郎担问题（用C#实现）-simulated annealing algorithm for traveling salesman problem (with C#)

总个数确定后，每张盘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