Data compression algorithm LZMA, contains c c++ Java and other languages. Realiz...

LZSS压缩算法-LZSS Compression Algorithm

Code for Java compression

实现了自动解方程的功能，并有详细的使用方法说明-Realize the automatic solution of functional equations, and have a detailed description of the use of methods

今天看到的一个还不错的压缩算法程序，希望能对大家的编程能力提高有所帮助！-Today saw a pretty good compression algorithm program, hoping to increase our programming ability to be helpful!

this code is a implementation of the Discrete cosinuss transformation. In this code I have used the direct méthode of calcul by used the equation without used the maatrix multiplication.

地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第i个城市与第j个城市相邻，则metro[i][j]=1,否则metro[i][j]=0。 算法：按照编号从小到大的顺序检查每个城市，对每个城市从1到4使用4种颜色着色，若当前颜色可用（即不与相邻城市颜色相同），则着色；否则测试下一种颜色。 -Map coloring to each city on the map as a point of abstraction, and to every city number, adjacent lines to connect between cities. Accordingly to make adjacency matrix, if the section i and section j cities adjacent cities, the metro [i] [j] = 1, otherwise the metro [i] [j] = 0. Algorithm: In accordance with the code sequence from small to large checks every city, every city on 1-4 from the use of four kinds of color shading, color can be used if the current (ie not with the same colors as the neighboring cities), then coloring Otherwise, the next test colors.

电脑鼠走迷宫，包括探索和冲刺。探索部分路径直接返回起点进入冲刺状态 。-Computer Mouse Maze, including the exploration and sprint. A direct return to the starting point to explore some of the path into the sprint the state.

基于改进K-means的压缩IP 由于k-means本身受异常点影响较大，这里采用迭代k-means的方法，降低异常点的影响，减少计算量和提高聚类数目的灵活性。并添加合并异常聚类方法，提高聚类的均匀性-K-means based on improved compression IP As k-means itself is influenced by outliers, where an iterative k-means method to reduce the impact of outliers, reducing the number of cluster computing capacity and enhanced flexibility. And add the combined abnormal clustering method to improve the uniformity of clustering

包含可用于C语言的zlib.lib和zlib.h-Zlib.lib and zlib.h which can be used in C