Microsoft MS-DOS 6.22 [Virtual PC VHD]

非常快速的TVAL3算法的3D形式，可以解决三维图像的去噪和重建(Very fast three-dimensional form of TVAL3 algorithm can solve the denoising and reconstruction of three-dimensional images.)

计算机组成原理习题与解答 下 白中英-computer principle and answer the questions which the British white

单片机开发包c51中文版,单片机技术的发展以微处理器(MPU)技术及超大规模集成电路技术的发展为先导，以广泛的应用领域拉动，表现出较微处理器更具个性的发展趋势。(SCM development kit c51 Chinese version, the development of single-chip technology to microprocessors (MPU) technology and ultra-large-scale integrated circuit technology development as the guide to a wide range of applications to pull, showing a more personalized micro-processor development trend.)

Speech and Language Processing.pdf

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)

没有什么功能，真的没有，你要不信就打开看看。。。说你不听，说了也白说-something

计算语音信号的信噪比和分段信噪比，在matlab中使用(Computing signal-to-noise ratio and segmentation SNR of speech signals are used in MATLAB)

http://www.bc-cn.net/Article/kfyy/cyy/jc/200409/5_4.html float aver(float a[5]) { int i float av,s=a[0] for(i=1 i

自己做的一款手机RPG游戏 虽然不是很好 但是值得新手-Own a cell phone to do the RPG Game, though not very good but it is worth novice

一个用C++Builder编写的俄罗斯方块游戏-a C Builder sheet prepared by the Russian game