CRC32-Dym

很好的字典生成器，输入关键字，实现排列组合，破解密码的利器(Good dictionary builder, enter a keyword permutations and combinations to achieve, to crack the code of the weapon)

椭圆曲线Elliptic Curve)加密算法(-Elliptic Curve Elliptic Curve) encryption algorithm (

Base 64 加解码程序(The program of BASE 64 encryption and decryption)

MD5 Checksum Calculator source codes

VC++编程，这是一个曾经开发过的早期的版本,对于初学者有益-VC++ Programming, this is a once-off early development version, useful for beginners

解NT密码的源程序-Crack NT password

AML EFFICIENT APPROXIMATE MEMBERSHIP LOCALIZATION WITHIN A WEB-BASED JOIN FRAMEWORK ABSTRACT: In this paper, we propose a new type of Dictionary-based Entity Recognition Problem, named Approximate Membership Localization (AML). The popular Approximate Membership Extraction (AME) provides a full coverage to the true matched substrings from a given document, but many redundancies cause a low efficiency of the AME process and deteriorate the performance of real-world applications using the extracted substrings. The AML problem targets at locating non overlapped substrings which is a better approximation to the true matched substrings without generating overlapped redundancies. In order to perform AML efficiently, we propose the optimized algorithm P-Prune that prunes a large part of overlapped redundant matched substrings before generating them.

这是ge 90-30的versapro这软体，的使用教学手册。-Ge 90-30 This is the versapro this software, the use of teaching manuals.

Base64 加密算法（Author 蒋柏良 Jerry Jiang)-* * DESCRIPTION * Base64 processes input in 24bit chunks by converting each chunk into 4 * bytes of output. It does so by splitting input into four 6bit groups and * using these as indexes in the following substitution table- * const char base64_map[] = * "ABCDEFGHIJKLMNOPQRSTUVWXYZ" * "abcdefghijklmnopqrstuvwxyz" * "0123456789+/" * If an input is not a multiple of 3 bytes, it s padded with zeros. In * this case the output bytes that consist entirely of the pad data are * replaced with = . * * Example * An input of 0x00 0x45 0xF2 is equivalent to 00000000 01000101 11110010 * bit sequence, which s then split into 000000 000100 010111 110010 * and these are substituted to produce the following base64 encoding * A E X y * * RETURN VALUE * b64_length() should return output length for the input of len bytes. * b64_encode() should encode len bytes from src int

这是一个压缩/解压例程使用哈夫曼编码/解码，并且最适合在普通文本的文件。代码是 * 高度 * 进行了优化，并表明这是如何快速我可以提到另一个发现这里在 planetsourcecode （从 2000 年 8 月 1 日) 也采用哈夫曼编码的代码样本。该代码用了 127 秒压缩 1.8 mb 文本文件，但与我的代码，这需要小于 1 秒 ！！(唐山的零时 12700%!!)。其他代码是值得 7 的优异点，这个价值是多少吗？