Search - INT 1 - CodeBus

Search - INT 1 - List

[Compress-Decompress algrithms] 7zipDll2 DL : 0: 内存中进行压缩和解压的两个方法：压缩 int RamEncode(Byte *inBuffer, //输入内存缓冲区指针BYTE*类型 size_t inSize, //输入内存缓冲区的大小 Byte *outBuffer, //输出缓冲区指针BYTE*类型 size_t &outSize, //计算出的输出缓冲区大小 Int32 dictionary //字典的大小 ) 解压 int RamDecode(Byte *inBuffer, //输入内存缓冲区指针BYTE*类型 size_t inSize, //输入内存缓冲区的大小 Byte *outBuffer, //输出缓冲区指针BYTE*类型 size_t &outSize, //计算出的输出缓冲区大小 Int32 dictionary //字典的大小 ) 对文件进行压缩和解压的两个方法：压缩： int FileEncode(LPCTSTR inFile, //输入文件路径 LPCTSTR outFile, //输出文件路径 Int32 dictionary //字典大小 ) 解压： int FileDecode(LPCTSTR inFile, //输入文件路径 LPCTSTR outFile, //输出文件路径 Int32 dictionary //字典大小 )-memory compression and decompression of two methods : RamEncode compression int (* Byte inBuffer. / / input buffer memory pointer BYTE * types size_t inSize, / / input buffer memory size Byte * outBuffer, / / output buffer pointer BYTE * types size_t
Date : 2008-10-13 Size : 38.4kb User : 王玮
[Compress-Decompress algrithms] 7zipDll2 DL : 0: 内存中进行压缩和解压的两个方法：压缩 int RamEncode(Byte *inBuffer, //输入内存缓冲区指针BYTE*类型 size_t inSize, //输入内存缓冲区的大小 Byte *outBuffer, //输出缓冲区指针BYTE*类型 size_t &outSize, //计算出的输出缓冲区大小 Int32 dictionary //字典的大小 ) 解压 int RamDecode(Byte *inBuffer, //输入内存缓冲区指针BYTE*类型 size_t inSize, //输入内存缓冲区的大小 Byte *outBuffer, //输出缓冲区指针BYTE*类型 size_t &outSize, //计算出的输出缓冲区大小 Int32 dictionary //字典的大小 ) 对文件进行压缩和解压的两个方法：压缩： int FileEncode(LPCTSTR inFile, //输入文件路径 LPCTSTR outFile, //输出文件路径 Int32 dictionary //字典大小 ) 解压： int FileDecode(LPCTSTR inFile, //输入文件路径 LPCTSTR outFile, //输出文件路径 Int32 dictionary //字典大小 )-memory compression and decompression of two methods : RamEncode compression int (* Byte inBuffer.// input buffer memory pointer BYTE* types size_t inSize,// input buffer memory size Byte* outBuffer,// output buffer pointer BYTE* types size_t
Date : 2026-01-07 Size : 38kb User : 王玮
[Compress-Decompress algrithms] cs DL : 0: 这是专门为 C# 开发者定制的 ZC030X 编程接口。C# 开发者可以如下方式进行调用：首先需要进行声明： ... using System.Runtime.InteropServices public class win32{ [DllImport("zc030xlib.dll", EntryPoint = "capInitCamera")] public static extern int capInitCamera() }-This is specifically for the C# Developer ZC030X customized programming interface. C# Developers can call the following manner: First of all, the need for a statement: ... using System.Runtime.InteropServices public class win32 ([DllImport (
Date : 2026-01-07 Size : 14kb User : mike
[Compress-Decompress algrithms] haffmantree DL : 0: ADT HuffmanTree{ 数据对象：D={ai| ai∈CharSet,i=1,2,……,n, n≥0} 数据关系：R={< ai-1, ai > ai-1, ai∈D, ai-1基本操作P： HuffmanTree() 构造函数 ~ HuffmanTree() 析构函数 Initialization(int WeightNum) 操作结果：构造哈夫曼树。 Encoder() 初始条件：哈夫曼树已存在或者哈夫曼树已存到文件中。操作结果：对字符串进行编码 Decoder() 初始条件：哈夫曼树已存在且已编码。操作结果：对二进制串进行译码 Print() 初始条件：编码文件已存在。操作结果：把已保存好的编码文件显示在屏幕 TreePrinting() 初始条件：哈夫曼树已存在。操作结果：将已在内存中的哈夫曼树以直观的方式显示在终端上 -err
Date : 2026-01-07 Size : 4kb User : 罗罗
[Compress-Decompress algrithms] MDLTPC DL : 0: Source Codes for Multiple Description Lapped Transform with Prediction Compensation (MDLT-PC) This page describes the source codes for the multiple description lapped transform with prediction compensation (MDLT-PC) developed in the following papers: G. Sun, U. Samarawickrama, J. Liang, C. Tian, C. Tu and T. D. Tran, "Multiple description image coding with prediction compensation,?submitted to IEEE Trans. Signal Processing, Feb. 2007. G. Sun, U. Samarawickrama, J. Liang, C. Tu, and T. D. Tran, "Multiple description image coding with prediction compensation," Proc. 2007 IEEE Int. Conf. on Image Processing, Vol. VI, pp. 513-516, San Antonio, TX, Sept. 2007. http://www.ensc.sfu.ca/~jiel/
Date : 2026-01-07 Size : 1.92mb User : gygymon
[Compress-Decompress algrithms] cv3 DL : 0: struct Edge { Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
Date : 2026-01-07 Size : 3kb User : 65400
[Compress-Decompress algrithms] cv4 DL : 0: Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
Date : 2026-01-07 Size : 1kb User : 65400
[Compress-Decompress algrithms] cv6 DL : 0: Edge(int from, int to, int cost) : from(from), to(to), cost(cost) {} friend bool operator<(const Edge& a, const Edge& b) { if (a.cost != b.cost) { return a.cost > b.cost }
Date : 2026-01-07 Size : 2kb User : 65400
[Compress-Decompress algrithms] huffman DL : 0: Huffman编码问题一类广泛存在于文件、音频等数据压缩问题中。如根据Huffman编码的原理，实现对文本进行压缩与解压的功能。因此掌握好Huffman编码的技术可以再社会生活中起到很重要的作用。-HuffmanNode* CreateHuffmanTree(int n, char datas[], int powers[]) { HuffmanNode head head.next = NULL //初始化森林 for (int i = 0 i < n i++) { HuffmanNode*pNode = new HuffmanNode pNode->data = datas[i] pNode->power = powers[i] pNode->lchild = pNode->rchild = pNode->next = NULL AddNode(&head, pNode) }
Date : 2026-01-07 Size : 2kb User : franck
[Compress-Decompress algrithms] A DL : 0: 含有n个int型数的数组中删去若干个成分，使剩下的全部成分构成一个不减的子序列,求数组的不减子序列的长-Contains the number of n-type array of int to delete a number of elements, and thus all the remaining ingredients to form a diminished sub-sequence of the diminished demand an array of long sub-sequence of
Date : 2026-01-07 Size : 6kb User : 零星
[Compress-Decompress algrithms] study DL : 0: 两个数，一个是int类型，一个是double类型，很有意思的时候它们居然相等，你会猜这两个数是什么？你能猜出几种可能？-compard to two number,the one is int,the other is double,but they are...
Date : 2026-01-07 Size : 2kb User : luol
[Compress-Decompress algrithms] intra(verilog) DL : 0: Date : 2026-01-07 Size : 4.62mb User : zyx
[Compress-Decompress algrithms] DArray-Template-better DL : 0: 现在实现的类已经比较好了，用户使用起来很方便。但是，新的问题又出来了。上述的动态数组只能存储double类型的数据。想象一下，另一个用户也想用这个动态数组，但是他处理的数据是int类型的，该如何办？当然，你可以再写一个基于int类型的动态数组类，你发现，大部分的代码都不要改动，只要将类型double变成int即可。如果另一个用户需要处理的是float类型，还有用户处理的是char类型的….该怎么办？这样做的缺点很显然：  这些类的代码大同小异，代码冗余；  当对这个类进行修改时，所有的这些类都要同时改，不利于代码维护；有无办法解决这个问题？即，如果能把变量的“类型”也当作一个“变量”，不就可以了吗？这个在C中是不能解决的，但是在C++中，有一种新的机制template，就可以解决上述问题。Template的使用非常简单，大致的形式见： -Now the class has been better achieved, and the user is easy to use. However, the new issue came out again. The dynamic array can store double types of data. Imagine, another user would like to use this dynamic array, but his handling of the data is int type, how do? Of course, you can write a dynamic array of type int-based class, you find that most of the code have not changed, simply type int can become double. If another user needs to be addressed is the float type, there is the user dealing with the char type .... How to do? This disadvantage is clear:  similar code for these classes, code redundancy  When the right to modify this class, all of these classes should also change, is not conducive to code maintenance Any other way to solve this problem? That is, if the variable can "type" also as a "variable", not to the information? This can not be solved in C, but in C++, there is a new mechanism template, you can solve these problems.
Date : 2026-01-07 Size : 272kb User : 陈婉
[Compress-Decompress algrithms] Huffman DL : 0: 利用huffman算法，压缩文件夹里的所有文件。或将压缩后的文件解压到指定文件夹。-Using huffman algorithm, compressed all files int the folder. Or extract the compressed files to the specified folder.
Date : 2026-01-07 Size : 6kb User : 陈军
[Compress-Decompress algrithms] FitzHughNagumo DL : 0: Unscented Kalman Filter (UKF) exemplified on FitzHugh-Nagumo neuron dynamics. Voltage observed, currents and inputs estimated. FitzHughNagumo.m is the main program which calls the other programs. If you use these programs for your publications etc., please refer to H.U. Voss, J. Timmer & J. Kurths, Nonlinear dynamical system identification from uncertain and indirect measurements, Int. J. Bifurcation and Chaos 14, 1905-1933 (2004). I will be happy to email this paper, which contains a tutorial about estimation of hidden states and unscented Kalman filtering. For commercial use and questions, please contact me.
Date : 2026-01-07 Size : 3kb User : amir
[Compress-Decompress algrithms] RSADES DL : 0: DES和RSA混合加密DES密码体制主要由3方面组成：密钥生成、加密函数以及解密函数。该算法在VC6.0的平台下以C++来实现。子函数说明-　　　Void SetKey(const char* Key, int len) 　　　{ 　　　 Memset(deskey,0,16) 　　　 Memcpy(deskey,key,len>16?16:len) 　　　 SetSubKey(&SubKey[0],&deskey[0]) 　　　 Is3DES = len>8 ? (SetSubKey[1],&deskey[8]),ture) : false 　　　} 　　　Void SDES(char Out[8],char In[8],const PSubKey pSubKey,bool Type) 　　　{ 　　　 Static bool M[64],tmp[32],*Li=&M[0],*Ri=&M[32] 　　　 ByteToBit(M,In,64) 　　　 Transform(M,M,IP_Table,64) 　　　 If( Type == ENCRYPT){ 　　　 For(int i=0 i<16 ++i){ 　　　 Memcpy(tmp,Ri,32) 　　　 F_func(Ri,(*pSUBkEY)[I]) 　　　 Xor(Ri,Li,32) 　　　 Memcpy(Li,tmp,32) 　　　 } 　　　 }else{ 　　　 For(int i=15 i>=0 --i){ 　　　 Memcpy(tmp.Li,32) 　　　 F_func(Li,(*pSubKey)[i]) 　　　 Xor(Li,Ri,32) 　　　 Memcpy(Ri,tmp,32) 　　　 } 　　　 } 　　　 Transform(M,M,IPR_Table,64) 　　　 BitToByte(Out,M,64) 　　　}
Date : 2026-01-07 Size : 128kb User : 何旭
[Compress-Decompress algrithms] wenjianjieyaheduxie DL : 0: java实现文件读写和解压 private static void testInput() { // D盘下有个Welcome.java文件，现在按字节读入： int a = 0 // int counter=0 FileInputStream f11 // 输入流 try {-import java.io.BufferedReader import java.io.BufferedWriter import java.io.File import java.io.FileInputStream import java.io.FileNotFoundException import java.io.FileOutputStream import java.io.FileReader import java.io.FileWriter import java.io.IOException import java.io.InputStream import java.util.Enumeration import java.util.Random import java.util.zip.ZipEntry import java.util.zip.ZipException import java.util.zip.ZipFile
Date : 2026-01-07 Size : 2kb User : 皮卡丘
[Compress-Decompress algrithms] CS2 DL : 0: Python notebook file. compressed sensing utilizing gaussian sensing. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis functions # i.e., we re going N_samps to M samps.-Python notebook file. compressed sensing utilizing gaussian sensing. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis functions # i.e., we re going N_samps to M samps.
Date : 2026-01-07 Size : 344kb User : mnzars
[Compress-Decompress algrithms] CS1 DL : 0: python notebook file compressed sensing using FFT and DCT. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis functions # i.e., we re going N_samps to M samps.-python notebook file compressed sensing using FFT and DCT. where, Both both A and 5 keys are presssed and # sampling rate Fs = 40e3 duration = 1./8 N_samps = int(np.floor(duration*Fs)) # Number of compressed basis functions # i.e., we re going N_samps to M samps.
Date : 2026-01-07 Size : 242kb User : mnzars
[Compress-Decompress algrithms] GARbro-v1.5.44.2904 DL : 0: 创建压缩文件创建诸如AMI、ARC、DAT、INT、KOGADO、NPK、NPA、NSA、PD、RPA等多达五十余种压缩文件，使得一些游戏能在各种平台上使用。转换多媒体文件支持将电脑上运行不了的音频文件、图片文件进行提取转换。直接打开压缩文件软件支持在不打开压缩包的情况下对压缩包内的文件进行查看和修改的功能。(Create compressed files create more than 50 kinds of compressed files, such as AMI, arc, DAT, int, kogado, NPK, NPA, NSA, PD, RPA, etc., so that some games can be used on various platforms. The conversion of multimedia files supports the extraction and conversion of audio files and picture files that cannot be run on the computer. Open the compressed file directly software supports the function of viewing and modifying the files in the compressed package without opening the compressed package.)
Date : 2026-01-07 Size : 9.22mb User : 浅蓝s