Pcompress is an archiver that can do compression/decompression and deduplication in parallel by splitting input data into chunks. It has a modular structure and includes support for multiple algorithms like LZMA, Bzip2, PPMD, LZ4, etc., with KECCAK/BLAKE2/SHA-256/512 chunk checksums. SSE optimizations for the bundled LZMA are included. It also implements chunk-level Content-Aware Deduplication and Delta Compression features based on a Polynomial Fingerprinting scheme. It has low metadata overhead and overlaps I/O and compression to achieve maximum parallelism. It has AES encryption capability and uses Scrypt from Tarsnap to generate per-session unique keys from passwords. It can work in pipe mode, reading from stdin and writing to stdout. It also provides some adaptive compression modes in which a suitable algorithm is chosen per chunk based on heuristics.
The mctdhtools project aims to provide a set of routines for easily reading and manipulating the output of the Heidelberg MCTDH code. Its goal is to allow a new user to quickly get started with writing custom analysis programs, and to allow more experienced users to write small, clean, and testable analysis programs, something that seems incompatible with the Fortran-77 code of the Heidelberg MCTDH package.
validator.py is a tool for ensuring that data conforms to certain sets of rules, called validations. A validation is essentially a schema for a dictionary, containing a list of rules for each key/value pair in the dictionary you want to validate. This is intended to fill a similar use case to form validations in WTForms or Rails, but for general sources of data, not just Web forms.
Aspose.OCR for Java is a character recognition component that allows developers to add OCR functionality in their Java Web applications, Web services, and Windows applications. It provides a simple set of classes for controlling character recognition tasks. It helps developers to work with image files from within their Java applications. It allows developers to extract text from images and read font and style information quickly, saving time and effort involved in developing an OCR solution from scratch.
Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.
Soffid IAM offers a complete and integrated solution for controlling access to enterprise applications. It provides you with everything you need to obtain accurate information about who uses your systems, manage the whole user provisioning lifecycle, and bring users an enhanced experience by removing the need to enter credentials every time they access your business applications. It provides a single point of audit and control for assessing data security regulatory compliance.
WallCalendar is a set of LaTeX wall calendar templates and utilities for managing them. Users can customize templates or create their own. It includes a template that produces Interior and Covers, which are ready to be uploaded to lulu.com for printing on demand. It also contains a calendar Web site example (generated using the txt2site utility) that integrates with a paper calendar via QR codes.