一个不错的编辑程序

一个仓库管理系统...大家可以研究下-A warehouse management system can be studied under the U.S. ...

这是一个最小堆的模板实现，遗憾的是没有使用模板特化，否则使用起来会更方便，这个实现似乎还有些问题，在析构的时候会出现错误，但是我没有找到原因，很是郁闷。没什么好说的，代码跟书上的没什么两样-This is a template to achieve the minimum heap, unfortunately, do not use template specialization, or else will be more convenient to use, this achievement seems to be some problems in the destructor when an error, but I did not find reason, was very depressed . There" s really nothing, the code is no different with the book" s

c源代码，模拟示波器，开发环境VC6,使用方法见说明-c source code, analog oscilloscopes, development environment VC6, use see note

老人头特效（酷比）php实现代码 ，可以自己修改代码的一些内容。-The first effects the elderly (more than cool) php code, can modify some of the contents of the code.

delphi数字图像处理一书源代码,科学出版社出版.-digital image processing, a source book, the scientific publishing house.

用于实现JAVA树结构的BEAN-used to achieve the tree structure of the Java Beans

C语言程序的基本用法，这对那些想学习C语言的人来说是非常详细和有价值的。

一凸8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。-A convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .

对办公环境的一个管理,可以对指定的程序进行管理.防止一些办工环境以外的程式运行-right of an office environment and management will be designated on the management procedures. To prevent some office environment outside the program running

rom映象识别程序，可以识别出AMI,PHOENIX,AWARD的BIOS映象-rom image identification procedures, can be identified AMI, PHOENIX, AWARD BIOS image