Moscrack is a WPA cracker for use on clusters. It supports MOSIX, SSH, and RSH connectivity and works by reading a word list from STDIN or a file, breaking it into chunks, and passing those chunks off to separate processes that run in parallel. The parallel processes are then executed on different nodes in your cluster. All results are checked and recorded on your master node. Logging and error handling are taken care of. It is capable of running reliably for long periods of time, without the risk of losing data or having to restart. Moscrack uses aircrack-ng by default. Pyrit for WPA cracking and Dehasher for Unix password hashes are supported via plugins.
Gravity animates HTML page elements using the laws of physics. It uses the Box2DWeb library to animate given page elements so they move, rotate, and collide. The gravity acceleration and direction are configurable. Given callback functions may be invoked when objects collide. Objects' speed and rotation may be affected when the user drags them using the mouse pointer. Each page element can be made static or animated. Animated page elements may include the respective children elements. The elements' friction and density properties can also be configured.
LIME is a dynamic programming language with a LISP-like syntax. It features partial function application, eager and lazy evaluation, call-by-value and call-by-reference, macros, reading/writing LIME code as data, a standard library including infinite streams, and an interactive mode with auto-indentation.
SquidTL allows proxy administrators to manage proxy users: define how much time users can spend on a specific Web site, block sites, limit total time users can spend on the Web daily, and watch users' activity. For example, you can limit the use of Facebook or other social networks with per-user rules or IP. It has a small memory footprint and very fast execution. Management can be done with a smart Web-based administration GUI.
Self-Adjusting Top Tree Implementation maintains a forest that changes over time through edge insertions and deletions. This implementation focuses on the simplified Top Tree interface, which allows you to solve a number of interesting graph problems like finding common ancestors, the heaviest edge, maintaining the diameter, center, or median and other (mostly network flow) problems. Using Top Tree interfaces, all outline problems can be solved in a clean declarative way. This implementation uses adapting ST-trees as the underlying data structure, achieving O(log n) time per expose(v,w) operation. There is also a demo that shows an easy way to integrate the toptree library and the host application.