Backshift is a deduplicating (variable-sized, content-based blocks), compressing (xz or bz2) backup program. Full saves and incrementals are pretty indistinct other than the amount of data transmitted, somewhat like with "rsync --link-dest" but without the huge number of hardlinks. It also de-duplicates large file content at a granularity of about 2 megabytes on average; there tends to be a unique copy of each file with size less than around 2 megabytes on average.
JavaAutotoolsExample is an example of a Java Swing program that uses GNU Gettext, Autoconf, Automake, Make, and Java JNI. JavaAutotoolsExample is intended to help Java developers and maintainers make their full-featured Java programs respect the standard "./configure && make && sudo make install" procedure for build and installation.
phalanx computes a digest of many buffers simultaneously, and produces a combined hash of them all. It is an initiative to provide a fast, simple, and portable alternative method to compute a checksum in a parallel fashion. It has options for I/O buffer size, hash width, number of threads, and more. It can be run single-threadedly for performance comparisons. It can check files against previously-saved sums, like "MD5sum" does. It also has a "demo" mode, to ascertain accurate operation. It is intended to be useful on large files and multicore/multiprocessor/multithreaded environments.
xlife is a laboratory for experimenting with cellular automata. It supports loadable rulesets and palettes, different topologies, and up to 256-state cellular automata. It has rules and patterns for Life, Brian's Brain, Perrier's Loops, Langton's Ants and Loops, Wireworld, E.F. Codd's 1975 UCC automaton, some Prisoner's Dilemma games, and many others. It is very fast for step-by-step mode, bounded grid, and chaotic patterns. It has several unique features: a historical mode, a pseudocolor mode, and n-state statistics. It has been developed since 1989. The modern version of Xlife began its history in 2011.