RufasCube is a slider puzzle where there is a 3x3x3 arrangement of cubelets with the center one missing, allows sliding permutations. After a randomization, the goal is to restore the cube to its original configuration based on color and alphabetic hints. It is challenging, but not as difficult as a Rubik's cube. Here, diligence pays off. Also, incremental solution is possible - you can unscramble one slice at a time. When you finish, you can see the entire English alphabet appear on the 26 cubelets. It supports laptops and Mac Retina displays.
RufasGate is a combination of the Portal and Sokoban games. Using stargate terminology, there are Zero Point Modules (ZPMs) that power the portal guns, which in turn create the two ends of a temporary and short range wormhole, a shortcut through space-time, that allows obstacles to be bypassed. In order to empower the portal guns, all cylindrical ZPMs must be bumped onto their base receptacles. There are currently only four levels, and no way to save a game. RufasGate is also a testbed for learning/illustrating various modern OpenGL techniques including cubemaps, water reflections, sound, and glsl shader capabilities. For anyone planning to use SDL2, it illustrates key-mapping, to get improved keyboard responsiveness from SDL. It supports laptops and high DPI Mac Retina displays.
privacyIDEA is a multi-factor authentication solution. It can manage any type of authentication device. All common OTP (one time password) devices are supported, including Google Authenticator, eToken Pass, OTP cards, Yubikey, SMSOTP, and mTAN/mobileTAN. New devices can be added easily. Users can be retrieved from flat files, LDAP, Active Directory, SQL databases, and SCIM services. It can also handle authorization and writes all events to a digitally signed audit log, giving you basic AAA functionality.
The Link Grammar Parser (link-grammar) is a syntactic parser of English, Russian, Arabic, and Persian (and other languages as well), based on link grammar, an original theory of English syntax. Given a sentence, the system assigns to it a syntactic structure, which consists of a set of labelled links connecting pairs of words. The parser also produces a "constituent" (Penn tree-bank style phrase tree) representation of a sentence (showing noun phrases, verb phrases, etc.). The RelEx extension provides dependency-parse output.
twyg lets you visualise arbitrary tree structures in a pretty way. The appearance of the tree (layout, color, node, connection shapes, etc.) is fully controlled via configuration files in a generative way. This means that almost all visual properties of the output can be controlled by expressions that depend on the characteristics of the tree (e.g. the color or shape of a node can be a function of its hierarchical position in the tree). This allows for crafting very flexible configurations that can be applied to trees of arbitrary size and complexity. It supports the Cairo and NodeBox1 rendering backends.