Deploy in 115+ regions with the modern database for every enterprise.
MongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
Start Free
$300 Free Credits to Build on Google Cloud
New customers can spin up VMs, build with AI, and query data at no cost.
Put your $300 in credit toward real workloads, then keep building with free monthly usage for 20+ products. No commitment and no charge until you upgrade.
NuFX or "ShrinkIt" archives are the de-facto standard in the Apple II (and A2 emulator) world. NufxLib is a full-featured library of functions that manipulate NuFX archives (.SHK, .SDK, .BXY). NuLib2 is a command-line utility built on top of NufxLib.
THIS PROJECT HAS MOVED TO GITHUB
https://github.com/fadden/nulib2
Using the LZMA compression library ported to c#, I intend to make a multi threaded archival system, that will compress files (slice them a set number of times) and use up to 4 threads for compressing those files.
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.
Basic Compression Library is a portable library of well known compression algorithms, such as Huffman coding, written in standard ANSI C. It is intended to serve as a set of building blocks for specialized compression algorithms.
Windows Setup tool specifically designed for installing PhotoShop comp
Moved to: https://github.com/vanderlee/Plugin-Setup
Windows Setup tool specifically designed for installing PhotoShop compatible plug-ins. Will recognize all Windows PhotoShop plug-in compatible hosts and allow the user to pick which hosts the plug-in should be installed for.
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
minihuff is a data compression library that enables the creation of a static frequency table to be stored at both ends of a connection. This allows effective compression even for very small pieces of data that maintain similar entropy characteristics.
rpmdiff is a utility to create a binary patch from one version of an rpm to another. This binary patch can then be distributed to end-users of a distribution who have installed the first version of the rpm and they will be upgraded to the second version.
This program parallelizes the BZIP2 compression process to achieve a near-linear performance increase on SMP machines. On a two-processor Xeon machine, the speedup is around 180%. The tool's main purpose is to aid performing heavy-duty server backup
PKC (PacKageCommander) is a package manager utility with ncurses and GTK+ interface. You can install/uninstall Debian or RPM packages, or you can configure, build and install a program from a source, and you can make a Debian or an RPM package, and it ca
LICOM is a compression/de-compression tool that sits in-between the browser and content from the server. It aims to facilitate compression of ASCII text, RTF, DOC, PDF, HTML, GIF, JPG, BMP and similar filetypes.
Numerically estimate an efficiency of code construction algorithms. Randomly generate n binary words of length m with minimum Hamming distance d and create a prefix code (= retrieval tree) from them. Based on PhD work.