Subversion is a version control system. Originally designed to be a compelling replacement for CVS in the open source community, it has far exceeded that goal and seen widespread adoption in both open source and corporate environments. The Subversion project produces Subversion's core libraries (written in C), a fully functional command line client (svn), repository administration programs, API bindings for various languages (Perl, Python, Java, Ruby, etc.), and various additional tools and scripts.
Isobel is a framework to build complex information retrieval and analysis systems. Isobel can be functionally divided in two subsytems, Isobel Gatherer (the crawling and filtering subsystem) and Isobel Analyzer (the analysis subsystem). The two subsytems can also be used separately. Isobel Gatherer offers ready-to-use services like content fetching, scheduling, document format conversion, Hyperlink graph storage and analysis, content storage and indexing. A programmer may easily add new services. Isobel Analyzer uses the IBM UIMA architecture to reuse the analysis components developed for this architecture.
The Darwin Calendar Server is a standards-compliant server that allows multiple users to collaboratively share calendaring information. It provides a shared location on the network to store schedules, and allows users to send each other and manage invitations. In order to provide interoperability with multiple calendaring clients, the server implements the CalDAV protocol, which is an extension of WebDAV, which is in turn an extension of HTTP.
rtorstat is a simple Web page generator that shows status information about the rTorrent bittorrent client. This makes it possible to quickly have an overview of your torrent list from a remote location without having to log into the remote machine that actually runs rTorrent. It can be run through cron or as a CGI script.
Python Web Graph Generator is a threaded Web graph (Power law random graph) generator. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It supports both directed and undirected graphs. It implements a threaded variant of the RMAT algorithm. A little tweak can produce graphs representing social networks or community networks. It can also output connected components in a graph.