Yangchun Paint

IIS5.0安装所需的系统文件 appconf.d-IIS5.0 to install the required system files appconf.d

用Java写的贪吃蛇的小程序，可以实现这个小游戏的基本功能。贪吃蛇我们都玩过，因此都程序功能不再多说-Snake written by a small Java program can implement the basic functions of this little game. Snake we all played, so all program features will not say

this a book about altera fpga device choice ,it is good for developing eda with fpga

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

把中缀表达式转换为后缀表达后，求表达式的结果。用到栈和队列-Infix expression to convert the expression of suffix, and the results of expressions. Used stack and queue

贪吃蛇--纯粹的结构化思想,在turboc2.0编译器下实现,初学者看看回有点收获.-Snake simply structured thinking, in the compiler under turboc2.0, beginners look back a little harvest.

DSP的一个实验程序，通过该程序可以实现对DSP运行的掌握，还可以熟悉CCS的用法。-a DSP experimental procedure, the procedure can be achieved on the master DSP operations, but also familiar with the use of CCS.

ns2 uwb implementation tcl code.

比Borland的ComboBox多了个自动搜索中文字符串的功能-Borland"s ComboBox than in the out-string Chinese automatic search function

进行的cs算法的仿真，在多合成孔径雷达的成像中chirp-scailing算法还是很红啊-chirp-scailing algorithem is the very good and usefull one