Free looking good magazine software for linux

Looking Glass is a project that allows creating an innovative 3D desktop environment for Linux. It is sponsored by Sun Microsystems.

Looking Glass is programmed in the Java language using the Java 3D system to remain platform independent. Despite the use of graphics acceleration features, the desktop explores the use of 3D windowing capabilities for both existing application programs and ones specifically designed for Looking Glass.

The project is still in early development. The prototype is now working on Suns Java Desktop System.[citation needed]

One of its most notable features is the creation of reversible windows. This capability can be used for features like allowing the user to write notes and comments on the windows backs, or displaying application dialogs without risking them being detached from the application they relate to.

All windows start by looking like a normal 2D or 2.5D window, but can be manipulated as thin slate-like 3D objects which can be set at any angle or turned completely around by the user.

Other features include provision of a panning virtual desktop, icons that reflect the live status of the window they represent and zooming of a window when it receives focus.

GStreamer is a library that allows the construction of graphs of media-handling components, ranging from simple Vorbis and Ogg playback to complex audio (mixing) and video (non-linear editing) processing.
Applications can take advantage of advances in codec and filter technology transparently. Developers can add new codecs and filters by writing a simple plugin with a clean, generic interface.
Main features:
- Parallel installability with 0.8.x series
- Threadsafe design and API
- new id3 demuxer (replaces the mad one in gst-plugins-ugly)
- memleak fixes in avidemux, wavparse, level, smoke
- ports of multipart,
- fixes in flacdec, flxdec, rtp
- documentation updates on videomixer
- added new sunaudiosink, gconfaudiosrc and gconfvideosrc elements

Clearlooks-BlackMod are three themes designed to perfectly fits Clearlooks themes with Black borders.

See for example the Light and Medium versions how look good with Aerials! Absolutely wonderful.

Open Ski Jumping project is a ski jumping game. Its a simulation game for the console and/or X11.

It contains fairly good graphics, and features like replays and hill records.

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

Rippy the Aggregator project is a lightweight RSS aggregator written in vanilla PHP.
There are several Web sites (Slashdot, for instance) that I visit regularly or semi-regularly to check for the latest news; there are also several more (like, say, the EFF) that post regular updates and that Id like to visit regularly, or that would like to have me visit regularly, but which I dont visit regularly because its just too much work to keep track of all of them, and too disappointing when I remember to check and find nothing new. I even run a Web site of my own which Id like to have people check regularly - but since I dont spend time making the rounds of my friends similar sites, I cant expect them to visit mine. Rippy the Aggregator aims to solve all these problems.
There is a standard called RSS, for Web sites to publish their updates in a machine-readable format. An appropriate client can quickly visit all the Web sites youre interested in, download their updates, and present you with a customized list of all the newest items. Most "blogging", "portal", and "content management" software already generates RSS files (although its operators may be unaware of that!), and there are services like Syndic8 that compile lists of RSS "feeds". So it only remains to get an appropriate client.
That presents a problem. I hacked an RSS output onto my Web-site updating scripts, so I had that aspect covered, but then I wanted to start reading others RSS feeds, and I discovered that the client programs you can get on the Web mostly suck. Some of them are Windows-only, so those are right out. I saw one in Java that looked pretty good, but its Web site didnt provide a way to download it except through some kind of weird Hot-Buzzy-Java-Scripted-Auto-Virus-Install-Plugin-Thing - there was no actual file. I did eventually find its source code, but it required third-party libraries.
Then I looked at several RSS readers that were written in Perl or PHP and designed to run as scripts on a Web site. Those had possibilities, but they required multiple third-party libraries (Perl) or an SQL server and compiled-in PHP modules that most people dont have (PHP).
The best attempt I found was one written in Python, but in order to make it run I had to start not one but two background server daemons, which would make it tricky to use on my office computer at school. There are Web sites that provide the service of RSS reading, but they all require registration, cookies, JavaScript, etc. I couldnt find an RSS reader (or "aggregator", as theyre called) that I could just download and have it work. Thus, it was necessary to create one: enter Rippy!
The name "Rippy the Aggregator" refers to an Arrogant Worms song about a cute, cuddly little alligator who goes "chomp, chomp, chomp," down in the bottom of the swamp, swamp, swamp. Abram Hindle has suggested that Rippy the Aggregator should go "grep, grep, grep," down in the bottom of the net, net, net. Anyone wanna write the rest of the song?
Main features:
- Cute name
- Written in PHP (needs 4.3.0 or above)
- Doesnt require any compiled-in optional libraries that dont ship with PHP
- Stores its cached data in flat files, no database needed
- Freely licensed and customizable under the GNU GPL version 2
Enhancements:
- Parser ruggedness and general stability were improved, and support was added for setting options like user agent and proxying when acting as an HTTP client.