a book is about how the J2EE servlet played since own role.

贝叶斯实现方法 很简单使用 希望大家继续完善-bayes

从GPS输出数据中分离出经纬度，日期，时间，速度等有效信息。-output data from the GPS isolated longitude and latitude, date, time, speed and effective information.

C++ 中.x导入文件的一个 应该会很有用的 我也在寻找其他的-C++,. X import files in an

推箱子游戏,直得对游戏开发的朋友学习或参考.-Sokoban games, straight to the game developers have a friend learning or reference.

IS62LV1024测试程序，实现该芯片的所有功能；-IS62LV1024 test procedure, the realization of all the features of the chip

ATA-PC-card(PCMCIA)卡的规范，对开发PCMCIA接口驱动的同志很有用的。-ATA-PC-card (PCMCIA) card specification, the PCMCIA interface driver development comrades very useful.

seg2格式数据读取，自编，经过测试，完全正确，作者姓名缩写wnc

优化系统工具，优化你的系统，使你的系统更加快捷，便利，是你用电脑的必备工具-Optimization System Tools, and optimize your system, so that your system faster and more convenient, is your computer an indispensable tool for

Nano2410A V2.0用户手册 Nano2410A V2.0用户手册-Nano2410A V2.0 user manual Na no2410A V2.0 user manual Nan o2410 A user manual V2.0

平衡二叉树操作的演示 一、 需求分析 （1） 利用平衡二叉树实现动态查找表。实现查找，插入和删除三种基本功能。 （2） 初始，平衡二叉树为空树，操作界面给出查找，插入和删除三种操供选择。每种操作均要提示输入关键字。每次插入和删除一个接点时，显示更新的平衡二叉树。 （3） 重点在于对删除算法的实现。假设要删除的关键字为X的结点，若X不在叶子结点上，则用左子树中的最大值或者右子树中的最小值取代X。如此反复，直到删除动作传递到某个叶子结点，删除叶子结点时，若要进行平衡变换，可采用插入的平衡变换反变换。 -balanced binary tree operation of a demonstration, demand analysis (1) using a balanced binary tree dynamic lookup table. Lookup, insertion and deletion of the three basic functions. (2) The initial, balanced binary tree is empty tree interface gives you insert and delete options for the three parade. Each operation will have to be me to input keywords. Each insert and delete a contact in that update balanced binary tree. (3), the focus is on the deletion algorithm. To remove the assumption that the keyword for the X-Node, if X is not the leaf nodes, Left-used for the highest tree or right-tree to replace the minimum X. So repeatedly, until the deletion of a transfer leaf nodes, delete the leaf nodes, if balancing transform, Ins