-
source of this development is a simple Java chat room. For your reference, make...
此源码是个JAVA开发的简单聊天室。给大家参考，提提意见。-source of this development is a simple Java chat room. For your reference, make a suggestion.
- 2022-07-10 12:28:14下载
- 积分：1
-
网上流量分析系统
网上流量分析系统-Internet traffic analysis system
- 2022-02-06 19:54:53下载
- 积分：1
-
DES算法完整源码与调用方法
DES算法完整源码与调用方法-DES algorithm source code integrity and call methods
- 2022-01-26 04:25:43下载
- 积分：1
-
灰色系统用于预测未知数据，是一种比较好的方法，此程序只需改变原始数据即可得到结果！...
灰色系统用于预测未知数据，是一种比较好的方法，此程序只需改变原始数据即可得到结果！-Gray system is used to predict the unknown data is a better method, this procedure simply by changing the raw data you can get the results!
- 2022-03-25 12:10:14下载
- 积分：1
-
【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示...
【文本与二值图像的游程】1. 文本游程压缩的原理 对重复字段采用3符号标识法：(1) 重复提示符,比如@,#等；(2) 游程长度参数或重复次数,若用一个字节表示,最大长度可为255个重复字；(3) 重复字符。以上三部分合称为重复因子。可见要获得压缩效益，重复字符应在3个以上。2. 图像游程压缩的原理 对于二值图像，原始数据为零一矩阵，压缩时逐行处理该矩阵：(1) 连续n个1，表示为+n；(2) 连续n个0，表示为-n。-text and binary image-- an outbound trip. Yu Cheng text compression principle on repeated field using three symbols logo Act : (a) repeat prompt, such as @,#, etc.; (2) Run-length parameters, or the number of repeat, if using a byte, the largest the length of 255 to repeat the word; (3) repeat characters. More than three as part of a repeat factor. Visibility to gain compression efficiency, duplication of characters in three more. 2. Run-image compression for the principle of two binary images, a zero original data matrix, progressive compression deal with the matrix : (1) n a row, n; (2) consecutive n 0, expressed as-n.
- 2022-05-06 21:11:33下载
- 积分：1
-
一个简单的窗口操作，希望对大家有帮助了
一个简单的窗口操作，希望对大家有帮助了-A simple window operation and hope we have helped ~ ~ ~ ~
- 2023-09-05 03:45:03下载
- 积分：1
-
此代码为霍夫曼编码和LZ7编码的联合实现，它能较高地提高无损压缩及解码的速度...
此代码为霍夫曼编码和LZ7编码的联合实现，它能较高地提高无损压缩及解码的速度-this code for the LZ7 Huffman coding and encoding of the Joint Implementation, to raise it higher lossless compression and decoding speed
- 2022-01-26 05:00:56下载
- 积分：1
-
Map coloring to each city on the map as a point of abstraction, and to every cit...
地图着色把地图上的每个城市抽象为一个点，并给每个城市编号，，相邻的城市之间用直线连接。据此做出邻接矩阵，若第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.
- 2022-02-12 12:09:41下载
- 积分：1
-
用JAVA语言实现的压缩解压Zip文件
用JAVA语言实现的压缩解压Zip文件-using the Java language extracting Zip file compression
- 2023-01-15 05:40:03下载
- 积分：1
-
ITU
ITU-T G.723.1语音编解码算法源代码-ITU-T G.723.1 speech codec algorithm source code
- 2022-10-11 05:20:03下载
- 积分：1
