Free coin collection software for linux

C Comic Collection project is a GTK application for downloading, cataloging, and viewing Web comics. It uses a MySQL database.
To compile this software, just type "make".
It requires development libraries for gtk, gtk_imlib, cURL, mysql and pthreads. If youre on Linux these should come with your distrobution; I dunno for other OS. If you only have the runtimes and are using a 386 derivative (Pentium et al) you can get a binary from http://c-comiccollect.sourceforge.net.
Compilation will produce a binary called "gtk-cc"; copy this to your /usr/bin (youll need root privileges, copy to your ~/bin (you wont) or just run it from where it is (./gtk-cc &).
You can populate the database by running the included "comiccollection.sql" against an empty database. (mysql -u < username > < dbname > < comiccollection.sql). It even includes some comics to get you started!
Enhancements:
- Minor improvements - only really relevant if you view KeenSpace comics.
- Fixed file non-deletion problem
- Fixed KeenSpace file download problem

Audio collection script is a script which can help you manage collections of audio files. For example, I have a directory with all my audio files in it, sorted by band/album. I also have an audio collections directory. Within that directory I have a few list files which contain patterns for songs that should be part of that collection. The script generates or updates a subdirectory for each list file present and creates links within those directories to all music files from my main audio directory that match the patterns in the list file.

An example:

Your music files are in /audio
Your collections are in /audio-collections
The file /audio-collections/funny.list has the following lines:

/audio-collections/funny/
#the next line matches all songs within a tripod directory
tripod/
monty*python
kevin*bloody*wilson
bill*clinton*miss*lewinsky*and*i

When run, it will process each .list file in the current directory. So for this example, when run from /audio-collections, it will create or clean out the directory /audio-collections/funny and create links inside it for any files found within /audio which match the specified patterns.

The first line in each list file specifies the directory to create and use for the links. The patterns in the file will match on the full path of a song.

Note: I am pretty sure it would not be a good path to put your collections inside your main audio directory.

The RA SPP Plugin collection package provides several plugins meant to be used with a qmail patched using qmail-spp.
They cover diverse areas, and are meant to be written according to the following principles:
- Good performance
They are written whenever possible in C, and try to be short and direct.
- Good logging
They should inform the user of what they do. No email should ever be rejected without logging something. Also, all plugins logs include the PID of the qmail-smtpd process, so you can easily group all events of a connection.
- Security
Since writing in C exposes oneself to the dangers of memory corruption, I have tried to use, whenever it makes sense, the Better String Library, to avoid problems. While this makes the plugins larger, it also makes me feel more comfortable.
Also, for most plugins, it should be possible to run them as a very unprivileged user or in a chroot jail. This is not yet implemented, but it is worth thinking about.
Enhancements:
- Fixes a stupid bug in the ipthrottle plugin (it was sending a debug message to the client).

CoinXtension offers some additional operators for existing data types of Coin 3D; but more important it extends the linear algebra capabilities of the original framework, by adding the new data type C3Xt_matrix3d, that offers such usefull routines as for eigenvalue or QR-decomposition.
CoinXtension library only depends on Coin 3d and libstdc++, thus it should work on all plattforms on which Coin 3D is available, altough it was developed and tested only on Linux/x86.
This is the first release and the software is still alpha, so dont expect it to be exactly the same in some days or weeks, nor that it works the way you imagined!
Furthermore the development of the library is not really a directed process, but i integrate new features as i come accross things in projects that might usefull in future ones too.
Enhancements:
- Support for Euler angles and many bugfixes.

JavaDoc Taglets Collection is set of general purpose taglets for use with the JavaDoc tool. It provides a standard set of new tags, and allows you to create new ones by configuration or using simple Java interfaces. The project has been tested with J2SE 1.4 and 1.5 and JavaSE 1.6.
Enhancements:
- First public release of the Taglets Collection.
- Completed documentation for release 2.
- Added demos to userguide and distribution.
- Added to do list and known bugs information.

Coin Strip project consists of scripts which play Coin Strip or Welters game against the user.

Coin Strip is a series of scripts in which the computer plays either Coin Strip or Welters game against the user (See "On Numbers and Games" by John Conway).

The scripts use a recursive algorithm in which the game tree is searched on the fly for sure winners, positions from which the computer cannot lose.

Since the search is CPU intensive, lookup tables have been generated for up to 6 coins on a strip 30 spaces long.

The scripts to generate and play using the lookup tables are provided for the Coin Strip game only.

Coinflip provides a cryptographically secure server/client program and protocol for choosing random bits.

Coinflip is a client/server based program that can generate random bits for 2 people over the internet. The 2 people dont have to trust each other in order to convince each other that the bit is truly a random bit.

Its called coinflip, of course, because flipping a coin in the real world is the equivalent of generating a random bit on a computer. (Its either heads or tails. Its either a 1 or a 0.)

Coinflip uses a slightly modified version of the "Coin Flipping Using One-Way
Functions" protocol outlined in Bruce Schneiers Applied Cryptography 2nd
edition.

This attack would work everytime Alice acted as the server in a coinflip procedure, providing Bob never realized that Alice was sending him the same y value every time. Or she could us it to trick multiple Bobs.

While it is supposed to be computationally infeasible to compute collisions in one-way hash functions, recent papers suggest that if you have enough money and time, collisions can be precalculated. P. van Oorschot and M. Wiener in their paper, "Parallel collision search with application to hash functions and discreet logarithms", estimate that for $10 million (in 1994 US dollars), a collision could be found for MD5 in 24 days on average. (Thanks for the info, defrost).

The solution is actually quite simple: Have both parties choose part of the random data, and use whatever size random number you like. Since Bob is expecting to see x contain his random data, Alices collision attack is nullified, and since Alice gets to put in her own data, she can make Bobs array attack infeasible.