FoxMail信息自动填充

这个是我前一段时间在国外网站上找到的16-bit的霍夫曼编解码器。我们常用的都是8-bit的，希望这个对大家有用。尤其是对医学图像，因为其有8位，12位，16位等。-i got this 16-bit huffman codec from abroad website. we usually use 8-bit huffman codec. this source code is especially useful for medical image process.

将黑色转化成白色，谢谢各位使用，祝你性情愉快-Will be transformed into black and white, thank you to use

无链表SPIHT算法，速度比JPEG2000快，压缩比差不多-Listless SPIHT, JPEG2000 faster than the speed, compression ratio almost

这是一个操作系统的作业调度的算法,是用C语言来编程的-This is a system of job scheduling algorithm is the use of C language programming

此软件为用vfp写的一个公交公司管理系统-This software is used to write a vfp bus company management systems

基于windows mfc的多线程程序设计之赛马进度条的显示-Windows mfc-based multi-threaded program design of the race progress bar display

鉴于网上公布的x264调用较为复杂，使很多新手不适，我特意将其进行了简单的封装，并提供了 lib 和 测试程序，该程序已经通过编译，修改 宽高及文件路径等即可运行-In view of online publication called the x264 is more complicated, does not make a lot of novice, I made it for a simple package, and provides a lib and test procedures, the procedures have been adopted by the compiler, modify the path wide and so high and documents can be run

这是关于信源压缩编码里面比较经典的压缩编码算法-Huffman算法的代码！-This is on the inside source coding compare a classic Coding Algorithm-Huffman algorithm code!

0_1背包问题用动态规划解给定n种物品和一背包。物品i的重量是wi，其价值为vi，背包的容量为c。问应如何选择装入背包中的物品，使得装入背包中物品的总价值最大？ 在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。因此，该问题称为0-1背包问题。-0_1 knapsack problem using dynamic programming solution of a given n types of goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.

本程序实现了数据压缩中“算术编码”的全过程。执行环境为 TC 3.0。-realized by the data compression "arithmetic coding" of the entire process. The environment for the implementation of TC 3.0.