Ziproxy is a high-performance forwarding (non-caching) HTTP proxy that gzips text and HTML files, and reduces the size of images by converting them to lower quality JPEGs or JPEG 2000. It is intended to increase the speed for low-speed Internet connections (mobile, dial-up, other). It's suitable for both home and professional usage. Ziproxy is fully configurable and also features transparent proxy mode, HTML/JS/CSS optimization, operation in daemon mode, a detailed access log with compression statistics, basic authentication, and more.
check_writable is a Nagios plugin that checks if one or more directories are writable by checking that the supplied directory is indeed a directory, checking if the the filesystem permissions are OK, creating a temporary file, writing random data to the temporary file, and reading it back. It returns a critical status if one of the tests fails.
A reasonable way to achieve a long term backup of OpenPGP (GnuPG, PGP, etc) keys is to print them out on paper. Due to metadata and redundancy, OpenPGP secret keys are significantly larger than just the "secret bits". In fact, the secret key contains a complete copy of the public key. Since the public key generally doesn't need to be backed up in this way (most people have many copies of it on various keyservers, Web pages, etc), only extracting the secret parts can be a real advantage. Paperkey extracts just those secret bytes and prints them. To reconstruct, you re-enter those bytes (whether by hand or via OCR), and paperkey can use them to transform your existing public key into a secret key.
METSlib is an object-oriented metaheuristics framework in C++ designed to make implementing or adapting models easy. The model is modular: all the implemented search algorithms can be applied to the same model. METSlib implements the basics of some metaheuristics algorithms, such as Random Restart Local Search, Variable Neighborhood Search, Iterated Local Search, Simulated Annealing, and Tabu Search. For each algorithm, you must implement an objective function, a neighborhood (move manager), and some moves. Tabu Search is one of the fastest ways to generate near-optimal solutions to a wide range of hard combinatorial optimization problems.