Free mp3producer de 2.58 software for linux

Tiny ERP is a free enterprise management software. Tiny ERP project covers all domains for small to medium businesses; accounting, stock management, customer relationship, sales, purchases, project management, ...
Main features:
- CRM & SRM
- Management and financial accounting
- Double-entry stock management
- Monitoring sales
- Automating tasks
- Human Ressources
- Managing and monitoring purchases

linkloop software is similar to ping, but tests connectivity at the link layer (layer 2) instead of the network layer (layer 3).
This works like the HP-UX linkloop utility. It was tested between Linux and HP-UX. There is also a "server-side" utility.
Enhancements:
- inkloop_reply replies only on the interface having received the packet, instead of all.

Algorithm::Huffman is a Perl extension that implements the Huffman algorithm.

SYNOPSIS

use Algorithm::Huffman;

my %char_counting = map {$_ => int rand(100)} (a .. z, A .. Z);
# or better the real counting for your characters
# as the huffman algorithm doesnt work good with random data :-))

my $huff = Algorithm::Huffman->new(%char_counting);
my $encode_hash = $huff->encode_hash;
my $decode_hash = $huff->decode_hash;

my $encode_of_hello = $huff->encode_bitstring("Hello");

print "Look at the encoding bitstring of Hello: $encode_of_hellon";
print "The decoding of $encode_of_hello is ", $huff->decode_bitstring($encode_of_hello), "";

This modules implements the huffman algorithm. The aim is to create a good coding scheme for a given list of different characters (or even strings) and their occurence numbers.

ALGORITHM

Please have a look to a good data compression book for a detailed view. However, the algorithm is like every good algorithm very easy.

Assume we have a heap (keys are the characters/strings; values are their occurencies). In each step of the algorithm, the two rarest characters are looked at. Both get a suffix (one "0", the other "1"). They are joined together and will occur from that time as one "element" in the heap with their summed occurencies. The joining creates a tree growing on while the heap is reducing.
Lets take an example. Given are the characters and occurencies.

a (15) b(7) c(6) d(6) e(5)

In the first step e and d are the rarest characters, so we create this new heap and tree structure:

a(15) de(11) b(7) c(6)

de
/
"0"/ "1"
d e

Next Step:

a(15) bc(13) de(11)

de bc
/ /
"0"/ "1" "0"/ "1"
d e b c

Next Step:

a(15) bcde(24)

bcde
/
"0"/ "1"
/
de bc
/ /
"0"/ "1" "0"/ "1"
d e b c

Next Step unifies the rest:

Huffman-Table
/
"0"/ "1"
/
/
bcde a
/
"0"/ "1"
/
de bc
/ /
"0"/ "1" "0"/ "1"
d e b c

Finally this encoding table would be created:

a 1
b 010
c 011
d 000
e 001

Please note, that there is no rule defining what element in the tree is ordered to left or to right. So its also possible to get e.g. the coding scheme:

a 0
b 100
c 101
d 110
e 111

pam_shield is a PAM module that uses iptables to lock out script kiddies that probe your computer for open logins and/or easy guessable passwords. The project is meant as an aid to protect public computers on the open internet.

Everybody knows it is unwise to leave computers largely unprotected connected to the internet. However, there are cases in which this is still common practice. For exampe, academic sites with hundreds of users often have a policy of allowing logins from over the world. They are under constant attack by "kiddies" trying to break in to the system by password guessing. pam_shield aims to detect and block these "kiddies".

pam_shield was developed by Walter de Jong in 2006 and 2007.

The author cannot be held responsible for any consequences or harm caused by this software.

PRECC eXtended is an infinite-lookahead compiler-compiler for languages with context-dependent grammars. The generated code is ANSI C and ANSI C++; the code will compile and run native under either C or C++.
Specification scripts are extended BNF with inherited and synthetic attributes. Scripts can be compiled in separate modules and linked later. Metalevel production rules are allowed in the scripts. The technology is essentially LL(oo) with optimizations.
Enhancements:
- A "debian" subdirectory has been added in order to allow the building of deb packages from the source archive.

Domingo is a simple, consistent, object-oriented easy-to-use interface to the Lotus Notes/Domino Java-API.
Installation:
To install Domingo on your Notes Client or Domino server, please download a binary distribution, extract the file domingo-1.0.jar and choose one of the following instructions.
Notes/Domino R5
Copy the file domingo-1.0.jar to the folder of your local Notes installation.
Add the path to this file to the JavaUserClasses variable in your notes.ini file, e.g.
JavaUserClasses=C:LotusNotes6domino-1.0.jar
Notes/Domino R6/R7
Copy the file domingo-1.0.jar to the folder jvm/lib/ext in your Lotus Notes installation, e.g. C:LotusNotes6jvmlibext.
You do not have to change JavaUserClasses.
Configuration
Domingo can be configured by a properties file named domingo.properties that must be placed in the package de.bea.domingo. The following properties are supported. Usually you donot have to change these values, because the default values are appropriate for most cases.
de.bea.domingo.monitor.level Setup debug level of Domingo. Allowed values are FATAL, ERROR, WARN, INFO or DEBUG WARN
de.bea.domingo.threadpool.size Setup number of threads in thread pool. 1
de.bea.domingo.cache.threshold Threshold of weak cache before recycling unused notes objects. Extremly small values might worsen performance, extremly high values might result in out of memory errors. Allowed values are any integer bigger than zero
Enhancements:
- All known bugs were fixed and all feature requests were implemented.
- Many further new features were added.