Bibfilex is software to create and manage archives of bibliographical items (books, articles, etc.) according to Biblatex structure and rules. It is far less advanced than other bibliographic managers like JabRef, and allows only a few customizations. Its strength is speed and lightness, especially when used with many items. It uses SQLite as a database. It can store the items according to each of the entry types described in the Biblatex manual (book, article, etc.), import the content of a file in Biblatex format (like a JabRef database, a Mendeley BibTex exported file, or a Google Books BibTex downloaded file), export data to a Biblatex file (like a JabRef database), locate an item just typing its author name, title, etc. filter the items by selecting a keyword in a list, filter the items according to three different conditions (or to manually modify the SQL statement of the filter to make it more suitable or complex) or according to the \cite commands contained within a Latex document, associate various attachments (files of every kind) with each item, activate autocompletion of data in each field with “Ctrl + Space”, automatically create unique BibTex keys according to a pattern defined by the user, and specify the fields (columns) shown in the grid view of the data. It is also possible to replace the \cite and \printbibliography commands in a Latex document with extended citations and bibliography, which are composed according to a user-defined pattern, to export the Latex file in other formats more easily.
Metrix++ is a platform to collect and analyze code metrics. It has a plugin-based architecture, so it is easy to add support for new languages, define new metrics, and/or create new pre- and post-processing tools. Every metric has 'turn-on' and other configuration options. There are no predefined thresholds for metrics or rules; you can choose and configure any limit you want. It scales well to large codebases. For example, initial parsing of about 10000 files takes 2-3 minutes on an average PC, and only 10-20 seconds for iterative re-run. Reporting summary results and exceeded limits takes less than 1 - 10 seconds. It can compare results for 2 code snapshots (collections) and differentiate added regions (classes, functions, etc.), modified regions, and unchanged regions. As a result, easy deployment is guaranteed into legacy software, helping you to deal with legacy code efficiently, and either enforce the 'leave it not worse than it was before' rule or motivate re-factoring.
DeforaOS Phone is a GTK+ application that has an interchangeable telephony backend, complete with call, contact, and message management. With its backends for GSM modems, it can be used as the telephony application on phones including the Openmoko Freerunner, Nokia N900, and some HTC phones running custom Linux distributions, and as a tethering application that provides Internet access to a desktop computer. Support for VoIP protocols is under development, with a backend based on the sofia-sip library.
Zfswatcher is ZFS storage pool monitoring and notification daemon. It periodically inspects the zpool status and sends configurable notifications on status changes such as disk failures. It also controls the disk enclosure LEDs. There is an embedded Web interface for displaying status and logs.
SNeBU (Simple Network Backup Utility) is a backup system that supports incremental snapshot-style backups to disk-based storage. The project has been rewritten in C, and stores its backup catalog in an SQLite database. It features file level deduplication (including across multiple clients), compressed storage, incremental-forever snapshot style backups, simple setup, and utilizes standard TAR format. The client side consists of a simple shell script, which can be easily installed and adapted as needed. The server side is a single binary plus a config file, which can sit on a remote server and be accessed over SSH.
cola is a C implementation of the COLA structure described in the paper "Cache Oblivious Streaming B-Trees" by Bender, Farach-Colton, et al. This algorithm is a drop-in replacement for B-Tree databases/indexes which performs faster on spinning disks than B-Trees do on SSD. It's asymptotically optimal in terms of data transfers to and from disk. For example, random key inserts are turned into linear sequential writes while maintaining the property which queries always require, at most, precisely log N blocks read sequentially (but not contiguously) from disk (or half that, on average).