round rugs
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 212
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
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
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
mod_ecgi
mod_cgi turns CGI program into a dynamically loaded library (.so) and runs it without forking. more>>
mod_cgi is an Apache module that turns a CGI program into a dynamically loaded library (.so) and runs it without forking. Gives the simplicity and portability of CGI without the overhead.
There is no documentation, beyond the source code comments. It will build cleanly with Apache 1.3b6+, and youll need some configuration: e.g.
AddHandler mod_ecgi .so
or
AddType x-embedded-cgi .so
As I said, see the source file.
Theres also a small harness for CGI programs, to get round the way many sloppy CGIs never return but call exit() instead. Its not absolutely necessary, but for most purposes youll want it.
<<lessThere is no documentation, beyond the source code comments. It will build cleanly with Apache 1.3b6+, and youll need some configuration: e.g.
AddHandler mod_ecgi .so
or
AddType x-embedded-cgi .so
As I said, see the source file.
Theres also a small harness for CGI programs, to get round the way many sloppy CGIs never return but call exit() instead. Its not absolutely necessary, but for most purposes youll want it.
Download (0.008MB)
Added: 2006-05-18 License: The Apache License Price:
1254 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
poink 1.6
poink provides a TCP/IP-based ping tool. more>>
poink provides a TCP/IP-based ping tool.
poink is a TCP/IP-based ping implementation that does not require special privileges and is designed for multiuser shell systems. It is intended to be a secure replacement for the standard IPv4 network monitoring tool.
Not much to say... This is a nosuid, so quite secure, version of ping utility
for IPv4. It uses dirty trick - TCP linear SYN/RST challenge instead of
ICMP echo/echo reply. It wont allow any flood-pings (others than connect
flood you could achieve anyway), security compromises etc.
Currently, basic ping parameters are implemented (compatible with
original ping):
ping [ -i delay ] [ -c count ] [ -t timeout ] hostname
-i delay - delay between pings in seconds (default 1, min. 1)
-c count - number of packets to send (default: 0 - until break)
-t timeout - packet timeout in seconds (default: 4, min. 1)
NOTE: longer timeouts might result in slightly inaccurate results because of TCP/IP retransmits.
When finished or stopped with Ctrl+C (SIGINT), poink prints some statistics
about round-trip times, jest like the original ping does. Round-trip times
are displayed in miliseconds (1/1000 of second, ms), but unlike its setuid
counterpart, nosuid ping additionally displays time in microseconds
(1/1000000 of second, usec) if trip time is really low (well, I think that
more recent versions of ping are doing it now, too).
Currently, Linux is the only supported platform, but BSD port should
be really easy to develop.
<<lesspoink is a TCP/IP-based ping implementation that does not require special privileges and is designed for multiuser shell systems. It is intended to be a secure replacement for the standard IPv4 network monitoring tool.
Not much to say... This is a nosuid, so quite secure, version of ping utility
for IPv4. It uses dirty trick - TCP linear SYN/RST challenge instead of
ICMP echo/echo reply. It wont allow any flood-pings (others than connect
flood you could achieve anyway), security compromises etc.
Currently, basic ping parameters are implemented (compatible with
original ping):
ping [ -i delay ] [ -c count ] [ -t timeout ] hostname
-i delay - delay between pings in seconds (default 1, min. 1)
-c count - number of packets to send (default: 0 - until break)
-t timeout - packet timeout in seconds (default: 4, min. 1)
NOTE: longer timeouts might result in slightly inaccurate results because of TCP/IP retransmits.
When finished or stopped with Ctrl+C (SIGINT), poink prints some statistics
about round-trip times, jest like the original ping does. Round-trip times
are displayed in miliseconds (1/1000 of second, ms), but unlike its setuid
counterpart, nosuid ping additionally displays time in microseconds
(1/1000000 of second, usec) if trip time is really low (well, I think that
more recent versions of ping are doing it now, too).
Currently, Linux is the only supported platform, but BSD port should
be really easy to develop.
Download (0.012MB)
Added: 2007-02-28 License: GPL (GNU General Public License) Price:
969 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
wsdebug 0.1
wsdebug is a debugger for the Whitespace programming language. more>>
wsdebug is a debugger for the more or less famous whitespace programming language, coming along with a rather fast interpreter (wsi).
Most programming languages like C or Perl do not care for white space characters (like tab, space or newline/linefeed). The whitespace programming language works just the other way round, dont care for any character but those white space ones.
On the whole its just another geeky language like Brainfuck and others, however more adicting.
If youve written a whole lot of instructions youll probably reach the point, where you get lost. Then just put your script into wsdebug and step through your bunch of whitespace instructions and watch how each command manipulates the stack (or heap).
<<lessMost programming languages like C or Perl do not care for white space characters (like tab, space or newline/linefeed). The whitespace programming language works just the other way round, dont care for any character but those white space ones.
On the whole its just another geeky language like Brainfuck and others, however more adicting.
If youve written a whole lot of instructions youll probably reach the point, where you get lost. Then just put your script into wsdebug and step through your bunch of whitespace instructions and watch how each command manipulates the stack (or heap).
Download (0.27MB)
Added: 2005-04-14 License: GPL (GNU General Public License) Price:
1654 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
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
Open Conference Systems 2.0
Open Conference Systems is a free Web publishing tool that will create a complete Web presence for your scholarly conference. more>>
Open Conference Systems or OCS for short, is a free Web publishing tool that will create a complete Web presence for your scholarly conference.
Main features:
- create a conference Web site
- compose and send a call for papers
- electronically accept paper and abstract submissions
- allow paper submitters to edit their work
- post conference proceedings and papers in a searchable format
- post, if you wish, the original data sets
- register participants
- integrate post-conference online discussions
Enhancements:
- manage conferences that occur more than once (e.g. yearly)
- an expanded, multiple-round review system
- e-mail template system
- localization & translation tools
- credit card payment for registrations
- automated "thanks-for-submitting" messages
- accept login/password for participants
- Creative Commons licensing of presentations
- more customizable, scalable and secure code
- ...and much more.
<<lessMain features:
- create a conference Web site
- compose and send a call for papers
- electronically accept paper and abstract submissions
- allow paper submitters to edit their work
- post conference proceedings and papers in a searchable format
- post, if you wish, the original data sets
- register participants
- integrate post-conference online discussions
Enhancements:
- manage conferences that occur more than once (e.g. yearly)
- an expanded, multiple-round review system
- e-mail template system
- localization & translation tools
- credit card payment for registrations
- automated "thanks-for-submitting" messages
- accept login/password for participants
- Creative Commons licensing of presentations
- more customizable, scalable and secure code
- ...and much more.
Download (1.5MB)
Added: 2007-06-16 License: GPL (GNU General Public License) Price:
864 downloads
Xyria:CDPNNTPd 0.1.9
Xyria:CDPNNTPd is a minimalistic, easy to configure NNTP server for Unix. more>>
Xyria:CDPNNTPd is a minimalistic, easy to configure NNTP server for Unix.
The Xyria-project has been founded by Steffen Wendzel in 2004. The main goal of the project is to develop Unix services based on the following characteristics:
Provide a maximum of security while writing a minimum of code; only implement the most useful features and use as less external librarys as possible while supporting Solaris, OpenBSD and Linux x86.
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:
- This release includes a memory allocation bugfix in the xover command, a speed improvement (also in xover), and a source code cleanup.
<<lessThe Xyria-project has been founded by Steffen Wendzel in 2004. The main goal of the project is to develop Unix services based on the following characteristics:
Provide a maximum of security while writing a minimum of code; only implement the most useful features and use as less external librarys as possible while supporting Solaris, OpenBSD and Linux x86.
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:
- This release includes a memory allocation bugfix in the xover command, a speed improvement (also in xover), and a source code cleanup.
Download (0.061MB)
Added: 2006-02-17 License: BSD License Price:
1344 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
Slingshot 0.8.1p
Slingshot is a two dimensional, turn based simulation-strategy game. more>>
Slingshot is a two dimensional, turn based simulation-strategy game set in the gravity fields of several planets. It is a highly addictive game, and never the same from round to round due to its randomly generated playing fields.
It is a deceptively simple game, the goal is to shoot the other spacecraft through the field of planets, but their gravity makes it tricky. The effects of the gravity mean that although its easy to learn how to play, and to enjoy playing, it could take a lifetime to thoroughly master.
In order to hit your opponent, you can rotate you ship to aim in any direction, and you can change the power with which your projectile is launched - the initial speed at which it flies.
This project is free software as defined by the Free Software Foundation, it is released under the GNU General Public License (GPL). This means you are free to download, copy, modify, redistribute, disassemble, analyse or sell Slingshot under the terms of the aforementioned license. Enjoy!
<<lessIt is a deceptively simple game, the goal is to shoot the other spacecraft through the field of planets, but their gravity makes it tricky. The effects of the gravity mean that although its easy to learn how to play, and to enjoy playing, it could take a lifetime to thoroughly master.
In order to hit your opponent, you can rotate you ship to aim in any direction, and you can change the power with which your projectile is launched - the initial speed at which it flies.
This project is free software as defined by the Free Software Foundation, it is released under the GNU General Public License (GPL). This means you are free to download, copy, modify, redistribute, disassemble, analyse or sell Slingshot under the terms of the aforementioned license. Enjoy!
Download (2.0MB)
Added: 2007-07-16 License: Freeware Price:
836 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 rugs 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