Free robin hood software for linux

DOLFIN project is the C++ interface of FEniCS, providing a consistent PSE (Problem Solving Environment) for solving ordinary and partial differential equations.
Main features:
- Simple, consistent and intuitive object-oriented API
- Automatic and efficient evaluation of variational forms through FFC
- Automatic and efficient assembly of linear systems
- Support for general families of finite elements, including continuous and discontinuous Lagrange finite elements of arbitrary order on triangles and tetrahedra through FIAT
- Support for arbitrary mixed elements, including Taylor-Hood
- High-performance parallel linear algebra through PETSc with simple C++ wrappers
- Triangular and tetrahedral meshes, including adaptive mesh refinement and mesh hierarchies
- Multi-adaptive mcG(q)/mdG(q) and mono-adaptive cG(q)/dG(q) ODE solvers
- Support for a range of output formats for post-processing, including DOLFIN XML, MATLAB, Octave, OpenDX, GiD, Tecplot and Paraview/VTK
- SWIG-generated Python interface PyDOLFIN (experimental) in addition to the standard C++ interface

OBEXFTP Front-End is very effective Java Swing application that uses the ObexFTP under the hood to make easier to manipulate the file system of OBEX-enabled devices.
The Open OBEX project, which is an open source project hosted in SourceForge.net, is the most successful implementation of the OBEX (OBject EXchange) protocol for Open Source Unix-based Operating Systems. Besides, it supports a wide range of devices of different models and vendors.
The only bad thing about this project is that the Open OBEX is a set of command-line programs, and they are not so friendly to the end users. We have been using the Open OBEX for some time, and we felt the need of a friendly user interface to make things easier for us - the users.
So, ObexFTP front-end is a simple - but nice - Java Swing application that uses ObexFTP under the hood to make easier to manipulate the file system of OBEX-enabled devices.
Main features:
- navigate through the devices files;
- create folders in the device;
- send file(s) to the device;
- download file(s) to your computer;
- delete files and folders;
The ObexFTP has been tested in the following Operating Systems:
- Slackware 12.0
- Ubuntu 7.0.4
If youre successfully running ObexFTP front-end in other Operating System than those listed here, please let us know!

fping is a ping like program which uses the Internet Control Message Protocol (ICMP) echo request to determine if a host is up. fping is different from ping in that you can specify any number of hosts on the command line, or specify a file containing the lists of hosts to ping.

Instead of trying one host until it timeouts or replies, fping will send out a ping packet and move on to the next host in a round-robin fashion.

If a host replies, it is noted and removed from the list of hosts to check. If a host does not respond within a certain time limit and/or retry limit it will be considered unreachable.

Unlike ping, fping is meant to be used in scripts and its output is easy to parse.

Problem and Issues:

With a large a number of IP addresses in use, its becomes more and more time consuming to check on which IP addresses are actively in use, and which critical machines (routers, bridges, servers, etc) are reachable. One example is we have a program which goes through all of our routers arp caches looking for IP addresses that are in use. After finding a list of IP addresses that arent in any arp caches fping can then be used to see if these IP addresses really arent being used, or are just behind the routers. Checking 2500 hosts (99% of which are unreachable) via ping can take hours.

fping was written to solve the problem of pinging N number of hosts in an efficient manner. By sending out pings in a round-robin fashion and checking on responses as they come in at random, a large number of hosts can be checked at once.

Unlike ping, fping is meant to be used in scripts and its output is easy to parse.

OSSP flow2rrd is a companion tool to the Flow-Tools toolkit for storing NetFlow network traffic data in an accumulating fixed-size RRDTool Round-Robin-Database (RRD) for visualization purposes.
This file is piece of OSSP flow2rrd, a tool for storing NetFlow data into an RRD which can be found at http://www.ossp.org/pkg/tool/flow2rrd/.
Enhancements:
- Created the initial version of OSSP flow2rrd.

mergelog provides a fast tool to merge HTTP log files by date.
mergelog is a small and fast C program, which merges HTTP log files by date in Common Log Format (Apache default log format) from Web servers, behind round-robin DNS.
It has been designed to easily process huge logs from highly stressed servers, and can manage gzipped files.
Enhancements:
- dont abort anymore on corrupted log lines
- set BUFFER_SIZE value to 32Ko
- fixed a major bug on a broken month initialization
- corrections on manpages
- fix in configure.in to abort if zlib is not present
- fixed a potential segmentation fault on malformed log lines
- autoconf compliant thanks to Igor Genibel

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.

SuperShaper-SOHO is a traffic shaping setup for DSL connections which prioritizes VoIP and interactive traffic and makes sure P2P traffic doesnt saturate your uplink.
IPCop 1.3 and newer is known to work and is the preferred deployment setup. Firstly, be sure to disable the integrated traffic shaper in IPCop 1.4 if you use SuperShaper-SOHO.

File::Copy::Link is a Perl extension for replacing a link by a copy of the linked file.

SYNOPSIS

use File::Copy::Link;
copylink file.lnk;

use File::Copy::Link qw(safecopylink);
safecopylink file.lnk;

copylink

reads the filename linked to by the argument and replaced the link with a copy of the file. It opens a filehandle to read from the link, deletes the link, and then copies the filehandle back to the link.

safecopylink

does the same as copylink but without the open-and-delete manouvre. Instead, it uses File::Spec::Link to find the target of the link and copies from there.

This module is mostly a wrapper round File::Spec::Link::linked and File::Copy::copy, the functionality is available in a command line script copylink.