Free between three software for linux

Absolut Engine is a news publishing system. It features three-layer access (admin/chief/editor), article posting, editing, and deleting. Absolut Engine includes a powerful image managing tool, a file manager, and a related articles manager.

Rich text editing is provided via a built-in WYSIWYG editor that produces XHTML 1.0 Strict-compliant code. Absolut Engine is easy to extend via module functionality. The provided modules include Discussions, Surveys, RSS Feed, Search Engine Optimization (static/clean URLs), and a message system for better communication between users.

Absolut Engine produces Web-standards-compliant valid and accessible XHTML 1.0 Strict and CSS semantically-correct code.

edanator is an intuitive graphical binary and hex calculator. Each nibble is displayed in hex and binary. Clicking on the button (hex nibble or binary bit) changes the value. Bit and nibble shifting is supported via dedicated buttons. The project supports variable widths per word (up to 64- bits), three words (each on a different row), and mathematical operations between words.
Enhancements:
- An endian-ness button for swapping bit labels was added along with a bit reverse function.

Apache::WebSNMP is a Perl module that allows for SNMP calls to be embedded in HTML.

SYNOPSIS

< html >
< body >
< snmp >
host=zoom.google.org
community=public
connect
interface=ifDescr.2
mac=ifPhysAddress.2
query
< /snmp >

The interface < b >descriptor< /b > for the ethernet card is < snmp > print(interface) < /snmp >
and its mac address is < snmp > print(mac) < /snmp >
< /body >
< /html >

The WebSNMP module allows one to embed SNMP commands directly into HTML code.

REQUIRES

This module requires the perl SNMP module, available at the CPAN site.

USAGE

The module allows for three different kinds of statements, surrounded by < snmp > and < /snmp > html tags. The three types of statements consist of configurations, variable assignments, and commands. A brief description of each type of statement follows:

Configuration:

The configuration statements allow the user the set which host to poll for SNMP information, as well as the SNMP community that the get statements will draw from. This essentially takes the form of assigning values to the reserved variables host and community. All variables are assigned with the following syntax: varible_name=value
Note: there must not be any intervening whitespace between the = and the name and value. Thus to set the SNMP host to machine.domain.net, we would issue the configuration statement:

< snmp >host=machine.domain.net< /snmp >

If not specified, the default host is localhost, and the default community is public.

Open Metaheuristic (oMetah) is a library aimed at the conception of metaheuristics (i.e. genetic/evolutionnary algorithms, tabu search, simulated annealing, ant colony algorithms, etc.). Open Metaheuristic library follows the "adaptive learning search" approach in the design of metaheuristics (an approach inspired from the "adaptive memory programming").
The oMetah core code design is separated in three components : algorithms, problem and communication. You can easily add your own metaheuristic and test it on the implemented problems, or add your own problem, and use the implemented metaheuristics to solve it.
You also have the choice of the way the algorithm and the problem are linked (static link, network, webservice, etc.).
It is mainly designed to handle continuous or mixed-integer problems, often met in engineering applications.
oMetah is written in C++, using the Standard Template Library.
Enhancements:
- The Python and network communication protocols between metaheuristics and problems are now usable.

OPML Reader provides a Feed Reader for any OPML Autodiscovery enabled page.

Open a Feed Reader for any OPML Autodiscovery enabled page. You can choose between Optimal OPML browser and Grazr.

Set::Integer::Gapfillers is a Perl module that can fill in the gaps between integer ranges.

SYNOPSIS

use Set::Integer::Gapfillers;
$gf = Set::Integer::Gapfillers->new(
lower => -12,
upper => 62,
sets => [
[ 1, 17 ], # Note: Use comma, not
[ 25, 42 ], # range operator (..)
[ 44, 50 ],
],
);

$segments_needed_ref = $gf->segments_needed();

$gapfillers_ref = $gf->gapfillers();

$all_segments_ref = $gf->all_segments();
Any of the three preceding output methods can also be called with an expand option:
$segments_needed_ref = $gf->segments_needed( expand => 1 );

This Perl extension provides methods which may be useful in manipulating sets whose elements are consecutive integers. Suppose that you are provided with the following non-intersecting, non-overlapping sets of consecutive integers:

{ 1 .. 17 }
{ 25 .. 42 }
{ 44 .. 50 }

Suppose further that you are provided with the following lower and upper bounds to a range of consecutive integers:

lower: 12
upper: 62

Provide a set of sets which:

when joined together, would form a set of consecutive integers from the lower to the upper bound, inclusive; and
are derived from:

the sets provided;
proper subsets thereof; or
newly generated sets which fill in the gaps below, in between or above the provided sets.

Once a Set::Integer::Gapfillers object has been constructed, its segments_needed() method can be used to provide these results:

{ 12 .. 17 } # subset of 1st set provided
{ 18 .. 24 } # gap-filler set
{ 25 .. 42 } # 2nd set provided
{ 43 .. 43 } # gap-filler set
# (which happens to consist of a single element)
{ 44 .. 50 } # 3rd set provided
{ 51 .. 62 } # gap-filler set for range above highest provided set

Alternatively, you may only wish to examine the gap-filler sets. The gapfillers() method provides this set of sets.

{ 18 .. 24 } # gap-filler set
{ 43 .. 43 } # gap-filler set
{ 51 .. 62 } # gap-filler set

And, as an additional alternative, you may wish to have your set of sets begin or end with all the values of a given provided set, rather than a proper subset thereof containing only those values needed to populate the desired range. In that case, use the all_segments() method.

{ 1 .. 17 } # 1st set provided
{ 18 .. 24 } # gap-filler set
{ 25 .. 42 } # 2nd set provided
{ 43 .. 43 } # gap-filler set
# (which happens to consist of a single element)
{ 44 .. 50 } # 3rd set provided
{ 51 .. 62 } # gap-filler set for range above highest provided set

The results returned by the all_segments() method differ from those returned by the segments_needed() method only at the lower or upper ends. If, as in the above example, the lower bound of the target range of integers falls inside a provided segment, the first set returned by all_segments() will be the entire first set provided; the first set returned by segments_needed() will be a proper subset of the first set provided, starting with the requested lower bound.

Multimedia Converter project provides graphical environment to take full advantage some of the possibilities the ffmpeg and MPlayer.

So help to Convert between different media formats.