OTRS is a platform independent Web-based help desk system that supports service organization of any kind (e.g. IT service, customer and technical product service, complaint management, public services, etc.) to increase their efficiency. It increases transparency as well as service quality and lowers your total cost of ownership. It has been certified ITIL V3 compatible by PinkVERIFY for incident, problem, change, service asset and configuration, request fulfillment, and knowledge management. Other ITIL processes like service catalog and service level management are supported as well.
Cedar Backup is a software package designed to manage system backups for a pool of local and remote machines. Cedar Backup understands how to back up filesystem data as well as MySQL and PostgreSQL databases and Subversion repositories. It can also be easily extended to support other kinds of data sources. Cedar Backup is focused around weekly backups to a single CD or DVD disc. It supports multisession discs, allowing you to add incremental data to a disc on a daily basis. Cedar Backup also provides a Python library of backup-related functionality.
Maveryx is an automated functional testing tool. It provides testers with automated testing capabilities for functional testing, regression testing, GUI testing and data-driven testing. It does not require you to pre-record or capture any GUI Maps (or ‘Test Object Maps’) to create and run tests. During test execution, Maveryx takes ‘snapshots’ of the application user interface and automatically identifies the UI Objects to test. The tool includes fuzzy matching algorithms to unambiguously locate objects at runtime, even if the objects have changed since test creation. Maveryx also provides the ability to automate keywords, to validate dynamic data, to create data-driven tests, and to support custom controls. It is platform independent and runs as a standalone application or as an Eclipse plugin.
Capsule Tree is a general purpose, self-balancing tree data structure for large, ordered data sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees.