Free more efficient software for linux

jMemorize is a Java application that manages your flashcards by the famous Leitner system and makes memorizing facts not only more efficient but also more fun. jMemorize manages your whole learning progress and features statistics, categories and a visually appealing and intuitive interface.
The basic idea is to divide the cards into different decks depending on the difficulty they present to you. This is done by repetitive quizzes in which you try to answer the question out of your mind. Every time you know the correct answer to a card, it is put on the next higher card deck. If you fail at a card, it is put back to the starting deck.
This system is combined with time schedules. Cards that have been known, are considered to be learned until a specific expiration date has passed. The higher the deck, the more far away the expiration date is set.
For example might a card that has been successfully checked for the first time be scheduled to be relearned one day later again, while a card that has been correctly answered three times in a row might be considered as learned for about week. As long as a card is considered learned, it wont appear in learn sessions.
As a whole, this system manages your personal learn sessions and allows you to focus on learning, while it automatically decides which facts should be learned right now to make the most out of your time.
Main features:
- Create, edit, remove and reset cards.
- Arrange cards by creating card categories.
- Have a visual representation of your current learn situation.
- Customize your learn session setting in nearly every way imaginable. This includes the abilities (among others) to..
- choose which category to learn.
- choose to learn only new cards, expired cards or all cards.
- choose card/time limits.
- choose whether you want learn cards in normal mode, with flipped card sides or randomly flipped card sides.
- choose from different preset time schedules or enter you own custom time schedule.
- Search through your cards with the find tool.
- And much more..

Compact Filter is a network packet filter for Linux. It features an easy-to-use compact filter representation and high performance.
The main features are: easy to use interface, compact filter representation (memory efficient), and very high performance.
A difference between CF and other firewalls, such as Netfilter, is its representation of the ruleset. In CF the user writes a filter which is then compiled and optimized in user-space. The optimized filter is then loaded into the kernel (using netlink). Consequently the in kernel packet filtering code only needs funtionality for setting up a filter and filtering packets, while the more complex code of optimizing the filter remains in user-space.
Because of the continuous increase of the bandwidth and the security threats, firewalls have to evolve towards more efficient filtering schemes. The truth is that the existing scheme does not scale so well with the combined growth of bandwidth and rulesets.
Our aim is to try another approach to perform packet filtering where we minimize the complexity of the filtering process. This result in, both, a reduction of the required CPU power to filter packets and a simpler (and smaller) kernel code. Of course, we are pushing all the smart and complex part out to the user-space, but, developing in user-space is much simpler and safer.
Enhancements:
- changed -d option to delete all filters
- added -D option to delete a specific filter
- changed default policy to permit rather than deny
- added -l option on flex to support --yylineno on older versions of flex
- new and improved install guide

monotone is a distributed version control system with a flat peer model, cryptographic version naming, meta-data certificates, decentralized authority, and overlapping branches.

monotone works out of a transactional version database stored in a regular file, and uses a custom network protocol for efficient database synchronization.

BigInteger is an arbitrary length integer extension module for Perl.

SYNOPSIS

use Math::BigInteger;

The BigInteger extension module gives access to Eric Youngs bignum library. This provides a faster alternative to the Math::BigInt library.
The basic object in this library is a BigInteger. It is used to hold a single large integer.

It is not intended that this package be used directly, but instead be used by a wrapper package, such as the Math::BigInteger class.

FUNCTIONS

Many of the following functions can be used in two styles, by calling the function on an object, or by calling the function explicitly; for example, here are two ways of assigning to $a the sum of $b and $c:

$a->add($b, $c);
or

BigInteger::add($a, $b, $c);

Creation/Destruction routines.

new
my $bi = new BigInteger; # Create a new BigInteger object.
clone
my $b = $a->clone();

Create a new BigInteger object from another BigInteger object.

copy
copy($a, $b);

Copy one BigInteger object to another.

save
my $data = $bi->save();

Save a BigInteger object as a MSB-first string.

restore
my $bi = restore BigInteger $data;

Create a new BigInteger object from a MSB-first string.

Comparison functions

ucmp
ucmp($a, $b);

Return -1 if $a is less than $b, 0 if $a and $b are the same and 1 is $a is greater than $b. This is an unsigned comparison.

cmp
cmp($a, $b);

Return -1 if $a is less than $b, 0 if $a and $b are the same and 1 is $a is greater than $b. This is a signed comparison.

Arithmetic Functions

inc $bi->inc();

Increment $bi by one:

dec $bi->dec();

Decrement $bi by one:

add
$r->add($a, $b);

Add $a and $b and return the result in $r.

mul
$r->mul($a, $b);

Multiply $a by $b and return the result in $r. Note that $r must not be the same object as $a or $b.

div
div($dv, $rem, $m, $d);

Divide $m by $d and return the result in $dv and the remainder in $rem. Either of $dv or $rem can be undef, in which case that value is not returned.

mod
$rem->mod($m, $d);

Find the remainder of $m divided by $d and return it in $rem. This function is more efficient than div.

lshift
$r->lshift($a, $n);

Shift $a left by $n bits.

lshift1
$r->lshift1($a);

Shift $a left by 1 bit. This form is more efficient than lshift($r, $a, 1).

rshift
$r->rshift($a, $n);

Shift $a right by $n bits.

rshift1
$r->rshift1($a);

Shift $a right by 1 bit. This form is more efficient than rshift($r, $a, 1).

mod_exp
$r->mod_exp($a, $p, $mod);

Raise $a to the $p power and return the remainder into $r when divided by $m.

modmul_recip
modmul_recip($r, $x, $y, $m, $i, $nb);

This function is used to perform an efficient mod_mul operation. If one is going to repeatedly perform mod_mul with the same modulus is worth calculating the reciprocal of the modulus and then using this function. This operation uses the fact that a/b == a*r where r is the reciprocal of b. On modern computers multiplication is very fast and big number division is very slow. $x is multiplied by $y and then divided by $m and the remainder is returned in $r. $i is the reciprocal of $m and $nb is the number of bits as returned from reciprocal. This function is used in mod_exp.

mul_mod
$r->mul_mod($a, $b, $m);

Multiply $a by $b and return the remainder into $r when divided by $m.
reciprical
$r->reciprical($m);

Return the reciprocal of $m into $r.

Miscellaneous Routines

num_bits
my $size = $bi->numbits();

Return the size (in bits) of the BigInteger.

gcd
$r->gcd($a, $b);

$r has the greatest common divisor of $a and $b.

inverse_modn
$r->inverse_modn($a, $n);

This function creates a new BigInteger and returns it in $r. This number is the inverse mod $n of $a. By this it is meant that the returned value $r satisfies (a*r)%n == 1. This function is used in the generation of RSA keys.

phpWebTickets provides a partial rewrite of phpSupport.
phpWebTickets is a partial rewrite of phpSupport by Chris S. It sports a templated design using Smarty, cleaned up code, and added features.
Features will be added after the initial movement to Smarty and code cleanup have occurred, but small improvements will most likely sneak their way in there during the migration.
Main features:
- Simplicity of functionality
- Multilingual Interface
- Full email notification functionality (sending and recieving)
- Fast and Easy Setup
- Read the original phpSupport site for more information
- Templated User Interface (using Smarty)
- CSS
- Cleaner code layout (less confusing if you want to mod)
- A more efficient DB design
- Overall code rework... in particular:
- Rework the current queries so they are more efficient
- Remove superfluous code
- Put reusable code into functions
Enhancements:
- Code cleanups and cosmetic changes were made.
- The ticket filter and ticket listing sections were rewritten and the font tags were changed to use CSS.
- The templates were also cleaned up.

Metastorage is a PHP data access object generator compiler tool.
Metastorage is an application that automatically generates code for an Object Oriented API to store, retrieve and manipulate the persistent objects of classes described in a high level data model definition.
Metastorage provides a much more efficient development process for medium or large size applications that store and retrieve data from SQL based databases or other types of storage persistence containers, like XML files, flat file databases or LDAP servers.
When storing objects in SQL databases, Metastorage generated code performs efficient object-relational mapping. Metastorage antecipates static storage optimization decisions at compile time, so applications gain in performance, code size and memory usage by avoiding evaluating static decisions at run time.
Main features:
XML definition format
- Easy to write and understand component definition format in XML
Database schemas
- Automatic generation of (database) schema definition of the persistence container
Automatic generation of all classes
- Generates all the code for the data classes, factory class and (database) schema installation class
Self-contained code
- The generated code is self-contained and does not depend on MetaL or libraries of code that are not supplied
Object Query Language
- Provides an Object Query Language (OQL) to define expressions to filter objects in search queries
No SQL
- All code is generated without the need for the developer to write SQL code manually
Forms
- Generation of classes to create, validate and process Web forms to manage objects of the data classes.
Reports
- Generation of classes to execute queries to retrieve data from many objects to elaborate reports or to execute another kind of bulk processing
UML Diagrams
- Automatic generation of Entity-Relationship graphs in UML of the component class diagram

ImTranslator is a Firefox extension that provides additional multilingual capabilities to Firefox for more efficient communication in foreign languages.
With ImTranslator you can enter multilingual text, check it for correctness, adjust unreadable messages, translate in different languages, look up words, print results and send email.
ImTranslator provides the most convenient access to online translation service powered by PROMT translation server (PROMT Ltd.) and Altavista. It includes the following modules: translation editor, virtual keyboard, spell-checker, dictionary, decoder, back translation, email client.
The interface of ImTranslator is localized for 6 languages to target a native speaking audience.
ImTranslator is an ongoing project which gradually implements new tools and features to make the multilingual communication more efficient.
Integration includes context and tool menu launch as well as a toolbar image button.