Veusz is a scientific plotting package, designed to create publication-ready Postscript, PDF, or SVG output. It features an easy to use graphical interface as well as a command line interface and can be scripted or embedded in Python scripts. Graphs are constructed in a modular fashion from separate components. Datasets can be interactively modified or created from within the program.

libtld is a library used to extract the TLD from a URI and to check email validity. This allows you to extract the exact domain name, sub-domains, and all the TLD (top level, second level, third level, etc.). The problem with TLDs is that you cannot know where the domain starts. Some domains can use one top-level domain, others use two, etc. However, it may be useful to know where the domain is to have the exact list of sub-domains. For example, if you want to force www. at the start of the domain name if no other sub-domains are specified, then you need to know exactly how many TLD are defined in a URI. The libtld offers one main function: tld(), which gives you a way to extract the TLD from any URI. The result is the offset where the TLD starts. This gives you enough information to extract everything else you need. For emails, the library is capable of parsing a string that represents a list of email addresses to be verified. The verification includes a check of the domain name and its TLD.

VIM Pal is a separate application providing a file tree for VIM. It does not intend to
provide the features of a full IDE.
It is just a simple file tree which can be used to select files for editing in VIM,
and a
bookmark list for jumping to frequently-used directories.

YAGF is a graphical frontend for the cuneiform and tesseract OCR tools. It lets you open already scanned image files or obtain new images via XSane (scanning results are automatically passed to YAGF). Once you have a scanned image you can prepare it for recognition, select particular image areas for recognition, set the recognition language and so on. Recognized text is displayed in an editor window where it can be spell-checked, corrected, saved to disk, or copied to clipboard. YAGF also provides some facilities for a multi-page recognition.

Hypercube is a graph visualization tool for drawing DOT (graphviz), GML, GraphML, GXL and simple text-based graph representations as SVG and EPS images. It comes with a Qt-based GUI application and a Qt-independent commandline tool. Hypercube uses a simulated annealing algorithm to lay out the graph, which can be easily parameterized to achieve the desired look.

The Jamulus software enables musicians to perform real-time jam sessions over the Internet. There is a Jamulus server which collects the audio data from each Jamulus client, mixes the audio data, and sends the mix back to each client.

Knotter is a highly configurable interlace designer. Interlace patterns are a kind of design historically used as a decorations in many places and by different cultures (some examples are Celtic knotworks and Islamic interlaces). Knotter aims to allow its user to design such patterns in an intuitive way and to provide easy ways to integrate the result into external general-purpose graphic software. For this purpose, designs created within Knotter can be saved in a custom human-readable format and exported as Scalable Vector Graphics and in a wide number of raster image formats.

TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.