Golden Rules Organizer is a well-structured personal organizer and goal system. It supports three planning levels: mission and values, projects, recurring and one-time activities. It includes a planner facility, and provides diary, time tracking, contact management, and hierarchical notes on any subject. Data can be extracted to spreadsheets, printed, reported, exported, and imported. It provides backup and recovery facilities. It is designed for professionals, and is suitable to novices.
FlashQard helps you to learn any subject that can be learned via a question and answer format. You write a question on a card and the answer overleaf in formatted text. You can also insert as many pictures as you wish. The reviewing method is known as the Leitner system, proposed by Sebastian Leitner in 1970s. This method is a well known and widely used method to efficiently use flash cards and to reduce the amount of study time needed. FlashQard can read your card's text (text-to-speech) as you go through your cards.
Pylsyncd is a Python implementation, similar to lsyncd, that uses rsync to synchronize local directories with several remote machines running rsyncd. Pylsyncd recursively monitors a set of directories using pyinotify, a pure Python module used for monitoring filesystems changes that relies on inotify. The main advantage of pylsyncd against lsyncd is that it uses message queues in order to synchronize several destination servers in parallel, saving up time when it is required to have more than one destination. It has been tested in heavily loaded environments.
Sefira library is meant to provide a well tested and reasonably optimized implementations of some tree comparison algorithms, so that they can be tried out in practical applications. Finding the largest common subtree of two ordered labeled trees is a problem with increasing applications (e.g. in XML processing and computational biology), on which substantial progress has been made in recent years. However, papers on tree comparison may not be available without subscription to the appropriate journals and even when they are, they generally don't contain executable code, so using the new algorithms is non-trivial. Also, there isn't one "best" algorithm yet. Distance definitions differ, and even for the same edit distance, time complexity can be measured on different tree features.