qqrobot_0.1.3

这个应用程序允许你通过ping远程服务器来监控它们,并返回ping结果的信息()

C语言实现217卷积码的viterbi译码（软、硬判决的代码都有，运行时先在VC中分别运行软、硬判决的C程序，产生误比特率的数据并存储在.txt文件中，之后在matlab中读取数据，画出误比特率曲线，matlab程序也已给出）(C language achieve 217 viterbi decoding (including hard and soft decision,and the codes should be run in VC to generate and store the BER datas,and the to obtain BER curve in matlab))

详细介绍一下VC下的socket编程，并提供一个服务器客户端具体的实例。希望对您有所帮助 (Detailed introduction of VC socket programming, and provide a server client a specific example. Hope will be helpful to you)

WTL编写日历控件,继承EDIT控件自绘而且，可自行修改方便使用(WTL DRAW calendar)

播放器,能播放几种格式的播放器,只是界面比较简单,(Player, can play several formats player, but the interface is relatively simple,)

说明：  许多现代浮点单元的一项主要体系结构功能，是能够将一个乘法与后面紧跟的加法作为单个运算执 行，且没有中间舍入误差。例如，Intel 的 Itanium 体系结构提供了一些指令，将三元运算 (a*b+c) 、(a*b-c) 和 (c-a*b) 中的每一个都组合为单个浮点指令（分别为 fma、fms 和 fnma）。这些单个 指令都比执行独立的乘法和加法指令快，并且因为没有中间乘法舍入，所以更为精确。该优化可以显 著提高那些含有多个交错乘法和加法运算的函数的速度(many modern floating point unit of a major system structure and function is to be a follow closely behind multiplication and addition of implementation as a single operator, with no intermediate rounding error. For example, Intel's Itanium architecture provides a number of directives to the ternary operator (a* b, c), (a* b-c) and (c-a* b) each have a portfolio to a single floating point instructions (Fullmetal respectively, and fms fnma) . These individual instruction than the implementation of an independent and additive multiplication instructions quickly, and because no middle multiplication into homes, so more precise. The optimization can significantly increase those containing more than staggered multiplication and addition operations function of the speed)

DirectX 9.0 3D游戏开发编程基础源代码 初始化Direct3D,绘制流水线，光照，纹理映射，融合，网格，粒子系统，着色器(DirectX 9.0 3D Game Development Programming source code Initializing Direct3D, drawing line, light, texture mapping, integration, grid, particle systems, shaders)

一、完成的实验内容及说明 基本内容 （1）扩充赋值运算：+ 和 - （2）扩充语句 REPEAT <语句序列> DOWHILE <条件> 其中，<条件>是循环条件，即条件成立时，重复执行循环体的< 语句序列> 选做内容 （1）增加运算：++ 和 。 （2）增加类型：① 字符类型； ② 实数类型。 （3）扩充函数：① 有返回值和返回语句；② 有参数函数。 （4）增加一维数组类型 (A, the experiment content and complete The basic content Operation: (1) expand the assignment+ and (2) REPEAT expansion statements < > statement sequence Conditions of DOWHILE < > Among them, the conditions of < > is loop condition, namely conditions founded, repeat the loop body < > statement sequence Choose to do content (1) operation:++ and . (2) types: (1) character types (2) real types. (3) the expansion of function: (1) has a return value and return statement (2) a parameter function. (4) increase a one-dimensional array type)

说明：  但是对于“真二叉树”（每个内部节点都有两个孩子的二叉树），给定它的先序、后序遍历序列足以完全确定它的结构。将二叉树的n个节点用[1, n]内的整数进行编号，输入一棵真二叉树的先序、后序遍历序列，请输出它的中序遍历序列。(But for one proper binary tree, in which each internal node has two sons, we can uniquely determine it through its given preorder traversal sequence and postorder traversal sequence.Label n nodes in one binary tree using the integers in [1, n], we would like to output the inorder traversal sequence of a binary tree through its preorder and postorder traversal sequence.)

hdu 3085 一道bfs题 一点值得注意的，鬼魅先走，mm与gg后走，直接模拟这个这个场景，突出时间的先后性，一秒与一秒的区别。。。这样模拟很难出错(hdu 3085 an ACM question.it is about bfs)