我发现这个网站上缺少关于3D

针对二值图像的压缩实现了算术编码以及解码 并在此基础上实现了一节自适应算术编码 有很好的压缩效果-For binary image compression realize the arithmetic coding and decoding and on this basis has been realized a very good adaptive arithmetic coding compression has the effect of

JSP加Servlet加javabeen经典入门源码-jsp-servlet-javabean

仿WinRar解压缩VB版 这个示例就是利用这个动态链接库进行的一些操作，但目前还没有压缩文件的功能，里面的dll函数接口还需要进一步的解析和查找资料，官方好像也没有提供，希望有知道的网友也可以提供一下。更希望感兴趣的网友继续进行挖掘和开发。 源代码附有详细的注释和文档说明。使用前请把压缩包里的 UnRar.dll拷贝到你的计算机的系统文件夹下，如 WindowsSystem32下。-WinRar imitation extract VB version of this example is the use of the dynamic link library to carry out some operation, but it has not been compressed files, inside the dll interface function need further analysis and search for information, the official did not seem to offer hope to have users know that you can provide. Also hope that users are interested in continuing to carry out excavation and development. Source code with detailed notes and documentation. Please use the pre-compression of the bag UnRar.dll copy to your computer s System Folder, such as under WindowsSystem32.

一只菜鸟的串口程序，建议初学者可以看看 希望可以对你们有点用-a serial newcomers procedures, the proposed beginners can hope to see you with a bit

文件压缩中的游程编码源程序。已经测试通过。对重复字符较多的文件压缩率较高。-File compression in the run-length coding source. Have the test. More characters for the duplicate file compression is higher.

Embedded System Design

算术编码，简单实用有效果，欢迎下载，欢迎修改，-Arithmetic coding, simple, practical and effective, welcome to download, welcomed the changes

In each step the LZSS algorithm sends either a character or a pair. Among these, perhaps character "e" appears more frequently than "x", and a pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adaptive kind, along with LZSS.-In each step the LZSS algorithm sends either a character or a lt;position, lengthgt; pair. Among these, perhaps character "e" appears more frequently than "x", and a lt;position, lengthgt; pair of length 3 might be commoner than one of length 18, say. Thus, if we encode the more frequent in fewer bits and the less frequent in more bits, the total length of the encoded text will be diminished. This consideration suggests that we use Huffman or arithmetic coding, preferably of adap

可转换债券原代码-convertible bonds- source

快速哈夫曼编码,压缩性能高于普通的算术编码。-Fast Huffman coding, compression performance than ordinary arithmetic coding.