Free round rock isd software for linux

Rocks provides an user-level package for reliable and mobile network connections.
Rocks protect sockets-based applications from network failures, particularly failures common to mobile computing, including:
.Link failures (e.g., unexpected modem disconnection);
.IP address changes (e.g., laptop movement, DHCP lease expiry);
.Extended periods of disconnection (e.g., laptop suspension).
Rock-enabled programs continue to run after any of these events; their broken connections recover automatically, without loss of in-flight data, when connectivity returns.
Rocks work transparently with most applications, including SSH clients, X-windows applications, and network service daemons.
Main features:
- Reliable: Rocks detect connection failures within seconds and reconnect automatically when connectivity is restored. Reconnection succeeds even when one end of the connection obtains a new IP address.
- Safe: Rocks recover lost in-flight data no matter when failures occur, safely interoperate with ordinary sockets, and authenticate resumed connections.
- User level: You can install and use rocks as an ordinary user. They do not require any kernel modifications.
- Transparent: You can use rocks with existing programs without re-programming, re-compiling, or re-linking.
- Easy to use: Rocks come with simple command-line tools for enabling rocks in ordinary programs.
Enhancements:
- Bug fixes.

Rock Dodgers project is a game in which you avoid flying space rocks.

Use your shields, fire your thrusters, cross your fingers, and kiss your ship goodbye.

QMetronome is a skinnable metronome for Qt licenced under the GPL.
The qualitiy of the prepackaged skins are questionable but it is easy to make your own. I made this metronome when I was learning the rythms of Flamenco on the guitar.
Therefore, it has up to twelve beats per "bar" and clicks with accents.
Main features:
- Three click sounds: one, accent and ordinary. Configurable.
- Four to twelve beats per round.
- Timing precision only limited by your soundcard and drivers.
Version restrictions:
- All three click sounds must be in the same format (bits, hz, mono/stereo),
- otherwise strange things will happen. Will be fixed in the next version.

Games::Tournament::RoundRobin is a Perl module for Round-Robin Tournament Schedule Pairings.

SYNOPSIS

$schedule = Games::Tournament::RoundRobin->new;

$pairings = $schedule->indexesInRound($roundm);
$round = $schedule->meeting($member1, [$member2, $member3]);
...

Every member of a league of 2n players can be paired with every other member in 2n-1 rounds.

If the league members are (Inf, 1 .. 2n-1), then in round i, i can be paired with Inf, and a can meet b, where a+b = 2i (mod 2n-1).

METHODS

new

Games::Tournament::RoundRobin->new( v => 5, league => [Ha, Be, He])
Games::Tournament::RoundRobin->new( league => {A => $a, B => $b, C => $c})
where v (optional) is the number of league members, and league (optional) is a list (or a hash) reference to the individual unique league members. One of v, or league (which takes precedence) is necessary, and if league is not given, the members are identified by the numbers 0 .. n-1.

If the league is a list (or hash) of n objects, they should be instances of a class that overloads both string quoting with a name method and arithmetical operations with an index method. The index method, called on the n objects in order, should return the n numbers, 0 .. n-1, and in that order if they are presented as an array. If they are presented as a hash, the hash is stored internally as an array and the keys are discarded.

If the league is a list of strings or numbers, indexes are constructed for the values on the basis of their positions in the list, and if a hash of strings or numbers, on the basis of the lexicographic order of their keys. Each string is expected to be unique.
If n is odd, an additional n-1, Bye or object (a Games::League::Member object, by default) member, depending on the type of the first member in the league, is added at the end and n is increased by 1.
indexesInRound

$schedule->indexesInRound($m)

Returns an array reference of the pairings in round $m. This method is useful if you are using numbers to represent your league members. It is not so useful if you are using strings or objects and you dont know their index numbers. Positions in the array represent members. The values represent their partners. Each member is thus represented twice.

roundsInTournament

$t = $schedule-> roundsInTournament;
$round1 = $t[0];
$inRound1FourthWith = $t->[0]->[3];
$inLastRoundLastWith = $$t[-1][-1];

Returns, as a reference to an array of arrays, the pairings in all rounds of the tournament. This method is useful if you are using the algorithm indexes.
partner

$schedule->partner($member, $m)

Returns the partner of $member in round $m.

membersInRound

$schedule->membersInRound($m)

Returns an hash reference of the pairings in round $m. This method is useful if you are using strings or objects. Keys in the hash represent league members. If the league members are objects, their names are used as keys. If 2 names are the same, the names are changed to $name.1, $name.2 etc. The values are their partners. Each player is thus represented twice.

memberSchedule

$schedule->memberSchedule($member)

Returns, as an array reference, the partners who $member is matched with in the order in which they meet, ie round by round.

meeting

$schedule->meeting($member,$partner)

Returns the rounds (TODO and the venue) at which $member meets $partner.

meetings

$schedule->meetings($member1,[$member2,$member3,...])

Returns, as an array reference, the rounds (TODO and the venue) at which $member1 meets $member2, $member3, ...

index

$schedule->index($member)

Returns $members index, the number which is used to pair it with other members. The index is the position, 0..n-1, of the $member in the league argument to the constructor (if an array) or the constructed array (if a hash.)
If $member is not a member of the array, or is itself an index, undef is returned.

member

$schedule->member($index)
$schedule->member($name)
$bye = $schedule->member( $schedule->size-1 )

Returns the member represented by $index, a number which ranges from 0..n-1, or by $name, a string. If there is no such member, undef is returned.

partners

$schedule->partners($index)
$schedule->partners($name)

Returns an array reference of all the partners of the $indexed or $named member, in index order, or the order in the league argument.

realPartners

$schedule->realPartners($index)

Returns an array reference of all the partners of the $indexed member, excluding the Bye member. Dont use this if you have no Bye member, as it just leaves off the last member.

size

$schedule->size

Returns the number of members in the round robin. Sometimes this may not be the same as the number of league members specified, because the array of league members takes precedence if supplied, and a bye is added if the number is odd.

rounds

$schedule->rounds

Returns the number of rounds in the round robin. This equals the number of league members, minus 1.

ROCKate is a LiveCD, a complete operating system that operates without installing it on a harddisk. It focuses on giving people a chance to protect their privacy on the Internet. The LiveCD achieves this goal by using the Tor network for anonymity and delivers all applications pre-configured to use it.
Main features:
- Privoxy/Tor for access to the Tor network
- Xorg for a Graphical User Interface
- IceWM as Window Manager
- dillo as webbrowser
- irssi as IRC Client
ROCKate not only focuses on making it possible to be anonymous on the Internet, it also aims to make it convenient.
Every file on the filesystem is writable! This distincts ROCKate from most other LiveCD systems. This goal is achieved by using Clifford Wolfs shadowfs. The limit to this is the amount of RAM you have in your system.
Enhancements:
- The distribution is now installable to harddisk!

Rocks Cluster is a complete "cluster on a CD" solution for x86 and IA64 Red Hat Linux COTS clusters.
Building a Rocks cluster does not require any experience in clustering, yet a cluster architect will find a flexible and programmatic way to redesign the entire software stack just below the surface (appropriately hidden from the majority of users).
Although Rocks includes the tools expected from any clustering software stack (PBS, Maui, GM support, Ganglia, etc), it is unique in its simplicity of installation.
From a hardware component and raw processing power perspective, commodity clusters are phenomenal price/performance compute engines. However, if a scalable ``cluster management strategy is not adopted, the favorable economics of clusters are offset by the additional on-going personnel costs involved to ``care and feed for the machine. The complexity of cluster management (e.g., determining if all nodes have a consistent set of software) often overwhelms part-time cluster administrators, who are usually domain application scientists. When this occurs, machine state is forced to either of two extremes: the cluster is not stable due to configuration problems, or software becomes stale, security holes abound, and known software bugs remain unpatched.
While earlier clustering toolkits expend a great deal of effort (i.e., software) to compare configurations of nodes, Rocks makes complete Operating System (OS) installation on a node the basic management tool. With attention to complete automation of this process, it becomes faster to reinstall all nodes to a known configuration than it is to determine if nodes were out of synchronization in the first place. Unlike a users desktop, the OS on a cluster node is considered to be soft state that can be changed and/or updated rapidly.
This is clearly more heavywieght than the philosophy of configuration management tools [Cfengine] that perform exhaustive examination and parity checking of an installed OS. At first glance, it seems wrong to reinstall the OS when a configuration parameter needs to be changed. Indeed, for a single node this might seem too severe. However, this approach scales exceptionally well, making it a preferred mode for even a modest-sized cluster. Because the OS can be installed from scratch in a short period of time, different (and perhaps incompatible) application-specific configurations can easily be installed on nodes. In addition, this structure insures any upgrade will not interfere with actively running jobs.
One of the key ingredients of Rocks is a robust mechanism to produce customized distributions (with security patches pre-applied) that define the complete set of software for a particular node. A cluster may require several node types including compute nodes, frontend nodes file servers, and monitoring nodes. Each of these roles requires a specialized software set. Within a distribution, different node types are defined with a machine specific Red Hat Kickstart file, made from a Rocks Kickstart Graph.
A Kickstart file is a text-based description of all the software packages and software configuration to be deployed on a node. The Rocks Kickstart Graph is an XML-based tree structure used to define RedHat Kickstart files. By using a graph, Rocks can efficiently define node types without duplicating shared components. Similiar to mammalian species sharing 80% of their genes, Rocks node types share much of their software set. The Rocks Kickstart Graph easily defines the differences between node types without duplicating the description of their similarities. See the Bibliography section for papers that describe the design of this structure in more depth.
By leveraging this installation technology, we can abstract out many of the hardware differences and allow the Kickstart process to autodetect the correct hardware modules to load (e.g., disk subsystem type: SCSI, IDE, integrated RAID adapter; Ethernet interfaces; and high-speed network interfaces). Further, we benefit from the robust and rich support that commercial Linux distributions must have to be viable in todays rapidly advancing marketplace.
Wherever possible, Rocks uses automatic methods to determine configuration differences. Yet, because clusters are unified machines, there are a few services that require ``global knowledge of the machine -- e.g., a listing of all compute nodes for the hosts database and queuing system. Rocks uses an SQL database to store the definitions of these global configurations and then generates database reports to create service-specific configuration files (e.g., DHCP configuration file, /etc/hosts, and PBS nodes file).
Enhancements:
- Rocks v4.3 is released for i386 and x86_64 CPU architectures. New features: Rocks command line - initial release of the Rocks command line which facilitates non-SQL administrative access to the database; PXE First - hosts can now be configured in BIOS with a boot order of CD, PXE, hard disk. Enhancements: based on CentOS 4.5 and all updates as of July 4, 2007; Anaconda installer updated to 10.1.1.63; performance improvement when building torrent files for the Avalanche Installer; database indirects, more flexibility with Rocks variables; Globus updated to gt4.0.4 with web services....

Sunergos Blue is a simple Login Manager for Gnome.

Simple and clean, with nothing distribution specific, The sunergos gdm theme features round-cornered, semi-transparent box for logins, a semi-transparent round-cornered bar at the bottom for restarting or halting the system, and a semi-transparent round-cornered top bar displaying the hostname and time.