round and round
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 306
Rockin Rounded Corners 1.0
Rockin Rounded Corners is an easy way to add rounded corners to any element on your web site. more>>
Rockin Rounded Corners is an easy way to add rounded corners to any element on your web site. Upload this script to your site to allow your web site visiters to quickly and easily generate the code needed to add rounded corners, or use it for your own site.
Main features:
- Easy to install. Just unzip and upload, or if youre using it on a local server, just unzip!
- 18 different rounded corner styles to choose from.
- Simple, clean code that is easy to apply site-wide
- Choose from HTML or PHP code for the rounded corners. The PHP code is slimmer, but theres HTML for those without PHP installed.
- An easy way to add a cool new feature to your web site.
<<lessMain features:
- Easy to install. Just unzip and upload, or if youre using it on a local server, just unzip!
- 18 different rounded corner styles to choose from.
- Simple, clean code that is easy to apply site-wide
- Choose from HTML or PHP code for the rounded corners. The PHP code is slimmer, but theres HTML for those without PHP installed.
- An easy way to add a cool new feature to your web site.
Download (0.061MB)
Added: 2006-02-06 License: Freeware Price:
1358 downloads
Aranha server monitor 0.1.0
Aranha server monitor is an application using rrdtool and XML-RPC to monitor servers with a XUL GUI. more>>
Aranha is an application that uses an XML-RPC layer to retrieve information from one or more servers. The type of information gathered is implemented via plugins, and can be displayed or archived in several different ways.
The data is gathered in Round Robin Databases (integrated with rrdtool) and can be accessed using a XUL interface available from the system. Plugins are very easy to write.
Configuration
To configure this module, either pass specific configuration values to
Makefile.PL like this:
perl Makefile.PL CONFIG_VAR="config val"
or
edit the %DEFAULTS variable on the toplevel Makefile.PL
Installation
To install this module type the following:
perl Makefile.PL
make
make test
make install
<<lessThe data is gathered in Round Robin Databases (integrated with rrdtool) and can be accessed using a XUL interface available from the system. Plugins are very easy to write.
Configuration
To configure this module, either pass specific configuration values to
Makefile.PL like this:
perl Makefile.PL CONFIG_VAR="config val"
or
edit the %DEFAULTS variable on the toplevel Makefile.PL
Installation
To install this module type the following:
perl Makefile.PL
make
make test
make install
Download (0.080MB)
Added: 2005-04-12 License: GPL (GNU General Public License) Price:
1656 downloads
Tournament Organiser and Assistant Director CVS
Tournament Organiser and Assistant Director provides a game tournament assistant. more>>
Tournament Organiser and Assistant Director provides a game tournament assistant.
Tournament Organiser and Assistant Director (TOAD) provides automation for many of the tasks needed by the director of a game tournament.
Main features:
- player registry
- match pairings
- round results
<<lessTournament Organiser and Assistant Director (TOAD) provides automation for many of the tasks needed by the director of a game tournament.
Main features:
- player registry
- match pairings
- round results
Download (MB)
Added: 2007-02-06 License: GPL (GNU General Public License) Price:
993 downloads
Games::Tournament::RoundRobin 0.01
Games::Tournament::RoundRobin is a Perl module for Round-Robin Tournament Schedule Pairings. more>>
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.
<<lessSYNOPSIS
$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.
Download (0.010MB)
Added: 2007-01-05 License: Perl Artistic License Price:
1024 downloads
xquarto 2.5
xquarto project is a two-player board game based on logic. more>>
xquarto project is a two-player board game based on logic.
Xquarto is a board game designed for the X windows environment. The game is a two-player game, although for the moment,it is only possible to play against the computer. The board is composed of 4x4 squares and 16 pieces. Each piece has four
properties: black or brown, horizontal or vertical, solid or hollow, round or square. This makes up 16 possible combinations and there is exactly one piece for each possibility.
Initially, the board is empty and it is successively filled with pieces. The game is over when a row, a column or a diagonal has four pieces carrying a common property in it, e.g. four black (brown) pieces, four square (round) pieces, four filled
(hollow) pieces, four horizontal (vertical) pieces. In the original quarto rules, the player who is the first to complete a row, column or diagonal as described above wins. This is the implicit mode under which xquarto runs. A variant of the game (tic rules) consists rather of avoiding alignments, i.e. the player who is forced to complete
an alignment loses.
The game is a two-player game. Player 1 chooses one of the 16 pieces. Player 2 then places this piece on one of the 16 squares of the board and chooses a piece out of the remaining 15 pieces which he gives to player 1, who places this piece on one of the remaining 15 squares on the board, etc...
Xquarto supports three different player combinations: human vs computer, computer vs human and human vs human (possibly through the local network in the latter case). The default combination is human vs computer, i.e. the human player starts the game against the computer. This can be changed by clicking on the "Actions" menu (see below for more details).
The rules are really very simple - believe me!
<<lessXquarto is a board game designed for the X windows environment. The game is a two-player game, although for the moment,it is only possible to play against the computer. The board is composed of 4x4 squares and 16 pieces. Each piece has four
properties: black or brown, horizontal or vertical, solid or hollow, round or square. This makes up 16 possible combinations and there is exactly one piece for each possibility.
Initially, the board is empty and it is successively filled with pieces. The game is over when a row, a column or a diagonal has four pieces carrying a common property in it, e.g. four black (brown) pieces, four square (round) pieces, four filled
(hollow) pieces, four horizontal (vertical) pieces. In the original quarto rules, the player who is the first to complete a row, column or diagonal as described above wins. This is the implicit mode under which xquarto runs. A variant of the game (tic rules) consists rather of avoiding alignments, i.e. the player who is forced to complete
an alignment loses.
The game is a two-player game. Player 1 chooses one of the 16 pieces. Player 2 then places this piece on one of the 16 squares of the board and chooses a piece out of the remaining 15 pieces which he gives to player 1, who places this piece on one of the remaining 15 squares on the board, etc...
Xquarto supports three different player combinations: human vs computer, computer vs human and human vs human (possibly through the local network in the latter case). The default combination is human vs computer, i.e. the human player starts the game against the computer. This can be changed by clicking on the "Actions" menu (see below for more details).
The rules are really very simple - believe me!
Download (0.034MB)
Added: 2006-11-28 License: GPL (GNU General Public License) Price:
1060 downloads
Sunergos Blue 0.0.4
Sunergos Blue is a simple Login Manager for Gnome. more>>
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.
<<lessSimple 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.
Download (0.23MB)
Added: 2006-09-26 License: GPL (GNU General Public License) Price:
1123 downloads
JTourney 1.0
JTourney is a Java based tool to support tournament directors conducting small to medium scale round based tournaments. more>>
JTourney is a Java based tool to support tournament directors conducting small to medium scale round based tournaments for multiplayer games.
JTourney tries to encaspulate over 10 years of experience with various tournament formats for different games. Those tournaments were conducted either manually or with the help (of many kind people and) a predecessor programm, which finally became too old and too small.
The need for JTourney arose since the tournaments conducted were rather flexibile: Players could hop on and hop off between rounds, the games played might allow variable number of players. Beside this flexibility JTourney could of course be used to support more rigid tournament formats, but this is not its focus.
Main features:
- Keeping player lists.
- Playcing players on tables for next round by variuos strategies.
- Generate score sheets for tables.
- Keeping track of game scores
- Calculating player scores, tiebreakers and rankings
How it works?
JTourney is a very simple design. It merely parses text files into its memory and composes new ones on design. While parsing its internal datafiles it also feeds this internal information to the RenderMode, therefore it provides you with more beautiful information than just the raw internal text files.
Note the system never stores things like standings or total scores of players internally. It turned out, that parsing input is very fast and never is a real problem for (say) 100 participants and 12 rounds (this is not a limit, it can most likely handle much more participants and more rounds) on a recent PC.
While this architecture is from the computer stone age it is flexible and powerful. Maybe a bit volatile, but after all it is entirely appropriate to put whatever kind of GUI on top if necessary!
<<lessJTourney tries to encaspulate over 10 years of experience with various tournament formats for different games. Those tournaments were conducted either manually or with the help (of many kind people and) a predecessor programm, which finally became too old and too small.
The need for JTourney arose since the tournaments conducted were rather flexibile: Players could hop on and hop off between rounds, the games played might allow variable number of players. Beside this flexibility JTourney could of course be used to support more rigid tournament formats, but this is not its focus.
Main features:
- Keeping player lists.
- Playcing players on tables for next round by variuos strategies.
- Generate score sheets for tables.
- Keeping track of game scores
- Calculating player scores, tiebreakers and rankings
How it works?
JTourney is a very simple design. It merely parses text files into its memory and composes new ones on design. While parsing its internal datafiles it also feeds this internal information to the RenderMode, therefore it provides you with more beautiful information than just the raw internal text files.
Note the system never stores things like standings or total scores of players internally. It turned out, that parsing input is very fast and never is a real problem for (say) 100 participants and 12 rounds (this is not a limit, it can most likely handle much more participants and more rounds) on a recent PC.
While this architecture is from the computer stone age it is flexible and powerful. Maybe a bit volatile, but after all it is entirely appropriate to put whatever kind of GUI on top if necessary!
Download (1.8MB)
Added: 2006-03-23 License: LGPL (GNU Lesser General Public License) Price:
1310 downloads
Russian Mafia 0.994
Russian Mafia is a multiplayer IRC game implementation of Russian Mafia. more>>
Russian Mafia project is a multiplayer IRC game implementation of Russian Mafia.
Russian Mafia is a multiplayer IRC game implementation of the popular game, Russian Mafia, which is based on the Russian card game "MAFIA".
The peaceful civilians attempt to kill all the Mafia and maniacs, while the Mafia and maniacs attempt to kill all the civilians.
After the crush of the Soviet Union, Moscow was plunged into a mafia terror. Russian Goverment asking asking Italian parliament to send them the most talanted detective Commissar Katani, who keep in fear italian mafia Kosa Nostra. Katani arrives in Moscow and with civilians is trying to calm down the crime in the city.
This if fully atomatic game, on the over hande its very interesting and simple multiplayer game. All the game function processed by the IRC mafia bot, which also stores the statistic informations and game points, bank accounts.
The main goal in this game to win. Peaceful civilians have to find and kill all mafia men and maniac, or mafia men and maniac have to kill all civilians, Commissar Katani and other peaceful roles. This mean, peaceful roles have to guess who is bad and kill them - how they can kill them, look down.
Its a round game, with a stages. At the start of each round the mafia bot randomly distribute the roles. The round two stages - day and night, with are repeating until the one of the sides win or until the draw. During the night the roles make the commands, and during the day all players decide whom to kill because of the evidence or guessing, or to process without killing.
To start you have to type !reg during the round registration. After you just follow the mafia bot commands.
After the round registration you will receive a role.
During the night you will be asked about a order to the bot, concerning the role you have.
During the day you have to talk to other players to guess who is criminal, and making votes for the person to kill (codnamn to die).
After the vote the acused person will die. If no winners from civilians or mafia, the game starting again at night stage.
<<lessRussian Mafia is a multiplayer IRC game implementation of the popular game, Russian Mafia, which is based on the Russian card game "MAFIA".
The peaceful civilians attempt to kill all the Mafia and maniacs, while the Mafia and maniacs attempt to kill all the civilians.
After the crush of the Soviet Union, Moscow was plunged into a mafia terror. Russian Goverment asking asking Italian parliament to send them the most talanted detective Commissar Katani, who keep in fear italian mafia Kosa Nostra. Katani arrives in Moscow and with civilians is trying to calm down the crime in the city.
This if fully atomatic game, on the over hande its very interesting and simple multiplayer game. All the game function processed by the IRC mafia bot, which also stores the statistic informations and game points, bank accounts.
The main goal in this game to win. Peaceful civilians have to find and kill all mafia men and maniac, or mafia men and maniac have to kill all civilians, Commissar Katani and other peaceful roles. This mean, peaceful roles have to guess who is bad and kill them - how they can kill them, look down.
Its a round game, with a stages. At the start of each round the mafia bot randomly distribute the roles. The round two stages - day and night, with are repeating until the one of the sides win or until the draw. During the night the roles make the commands, and during the day all players decide whom to kill because of the evidence or guessing, or to process without killing.
To start you have to type !reg during the round registration. After you just follow the mafia bot commands.
After the round registration you will receive a role.
During the night you will be asked about a order to the bot, concerning the role you have.
During the day you have to talk to other players to guess who is criminal, and making votes for the person to kill (codnamn to die).
After the vote the acused person will die. If no winners from civilians or mafia, the game starting again at night stage.
Download (0.033MB)
Added: 2007-01-04 License: GPL (GNU General Public License) Price:
1035 downloads
Bralkomon 1.0
Bralkomon is another system monitor Superkramba theme. more>>
Bralkomon is another system monitor Superkramba theme. It is based on Cynapses.
If you have a beautiful lady coming round, or maybe you just want to chill; put on some smooth jazz, put Bralkomon on your desktop, and let the good times roll.
Did I mention Bralkomon is scientifically designed to be the perfect accompaniment to smooth jazz? Oh yeah.
P.S. You might want to change the name of the network device. The .skz file is just a ZIP archive. Open it up, and edit the .theme file. Instructions lie within.
<<lessIf you have a beautiful lady coming round, or maybe you just want to chill; put on some smooth jazz, put Bralkomon on your desktop, and let the good times roll.
Did I mention Bralkomon is scientifically designed to be the perfect accompaniment to smooth jazz? Oh yeah.
P.S. You might want to change the name of the network device. The .skz file is just a ZIP archive. Open it up, and edit the .theme file. Instructions lie within.
Download (0.041MB)
Added: 2006-06-20 License: GPL (GNU General Public License) Price:
1223 downloads
Command line Calculator 1.01
Command Line calculator CLC is the calculator that can calculate direct at the linux console. more>>
Command Line calculator "CLC" is the calculator that can calculate direct at the Linux console.
Extract the CLCC file to /usr/bin you might need to login as root or equvalent account, to be able to access it whenever you need it.
Then just write CLCC 67+89 and the answer will be presented to you directly.
CLCC calculates from left to right with no exceptions. CLC also have some extra parameters that is sent to CLC using backslash parameters.
CLCC r2 10/3 this will round the result to 2 decimals you can use 1 to 9 if you want to round the sum of.
the r parameter can also be combined with the other parameters but it must be added first like this
CLCC r3c 10/3 - to get 10 diveded with 3 rounded down to 3 decimals.
CLCC is tested with Ubuntu 6.10 and Puppy OS 2.13 but should work with any Linux version in console mode.
The program is developed using Hotbasic for Linux and is Freeware, hope you find it useful, send and email if you have any questions.
Hotbasic is a basic language that compiles into assembler direct, no interpeter that slows down the code, just pure assembler.
So if you want assembler in Linux but doesnt want to code in nasm, HotBasic is the compiler for you.
<<lessExtract the CLCC file to /usr/bin you might need to login as root or equvalent account, to be able to access it whenever you need it.
Then just write CLCC 67+89 and the answer will be presented to you directly.
CLCC calculates from left to right with no exceptions. CLC also have some extra parameters that is sent to CLC using backslash parameters.
CLCC r2 10/3 this will round the result to 2 decimals you can use 1 to 9 if you want to round the sum of.
the r parameter can also be combined with the other parameters but it must be added first like this
CLCC r3c 10/3 - to get 10 diveded with 3 rounded down to 3 decimals.
CLCC is tested with Ubuntu 6.10 and Puppy OS 2.13 but should work with any Linux version in console mode.
The program is developed using Hotbasic for Linux and is Freeware, hope you find it useful, send and email if you have any questions.
Hotbasic is a basic language that compiles into assembler direct, no interpeter that slows down the code, just pure assembler.
So if you want assembler in Linux but doesnt want to code in nasm, HotBasic is the compiler for you.
Download (0.006MB)
Added: 2007-02-16 License: Freeware Price:
985 downloads
Mirro 1.0 Beta
Mirro is an application used to find the closest mirror to your connection. more>>
Mirro is an application used to find the closest mirror to your connection.
Mirro will find the closest mirror to your connection, given a file containing addresses. It pings every site extremely quickly, and sorts the reponses based on the number of hops and the round-trip time.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
<<lessMirro will find the closest mirror to your connection, given a file containing addresses. It pings every site extremely quickly, and sorts the reponses based on the number of hops and the round-trip time.
This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version.
Download (0.020MB)
Added: 2007-04-24 License: GPL (GNU General Public License) Price:
913 downloads
QMetronome 0.1
QMetronome is a skinnable metronome for Qt licenced under the GPL. more>>
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.
<<lessThe 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.
Download (0.14MB)
Added: 2006-07-20 License: GPL (GNU General Public License) Price:
1197 downloads
Goat 1.2
Goat is a tournament organiser assistant. more>>
Goat is a tournament organiser assistant. Goat is designed to help run long tournaments that are primarily organised by e-mail, such as Toulouses Permanent Go Tournament: a round is played each month, and its up to the players to arrange their meeting time and place.
Experience has shown that players need reminders to play their games, give results etc: basically, they need babysitting all along. As soon as the number of players grows, it becomes unpractical to manage this by hand. This is where Goat comes in: after pairing the players, the tournament admin will enter the pairing data into Goat, and Goat will take over all the remaining business.
Goat currently operates entirely in French, however all its source code is in English and I hope to make it easy to add languages. I currently plan to do that after the program has been tested in real life though. If you are interested in getting multi-language support quicker, drop me a line and Ill be happy to add it (or help you add it).
Enhancements:
- This is a massive rewrite.
- Data is now stored in a smarter format that allows you to save all rounds in one file.
- Data is no longer stored in Ssf, but using Data::Dumper (experiments with XML proved to be unusable).
- The code has been reorganised into modules.
- Helper programs have been added to register a list of players from an address book, export the status of games in HTML, and create new rounds from a Gotha pairing file.
<<lessExperience has shown that players need reminders to play their games, give results etc: basically, they need babysitting all along. As soon as the number of players grows, it becomes unpractical to manage this by hand. This is where Goat comes in: after pairing the players, the tournament admin will enter the pairing data into Goat, and Goat will take over all the remaining business.
Goat currently operates entirely in French, however all its source code is in English and I hope to make it easy to add languages. I currently plan to do that after the program has been tested in real life though. If you are interested in getting multi-language support quicker, drop me a line and Ill be happy to add it (or help you add it).
Enhancements:
- This is a massive rewrite.
- Data is now stored in a smarter format that allows you to save all rounds in one file.
- Data is no longer stored in Ssf, but using Data::Dumper (experiments with XML proved to be unusable).
- The code has been reorganised into modules.
- Helper programs have been added to register a list of players from an address book, export the status of games in HTML, and create new rounds from a Gotha pairing file.
Download (0.030MB)
Added: 2007-06-13 License: GPL (GNU General Public License) Price:
870 downloads
Xyria:DNSd 0.7.5
Xyria:DNSd is an high performance DNS server. more>>
Xyria:DNSd is an high performance DNS server that supports only the most important features and resource records while being extremely fast and secure.
Xyria:DNSd peoject also supports round-robin load balancing.
Main features:
- extemely fast implementation (main target)
- very secure
- ip-address based listen()ing
- supporting IPv6 addresses and resource records
- load ballancing via round robbin
- running under an low-privileged UID & GID
- running under little endian systems: (at least) Linux, Solaris, OpenBSD
- nice configuration syntax/easy to configure
- DNSd able to forward querys
- DNSd can run as caching only-server
Enhancements:
- The database was modified. Now DNSd uses a hashed array of pointers to binary trees including single linked lists for double valued hashes.
- It sorts the zones (by TTL) by itself (the admin doesnt has to care in which order he has to place the zones in the config file).
- Some code cleanup and a small bugfix are also included.
<<lessXyria:DNSd peoject also supports round-robin load balancing.
Main features:
- extemely fast implementation (main target)
- very secure
- ip-address based listen()ing
- supporting IPv6 addresses and resource records
- load ballancing via round robbin
- running under an low-privileged UID & GID
- running under little endian systems: (at least) Linux, Solaris, OpenBSD
- nice configuration syntax/easy to configure
- DNSd able to forward querys
- DNSd can run as caching only-server
Enhancements:
- The database was modified. Now DNSd uses a hashed array of pointers to binary trees including single linked lists for double valued hashes.
- It sorts the zones (by TTL) by itself (the admin doesnt has to care in which order he has to place the zones in the config file).
- Some code cleanup and a small bugfix are also included.
Download (0.091MB)
Added: 2006-02-20 License: BSD License Price:
1343 downloads
MARC::Crosswalk::DublinCore 0.02
MARC::Crosswalk::DublinCore is a Perl module that can convert data between MARC and Dublin Core. more>>
MARC::Crosswalk::DublinCore is a Perl module that can convert data between MARC and Dublin Core.
SYNOPSIS
my $crosswalk = MARC::Crosswalk::DublinCore->new;
# Convert a MARC record to Dublin Core (simple)
my $marc = MARC::Record->new_from_usmarc( $blob );
my $dc = $crosswalk->as_dublincore( $marc );
# Convert simple DC to MARC
$marc = $crosswalk->as_marc( $dc );
# Convert MARC to qualified DC instead
$crosswalk->qualified( 1 );
$dc = $crosswalk->as_dublincore( $marc );
This module provides an implentation of the LOCs spec on how to convert metadata between MARC and Dublin Core format. The spec for converting MARC to Dublin Core is available at: http://www.loc.gov/marc/marc2dc.html, and from DC to MARC: http://www.loc.gov/marc/dccross.html.
NB: The conversion cannot be done in a round-trip manner. i.e. Doing a conversion from MARC to DC, then trying to go back to MARC will not yield the original record.
<<lessSYNOPSIS
my $crosswalk = MARC::Crosswalk::DublinCore->new;
# Convert a MARC record to Dublin Core (simple)
my $marc = MARC::Record->new_from_usmarc( $blob );
my $dc = $crosswalk->as_dublincore( $marc );
# Convert simple DC to MARC
$marc = $crosswalk->as_marc( $dc );
# Convert MARC to qualified DC instead
$crosswalk->qualified( 1 );
$dc = $crosswalk->as_dublincore( $marc );
This module provides an implentation of the LOCs spec on how to convert metadata between MARC and Dublin Core format. The spec for converting MARC to Dublin Core is available at: http://www.loc.gov/marc/marc2dc.html, and from DC to MARC: http://www.loc.gov/marc/dccross.html.
NB: The conversion cannot be done in a round-trip manner. i.e. Doing a conversion from MARC to DC, then trying to go back to MARC will not yield the original record.
Download (0.008MB)
Added: 2006-08-07 License: Perl Artistic License Price:
1177 downloads
Secleted [ 0 ] software to compare
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above round and round search only lists software in full, demo and trial versions for free download. Download links are directly from our mirror sites or publisher sites, torrent files or links from rapidshare.com, yousendit.com or megaupload.com are not allowed
