Lurker is not just another mailing list archiver. It is capable of handling
gigabytes of mail without slowing down. Lurker has been designed to scale to
support sites with thousands of concurrent users and hundreds of new messages a
second. If you run a high-volume mailing list archive, you should seriously
consider lurker for this alone.
To facilitate finding interesting data, lurker supports:
* full keyword search by body, subject, author, ...
* a graphical representation of message relationships
* charts of the current activity about a topic
* searching lists or queries around an estimated time
* signature verification to confirm the author
* messages markup to find related information
As one would expect, lurker also supports file attachments, multiple languages,
message threading, gpg key photo ids, a transactional database, automatic
timezone detection, render caching, xml customization with xslt and css,
multiple front-ends (3-tier deployment), and many other buzz words.
The xmailbox program displays, by default, an image of a mailbox. When
there is no mail, the image shown is that of a mailbox with its flag down.
When new mail arrives, the image changes to that of a mailbox with the
flag up, its door open and a letter visible inside. It can also optionally
play a sound through the sound-card. The NCD audio server, the rplay sound
package, FreeBSD Sun-compatible audio drivers, and an external sound player
program are supported. By default, pressing any mouse button in the image
forces xmailbox to remember the current size of the mail file as being the
``empty'' size and to change its image accordingly. In addition, the user
can optionally invoke his/her favorite mail retrieving program.
KBruch is a small program to practice calculating with fractions and
percentages. Different exercises are provided for this purpose and you
can use the learning mode to practice with fractions. The program
checks the user's input and gives feedback.
FEATURES
- Arithmetic excercise: in this exercise you have to solve a given
fraction task. You have to enter the numerator and the denominator.
This is the main exercise.
- Comparison excercise: in this exercise you have to compare the size
of two given fractions, using the symbols >, < or =.
- Conversion excercise: in this exercise you have to convert a given
number into a fraction.
- Factorization excercise: in this exercise you have to factorize a
given number into its prime factors.
- Percentage excercise: in this exercise you have to calculate
percentages.
This module is an extension to the Math::Symbolic module. A basic
familiarity with that module is required.
Math::Symbolic offers some builtin simplification routines. These,
however, are not capable of complex simplifications. This extension offers
facilities to override the default simplification routines through means
of subclassing this module. A subclass of this module is required to
define a simplify object method that implements a simplification of
Math::Symbolic trees.
There are two class methods to inherit: register and unregister. Calling
the register method on your subclass registers your class as providing the
simplify method that is invoked whenever simplify() is called on a
Math::Symbolic::Operator object.
Calling unregister on your subclass restores whichever simplification
routines where in place before.
REDUCE is an interactive system for general algebraic computations of
interest to mathematicians, scientists and engineers. It has been
produced by a collaborative effort involving many contributors. Its
capabilities include:
* expansion and ordering of polynomials and rational functions;
* substitutions and pattern matching in a wide variety of forms;
* automatic and user controlled simplification of expressions;
* calculations with symbolic matrices;
* arbitrary precision integer and real arithmetic;
* facilities for defining new functions and extending program syntax;
* analytic differentiation and integration;
* factorization of polynomials;
* facilities for the solution of a variety of algebraic equations;
* facilities for the output of expressions in a variety of formats;
* facilities for generating optimized numerical programs from symbolic input;
* calculations with a wide variety of special functions;
* Dirac matrix calculations of interest to high energy physicists.
It is often used as an algebraic calculator for problems that are possible
to do by hand. However, REDUCE is designed to support calculations that
are not feasible by hand.
Sort files or its standard input using the bogo-sort algorithm
described in the Jargon File <http://www.catb.org/~esr/jargon/>.
A quote from the Jargon File 'bogo-sort' entry:
...The archetypical perversely awful algorithm (as opposed to
_bubble sort_, which is merely the generic bad algorithm).
_Bogo-sort_ is equivalent to repeatedly throwing a deck of cards
in the air, picking them up at random, and then testing whether
they are in order. It serves as a sort of canonical example of
awfulness. Looking at a program and seeing a dumb algorithm, one
might say "Oh, I see, this program uses _bogo-sort_." Esp.
appropriate for algorithms with factorial or super-exponential
running time in the average case and probabilistically infinite
worst-case running time. Compare _bogus_, _brute force_,
_lasherism_...
[ excerpt (with adaptations) from developer's README ]
ffmpeg is a hyper fast realtime audio/video encoder, a streaming
server and a generic audio and video file converter.
It can convert a standard video source into several file formats
based on DCT/motion compensation encoding. Sound is compressed in
MPEG audio layer 2 or using an AC3 compatible stream.
What makes ffmpeg interesting ?
- Simple and efficient video encoder: outputs MPEG1, H263, Real
Video(tm), MPEG4, DIVX and MJPEG compatible bitstreams using the
same encoder core.
- Hyper fast MPEG audio layer 2 compression (50 times faster than
realtime on a K6 500).
[snip -> rest on website below]
ffmpeg is made of two programs:
* ffmpeg: soft VCR which encodes in real time to several formats.
It can also encode from any supported input file format to any
input supported format.
* ffserver: high performance live broadcast streaming server based
on the ffmpeg core encoders.
check_multi is kind of a wrapper plugin which takes benefit of the
Nagios 3.x capability to display multiple lines of plugin output.
It calls multiple child plugins and displays their output in the
long_plugin_output. A summary is given in the standard plugin output.
The child return code with the highest severity becomes the parent
(check_multi) plugin return code.
The configuration is very simple: a NRPE-stylish config file contains
a tag for each child plugin and then the check command line.
check_multi can cover complex Business Process Views - using a builtin
state evaluation mechanism. The second benefit is cluster monitoring
with no need for extra services. All you need is provided by check_multi.
LICENSE: GPL2 or later
This is an SNMP message encoding and decoding library, providing very
low-level facilities; you pretty much need to read the SNMP RFCs to use
it. It is, however, very fast (it's more than an order of magnitude
faster than Net::SNMP, and it can send a request and parse a response in
only slightly more time than the snmpd from net-snmp takes to parse the
request and send a response), and it's relatively complete --- the
interface is flexible enough that you can use it to write SNMP
management applications, SNMP agents, and test suites for SNMP
implementations.
The package also includes NSNMP::Simple, which lets you get or set a
single OID via SNMP with a single line of code. It's easier to use, and
roughly an order of magnitude faster, than Net::SNMP.
iLBC (internet Low Bitrate Codec)
iLBC is a FREE speech codec suitable for robust voice communication
over IP. The codec is designed for narrow band speech and results
in a payload bit rate of 13.33 kbit/s with an encoding frame length
of 30 ms and 15.20 kbps with an encoding length of 20 ms. The iLBC codec
enables graceful speech quality degradation in the case of lost frames,
which occurs in connection with lost or delayed IP packets.
Features:
* Bitrate 13.33 kbps (399 bits, packetized in 50 bytes) for the frame
size of 30 ms and 15.2 kbps (303 bits, packetized in 38 bytes) for
the frame size of 20 ms
* Basic quality higher then G.729A, high robustness to packet loss
* Computational complexity in a range of G.729A
* Royalty Free Codec