基于LABVIEW平台的声卡的频谱分析仪，希望对大家有所帮助。

很不错的php聊天室源码,提供给大家学习-Very good source php chat room, available to everyone to learn

编译原理的实验课设，设计一个词法分析器，实验要求如下：1．  正规式：               标识符                  (|)*               十进制整数       &nbs

本程序是基于灰色预测理论的灰色预测的算法实现-This procedure is based on the gray gray prediction theory prediction algorithm

文章介绍了海洋界面参数估计及传播损失的射线声学预报方法-Article introduced the marine interface parameter estimation and dissemination of the loss of forecasting methods for acoustic ray

一个完成文件，贪吃蛇游戏，汇编语言版的，是本人学习汇编语言时做的。-a completed document, Snake games, the assembly language version, I am learning assembly language so.

hdl demo of a program uploaded

在当今,流行的编程软件种类繁多，它们编程方便、易于维护，但是在与硬件直接打交道和编制系统软件时却束手无策，于是C语言就有了用武之地。C语言作为汇编语言与高级语言之间的一种过渡语言，兼有汇编语言的高效和高级语言的方便。 　　在通讯中，为了保证行运安全可靠，标准的串行口必须具有许多握手信号和状态信息。这是因为通讯的各个计算机CPU速度不一样（这会导致“错帧”）以及发送机发送数据速度比接收机接收速度快（这会导致“过冲”）。为解决这个问题，我们采用一个简单的握手信号，即发送机每次仅发送半个字节（低4位）的数据，而另外半个字节（高4位）则用来传送信息。我们可以对信息位（高4位）进行如下简单的编码：-today, the popularity of the wide variety of software programming, is easy to maintain, but to deal directly with the hardware and system software when compiled a loss, so there will be a C language battlefield. C language as the compilation and Advanced Language a transition between languages, both assembly language and the efficient high-level language convenience. In telecommunications, in order to ensure safe and reliable transport firms, the standard serial I must have shook hands with many signals and state information. This is because the various computer communications CPU speed is not the same (this would lead to "the wrong frame") and transmitter to send data faster than fa

写了一个小程序，听往上说什么将类的申明放在namespace里面的话，该类就不能再派生了，我做的这个程序还可以派生，不知道这是怎么回事

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

热血精灵――纯绿色游戏辅助工具，暂不提供源代码-Blood wizard- Pure Green game aids, not to provide source code