Free bare minerals software for linux

Arianne is a multiplayer online games framework and engine to develop turn based and real time games.

It provides a simple way of creating games on a portable and robust server architecture. The server is coded in Java and uses Python for your game description, provides a MySQL backend and uses an UDP transport channel to communicate with dozens of players.

Our reference client engines are coded using Java and the C language in order to achieve maximum portability.

Arianne has been in development since 1999 and has evolved from a tiny application written in pseudo-C++ to a powerful, expandable but simple server framework, running on the Java platform, and a portable client framework, written in bare C to allow total portability of ariannes clients. Ariannes server is totally client agnostic.

Since the beginning, the key concept at the heart of Ariannes development has been KISS: Keep it simple, stupid!

Arianne games are playable. It now hosts several games:

* a multiplayer Gladiators fighting game
* a multiplayer Pacman game

All our efforts are supported by ariannes server: Marauroa.

Marauroa is completely written in Java using a multithreaded server architecture with a UDP oriented network protocol, a MySQL based persistence engine and a flexible game system. The game system is totally expandable and modifiable by game developers and is able to run Python scripts defining the games rules.

Marauroa is based on a design philosophy we called Action/Perception. Each turn a perception is send to the clients explaining what they currently perceive. Clients can ask the server to perform any action in their name using actions. Marauroa is totally game agnostic and makes very little assumptions about what are you trying to do, allowing a great freedom to create any game type.

Bugs are facts of life, they just happen.

On Arianne we care about code quality so code is fully tested using Test Units with JUnit and cppunit, so all modules are tested for most common cases, allowing a better quality software to be deployed.

The name originated from the Greek name Ariadne. (Latin; Arianna and from French; Arianne). Ariadne is a famous character in Greek mythology. She was the daughter of King Minos of Crete and she was in love with Theseus, the Athenian hero who killed the Minotaur ( a half human, half bull creature).

Theseus married her, however, then later left her alone on the island of Naxos. Ariadne later married Dionisos the God of Wine. The name Ariadne originates from the ancient Greek words ari which means intelligent and adnis which means pure (as in a virgin). Hence, the daughters of the Romans and Greeks where often called by this name.

SINUS project is a application which assess the potential of security without obscurity.
The SINUS Firewall is a TCP/IP packet filter for the Linux operating system. It is distributed under the GNU General Public Licence and comes with complete source code, as the Linux operating system does.
The SINUS firewall is a free and easy way to protect your network from the malware of the Internet. It does not guarantee perfect security, however it comes with a wealth of features, including:
Filtering of all header fields in the IP, TCP, UDP, ICMP, IGMP packets.
Intelligent RIP and FTP support.
Easy to understand, text-based configuration.
Graphical management interface for configuration of several firewalls.
Dynamic rules, including counters and time-outs.
Extensive logging, alerting, and counter intelligence.
Prevention of packet and address spoofing - GNU GPL license.
To install the software, you need a Linux 2.0.x based system. We suggest you install a bare-bone system without X or any of the other nifty features which tend to have security holes. You should not install user accounts on the firewall system. Log-ins other than from the console should be forbidden (if you absolutely have to log in remotely, we strongly suggest you install a copy of ssh).
Although the software has been subject to thorough testing, and has been continuously running without crashes for over 12 months, we are confident someone will eventually unconver A BUG in the software. Therefore, it is version "0.1".
Please do not use this software as the sole means to protect your top secret data. This software is intended for:
People who want to study firewalls
People who dont trust their current firewall
People who currently dont have any protection at all (even if there are serious bugs, it cannot get worse, can it?)
Enhancements:
- NEW FEATURES
- user level authentification between firewall and management interface
- compiles and runs on libc6 (glibc2) systems.
- CHANGES
- management interface now written as Java application (JDK 1.1.6)
- detect land attack
- changed name from sf to sifi (SINUS firewall) due to change of maintainer (now Harald Weidner ).
- BUG FIXES
- TCP RST of established connections now pass through the firewall
- fixed a segfault bug in the passive FTP code

DM1 Thread Library is part of the DM1 project. This library was born out of my need to have a portable C++ Thread library that would be simple to use, and would provide all the necessary Threads functionality I required for the DM1 project.
Initially, this library was in C, but when I decided to re-write DM1 in C++, I ported the library to C++. During the port, I enhanced the functionality of the Threads library.
The DM1 Threads library aims to be small. It does not try to provide a comprehensive set of functionality, but only what is absolutely essential for a project like DM1. I had the simplicity of the Java Threads package in mind when creating this library.
The constructs provided by the DM1 Thread library are:
- Thread objects that represent Operating System threads.
- A Mutex is provided as a mechanism for Mutual Exclusion . Mutexes are used to ensure that a piece of code is executed by only one thread at any point in time.
- Events are provided as low-level mechanisms for thread synchronisation. Events can be waited for, and signalled to.
- A higher level object, that combines the functionality of an Event and a Mutex, is provided. This is the Monitor object. A Monitor can be locked exclusively, just like a Mutex, but it can also be made the object of a Wait operation. The signalling mechanism supports notification of one or more waiting threads.
- To enable more efficient locking when both shared and exclusive access to data is required, Latches are provided.
- Apart from the Thread synchronisation primitives described above, the library also provides a ThreadPool for the situation when it is inefficient to create a thread exclusively for a particular task, and it is desirable to share a pool of threads for executing multiple tasks.
Design Principles
The DM1 Threads library was designed with the following principles in mind:
1. Implement the bare minimum that is required. This Threads library does not aim to be a comprehensive threads package.
2. Avoid complex algorithms. If a particular construct is hard to implement correctly on all platforms, avoid it.
3. Document the library.
4. Avoid low level code, such as assembler code to implement Spin locks. Rely on the libraries provided by the Operating System.
5. Avoid holding Mutexes beyond function calls. A DM1 Thread library function will not hold any Mutex locks when it returns.
6. Avoid using clever C++ techniques wherever possible. (Unfortunately, some cleverness is required to implement the Thread class correctly).
7. Avoid dependency on external libraries. The DM1 library only requires the standard C library, apart from native Threads functionality.
8. Always report an error as soon as it is discovered.
9. Insert debug messages that can be switched on at run-time.
10. Do not throw exceptions from destructors because these might be executing as a result of an uncaught exception.
11. Never let an error go unreported.

Coyote Linux is a single floppy distribution of Linux designed for the sole purpose of sharing and protecting an Internet connection. The floppy can be created using either a Microsoft Windows wizard, or by using a set of Linux shell scripts.
In addition to being designed to have very low hardware requirements, the floppy release of Coyote Linux is able to provide the performance and uptime that is expected from any Linux based system.
This release is available free of charge and can be downloaded from the "Downloads" link in the left hand menu.
Main features:
- Linux 2.4.29 based system kernel
- Iptables based stateful firewalling
- Bare minimum of hardware requirements
- Support for Ethernet (static and DHCP), PPPoE, and PPP dialup internet connections.
- No hard drive or CD-ROM required for firewall operation
- Excellent uptime and operating system reliability
- SSH 2.0 and web based remote administration options
- QoS support
- No-cost alternative that can make use of old hardware that may have otherwise lost its usefulness.
- Easily shares an Internet connection with hundreds of LAN clients (adequate hardware and Internet connectivity required).

Deinonychus is a streamlined email client that is designed to be fast and simple, while still retaining basic functionality. IMPORTANT: Deinonychus uses basic authentication for both IMAP and POP stores, which means that your password will be sent in the clear. If you are security minded or do not know what this means, it is recommended that you do not use Deinonychus to receive email messages.
This project started with the belief that managing email can be replaced by a combination of sorting, flagging, and filtering.
My ideal message retrieval protocol would pretty much be halfway between POP and IMAP. This is why Deinonychus treats each email store simply as a collection of messages.
Main features:
- Access to IMAP4, POP3, and Hotmail message stores.
- Parsing and display of MIME compliant messages.
- A bare bones contact list.
- A basic filtering mechanism.
- Archiving of messages to disk.
- Composition of MIME compliant messages.

Ruben provides Maven 2.x plugins for Ruby builds. It currently provides the bare basics for building Ruby classes with Maven 2.x.
Ruben project runs Ruby Unit Tests and fails builds if the unit tests do not pass. It also does dependency resolution, but this does not include transitive dependencies (so you will need to include every dependency in the pom.xml file) nor does it include downloading from a remote repo.
Enhancements:
- This is a minor release that includes transitive dependency resolution and gem packaging support.

List::Compare is a Perl module to compare elements of two or more lists.

SYNOPSIS

The bare essentials:

@Llist = qw(abel abel baker camera delta edward fargo golfer);
@Rlist = qw(baker camera delta delta edward fargo golfer hilton);

$lc = List::Compare->new(@Llist, @Rlist);

@intersection = $lc->get_intersection;
@union = $lc->get_union;

General Comments

List::Compare is an object-oriented implementation of very common Perl code (see "History, References and Development" below) used to determine interesting relationships between two or more lists at a time. A List::Compare object is created and automatically computes the values needed to supply List::Compare methods with appropriate results. In the current implementation List::Compare methods will return new lists containing the items found in any designated list alone (unique), any list other than a designated list (complement), the intersection and union of all lists and so forth. List::Compare also has (a) methods to return Boolean values indicating whether one list is a subset of another and whether any two lists are equivalent to each other (b) methods to pretty-print very simple charts displaying the subset and equivalence relationships among lists.

Except for List::Compares get_bag() method, multiple instances of an element in a given list count only once with respect to computing the intersection, union, etc. of the two lists. In particular, List::Compare considers two lists as equivalent if each element of the first list can be found in the second list and vice versa. Equivalence in this usage takes no note of the frequency with which elements occur in either list or their order within the lists. List::Compare asks the question: Did I see this item in this list at all? Only when you use List::Compare::get_bag() to compute a bag holding the two lists do you ask the question: How many times did this item occur in this list?