FileTrack is a Web-enabled communication log, keeping track of all your inbound and outbound documents. It supports multiple logs, auto-archiving of older entries, and generates simple reports based on multiple criteria. One or more log entries, contacts, or documents can be grouped together into an issue for easier monitoring.
ganttweb is a tool for publishing Gantt charts on the Web. It dynamically translates ganttproject (.gan) or GNOME Planner (.planner) files into HTML. You can also use the core of the program (an HTML file) as a template for building standalone Gantt charts in HTML format for desktop or email use.
Pocoo is a bulletin board software (a.k.a. message board). It provides an advanced plugin system with a component architecture which allows other developers to modify Pocoo to their liking without the need to touch existing source code. Because it uses SQLAlchemy, it is possible to use either MySQL, SQLite, Oracle, or Postgres as the storage backend.
Evergreen is an integrated library system originally developed by the Georgia PINES consortium for use as their automation system, and now includes contributions from around the world. It was designed from scratch for large-scale deployment in very large public library and state-wide consortium environments with tens of millions of records and hundreds of libraries, but can also scale down to the smallest of single-branch libraries.
Tahoe-LAFS (Least Authority File System) is a decentralized data store. It distributes your filesystem across multiple servers, and even if some of the servers fail or are taken over by an attacker, the entire filesystem continues to work correctly and to preserve your privacy and security.
Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.