实现（7,4）循环码的编码和解码，生成多项式…

合成实验的上位机程序，主要用于考核高压断路器开断能力的一种重要方法，也是考核特大容量高压断路器开断能力的唯一可行方法。主要实现数据的采集与存储，和对同步控制装置的参数配置。-PC synthesis experiment procedures, mainly for assessing the capacity of high-voltage circuit breaker an important method, but also assess the capacity of large capacity high-voltage circuit breaker the only viable approach. The main data collection and storage, and synchronization control device configuration parameters.

ns2 wireless仿真 tcl脚本实例 很有参考价值-ns2 wireless simulation

这是VC++中的一些快捷键，希望对大家有用-This is VC++ Some of the shortcut keys, in the hope that useful

VIPer53设计的开关电源,SCH及PCB,效率56％,很想提高效率,但有点难度.希望大家讨论.-VIPer53 switching power supply design, SCH and PCB, the efficiency of 56 percent, wanted to improve efficiency, but it

for the just beginning learn the computer person,use DOS is boring . after known a little DOS,think dos is mysterious.this is the book introduce how to use dos deeply.

火柴游戏 21根小火柴谁拿到最后一根则输-Match 21 small game matches who will get a final losers

an approach for capturing similarity between words that was concerned with the syntactic similarity of two strings. Today we are back to discuss another approach that is more concerned with the meaning of words. Semantic similarity is a confidence score that reflects the semantic relation between the meanings of two sentences. It is difficult to gain a high accuracy score because the exact semantic meanings are completely understood only in a particular context.

移动硬盘盒的电路图,包括原理图和PCB。-Mobile hard disk box of circuitry, including schematic and PCB.

Matlab语言编写的2维粒子群算法进行函数最优化的源代码，并附有AVI视频演示！-2-D particle swarm optimization source code for optimization (with the AVI video!)

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