tennis 0.4.8
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 18
Free Tennis 0.4.8
Free Tennis is a tennis simulation developed by a former tennis player. more>>
Free Tennis is a tennis simulation developed by a former tennis player. Its main feature is realism.
For gameplay, this means you have total control over the shot parabola. For graphics, it means players have realistic gestures. For AI, it means real tactics.
Free Tennis is a tenis simulator game.
Main features:
- Real tactics are useful in the game (e.g. it is best to take the net with a slow, low shot (backspin); it is best to play diagonal in order not to give angles, especially when you are decentered; you should get back to center after the shot, and not be caught in no-mans-land when the opponent hits; etc.);
- The A.I. is very advanced and reflects those tactics;
- You have total control over the parabola described by the shot;
- The graphic gestures are realistic and elegant;
- Different players have different skills;
- The game is developed by a former tennis player;
- Free Tennis is Free Software (which means more than simply "open-source"). It is released under the GPL license. Should you need another license, please ask the author.
<<lessFor gameplay, this means you have total control over the shot parabola. For graphics, it means players have realistic gestures. For AI, it means real tactics.
Free Tennis is a tenis simulator game.
Main features:
- Real tactics are useful in the game (e.g. it is best to take the net with a slow, low shot (backspin); it is best to play diagonal in order not to give angles, especially when you are decentered; you should get back to center after the shot, and not be caught in no-mans-land when the opponent hits; etc.);
- The A.I. is very advanced and reflects those tactics;
- You have total control over the parabola described by the shot;
- The graphic gestures are realistic and elegant;
- Different players have different skills;
- The game is developed by a former tennis player;
- Free Tennis is Free Software (which means more than simply "open-source"). It is released under the GPL license. Should you need another license, please ask the author.
Download (6.9MB)
Added: 2006-02-23 License: GPL (GNU General Public License) Price:
1368 downloads
Pzn Tennis 1.0
Pzn Tennis project isnt a tennis game... is like a pong game but with different rules and modified game styles. more>>
Pzn Tennis project isnt a tennis game... is like a pong game but with different rules and modified game styles.
Contrary to the classic pong game, you will be able to move your racket in all your area. PznTennis is a entertained game for 2 Players in the same PC.
<<lessContrary to the classic pong game, you will be able to move your racket in all your area. PznTennis is a entertained game for 2 Players in the same PC.
Download (0.50MB)
Added: 2007-04-20 License: Freeware Price:
919 downloads
gtk-send-pr 0.4.8
gtk-send-pr is a problem report tool, designed to send reports to a GNATS database server using libesmtp to deliver mail. more>>
gtk-send-pr is a problem report tool, designed to send reports to a GNATS database server using libesmtp to deliver mail.
The program has a user friendly interface and lets you use any SMTP server, including support for AUTH and TLS, to send the report, removing the need for a local configured sendmail. gtk-send-pr is part of both the FreeBSD ports and NetBSDs pkgsrc.
<<lessThe program has a user friendly interface and lets you use any SMTP server, including support for AUTH and TLS, to send the report, removing the need for a local configured sendmail. gtk-send-pr is part of both the FreeBSD ports and NetBSDs pkgsrc.
Download (0.073MB)
Added: 2006-12-08 License: BSD License Price:
1050 downloads
KNemo 0.4.8
KNemo is the KDE Network Monitor. more>>
KNemo displays for every network interface an icon in the systray. Tooltips and an info dialog provide further information about the interface. Passive popups inform about interface changes. A traffic plotter is also integrated.
KNemo polls the network interface status every second using the ifconfig, route and iwconfig tools.
Main features:
- support for ethernet (including wireless) and ppp connections
- the icon shows incoming/outgoing traffic
- hiding of icon when the interface is not available
- hiding of icon when the interface does not exist (useful for interfaces that are dynamically created and and removed)
- automatic detection of wireless extensions for ethernet interfaces
- left-clicking on an icon displays a status dialog with information about the selected interface (2nd click hides dialog)
- middle-clicking on an icon displays a traffic plotter that was taken from KSysGuard (2nd click hides dialog)
- configuration via context menu or control center module (Internet & Network/Network Monitor)
- customizable tooltip for quick access to often needed information
- custom entries in the context menu. Useful to start/stop/restart interfaces or to configure them using external tools.
- automatic detection of available interfaces (click on Default in the configuration dialog and KNemo will look under /proc/net/dev for interfaces)
- support for notifications via sound and passive popups
- KNemo counts the number of transfered bytes and does not depend on the output
- of ifconfig for the total number of transfered bytes. This way KNemo can
- even display a hugh amount of traffic while ifconfig has an overflow at 4GB.
- support for different iconsets for every interface
- support for daily, monthly and yearly statistics
- configurable update interval for interface informations
- support for different backends to gather information
<<lessKNemo polls the network interface status every second using the ifconfig, route and iwconfig tools.
Main features:
- support for ethernet (including wireless) and ppp connections
- the icon shows incoming/outgoing traffic
- hiding of icon when the interface is not available
- hiding of icon when the interface does not exist (useful for interfaces that are dynamically created and and removed)
- automatic detection of wireless extensions for ethernet interfaces
- left-clicking on an icon displays a status dialog with information about the selected interface (2nd click hides dialog)
- middle-clicking on an icon displays a traffic plotter that was taken from KSysGuard (2nd click hides dialog)
- configuration via context menu or control center module (Internet & Network/Network Monitor)
- customizable tooltip for quick access to often needed information
- custom entries in the context menu. Useful to start/stop/restart interfaces or to configure them using external tools.
- automatic detection of available interfaces (click on Default in the configuration dialog and KNemo will look under /proc/net/dev for interfaces)
- support for notifications via sound and passive popups
- KNemo counts the number of transfered bytes and does not depend on the output
- of ifconfig for the total number of transfered bytes. This way KNemo can
- even display a hugh amount of traffic while ifconfig has an overflow at 4GB.
- support for different iconsets for every interface
- support for daily, monthly and yearly statistics
- configurable update interval for interface informations
- support for different backends to gather information
Download (0.59MB)
Added: 2007-05-29 License: GPL (GNU General Public License) Price:
881 downloads
YasSS 0.4.8
YasSS is a command line C++ program that solves given Sudokus. more>>
YasSS is a command line C++ program that solves given Sudokus.
The actual work is done in a class the encapsulates all the functionality, so it should be easy to set up another GUI for it.
How It Works
YasSS stores the Sudoku field in a two-dimensional array. For each cell there is stored which numbers can be entered there.
The actual solver is discussed below.
Header File of Class Sudoku
If a cell contains a zero, it is empty.
#ifndef _MORITZ_FIELD_
#define _MORITZ_FIELD_
#include < iostream >
// a Sudoku playing field implemented as a 2d fixed size array
// contains consistency checks and a solver.
class sudoku {
public:
sudoku();
// creates a field with in ital data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(char init_data[9][9]);
sudoku(char* init_data);
// creates a field with initial data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(int init_data[9][9]);
// generates a rather simplistic output to the given stream
// call as pretty_print(cout) or something like that...
void pretty_print(std::ostream &handle);
// just print all chars in one row
void print(std::ostream &handle);
// sets item (x, y) to val
// assumes that it is doesnt lead to an intermediate
// conflict with sudoku rules
// which is equivalent to saying it requires
// allowed_set(val, x, y) to be true
void set_item(char val, int x, int y);
// get entry at position (x, y)
// 0 means "unset"
int get_item(int x, int y);
// returns true if it doesnt lead to a direct error if you
// set (x, y) to val
// If data[x][y] != 0 the return value is
// true if val == data[x][y]
bool allowed_set(char val, int x, int y);
// try to solve the puzzle. Returns true on success.
bool solve();
// returns true if there is no zero entry left, e.g. the
// problem is solved correctly.
bool is_solved();
// returns true if there is no possibility to continue without
// violating rule
bool is_stuck();
protected:
// contains 0 for unset values and the corresponding value
// if the value is set
char data[9][9];
// allowed[x][y][i] is true if and only if it is possible to
// set data[x][y] to i+1 without conjuring an immediate
// collision.
// If data[x][y] == i != 0 then allowed[x][y][i] is true,
// allowed[x][y][j] = false for j != i
bool allowed[9][9][9];
bool simple_solve();
bool simple_solve1();
bool simple_solve2();
// returns either an is_solved or a stuck() version of *this
bool backtrack();
void null_init();
int recursion_depth;
void set_recursion_depth(int rd) {recursion_depth = rd;};
};
Enhancements:
- This release adds an option to generate Sudokus with a random number of initial clues.
<<lessThe actual work is done in a class the encapsulates all the functionality, so it should be easy to set up another GUI for it.
How It Works
YasSS stores the Sudoku field in a two-dimensional array. For each cell there is stored which numbers can be entered there.
The actual solver is discussed below.
Header File of Class Sudoku
If a cell contains a zero, it is empty.
#ifndef _MORITZ_FIELD_
#define _MORITZ_FIELD_
#include < iostream >
// a Sudoku playing field implemented as a 2d fixed size array
// contains consistency checks and a solver.
class sudoku {
public:
sudoku();
// creates a field with in ital data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(char init_data[9][9]);
sudoku(char* init_data);
// creates a field with initial data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(int init_data[9][9]);
// generates a rather simplistic output to the given stream
// call as pretty_print(cout) or something like that...
void pretty_print(std::ostream &handle);
// just print all chars in one row
void print(std::ostream &handle);
// sets item (x, y) to val
// assumes that it is doesnt lead to an intermediate
// conflict with sudoku rules
// which is equivalent to saying it requires
// allowed_set(val, x, y) to be true
void set_item(char val, int x, int y);
// get entry at position (x, y)
// 0 means "unset"
int get_item(int x, int y);
// returns true if it doesnt lead to a direct error if you
// set (x, y) to val
// If data[x][y] != 0 the return value is
// true if val == data[x][y]
bool allowed_set(char val, int x, int y);
// try to solve the puzzle. Returns true on success.
bool solve();
// returns true if there is no zero entry left, e.g. the
// problem is solved correctly.
bool is_solved();
// returns true if there is no possibility to continue without
// violating rule
bool is_stuck();
protected:
// contains 0 for unset values and the corresponding value
// if the value is set
char data[9][9];
// allowed[x][y][i] is true if and only if it is possible to
// set data[x][y] to i+1 without conjuring an immediate
// collision.
// If data[x][y] == i != 0 then allowed[x][y][i] is true,
// allowed[x][y][j] = false for j != i
bool allowed[9][9][9];
bool simple_solve();
bool simple_solve1();
bool simple_solve2();
// returns either an is_solved or a stuck() version of *this
bool backtrack();
void null_init();
int recursion_depth;
void set_recursion_depth(int rd) {recursion_depth = rd;};
};
Enhancements:
- This release adds an option to generate Sudokus with a random number of initial clues.
Download (1.3MB)
Added: 2007-06-21 License: GPL (GNU General Public License) Price:
855 downloads
GRPLib 0.4.8
GRPLib is a game library that directly supports Blizzards GRP format , which is used in StarCraft and Diablo II games. more>>
GRPLib is a game library that directly supports Blizzards GRP format (8-bit sprites), which is used in StarCraft and Diablo II games.
GRPLib is very fast and can display realistic terrain, units, and effects.
Enhancements:
- created ./configure with autoconf utilities 2.removed files.h and files.cpp as non needed
<<lessGRPLib is very fast and can display realistic terrain, units, and effects.
Enhancements:
- created ./configure with autoconf utilities 2.removed files.h and files.cpp as non needed
Download (0.60MB)
Added: 2006-05-22 License: GPL (GNU General Public License) Price:
1252 downloads
Tennix! SDL Port 0.3.2
Tennix! SDL Port is a simple two-player tennis game. more>>
Tennix! SDL Port is a simple two-player tennis game.
It features simple image loading (with all game graphics being customizable by simply editing them with a graphics editor like The GIMP), sound effects, stadium audience sounds, and ball shadows.
The source code for this SDL port is released under the terms of the GNU General Public License, Version 2 (or later).
Controls
Player 1 uses the keys W, S and D and Player 2 uses O, L and K.
<<lessIt features simple image loading (with all game graphics being customizable by simply editing them with a graphics editor like The GIMP), sound effects, stadium audience sounds, and ball shadows.
The source code for this SDL port is released under the terms of the GNU General Public License, Version 2 (or later).
Controls
Player 1 uses the keys W, S and D and Player 2 uses O, L and K.
Download (0.47MB)
Added: 2007-07-08 License: Freeware Price:
838 downloads
NetWalk 0.4.8
NetWalk is a puzzle game where the object is to connect every terminal to the server. more>>
NetWalk is a puzzle game where the object is to connect every terminal to the server.
There are network cables of various shapes within a grid, and a move consists of rotating any square of a grid. Rotating a cable can bring some terminals online, but may also take other ones offline.
<<lessThere are network cables of various shapes within a grid, and a move consists of rotating any square of a grid. Rotating a cable can bring some terminals online, but may also take other ones offline.
Download (0.063MB)
Added: 2006-10-30 License: GPL (GNU General Public License) Price:
1103 downloads
Morseall 0.4.8
Morseall allows you to control any computer using morse code. more>>
Morseall allows you to control any computer using only the mouse buttons. It allows you to produce keystrokes by tapping Morse codes with just a single button or with a three-button mouse for faster entry.
Morseall is designed for disabled users who can only move one muscle.
Morseall can also be used with wearable laptops, tablets, or handhelds where a keyboard would be inconvenient or unavailable.
Main features:
- Anyone who can press a switch can use Morseall!
- You can go faster if you can control two or three buttons
- An Iambic Keyer is available for ultra-fast coding
- Audio feedback is given for each dot and dash
- Characters can be read aloud as they are typed for verification
- It works with a standard mouse! No custom hardware needed.
- On-line help is always visible for looking up codes
- Takes over the mouse so disabled users can maintain control.
- Code Timing is adjustable from within the program (seven dots=faster)
- A Configuration file allows you to set defaults (/etc/morseall.conf)
- A Reset feature helps users recover if the terminal gets stuck
- Visual feedback on your morse code timing as you key it
- Morseall is Free Software, Licensed under the GNU GPL
Enhancements:
- The most-recent code sequence is kept visible, for better sanity checking.
- A repeat code is available for users who cant hold it in for the normal repeat (some sip/puff users need this)
<<lessMorseall is designed for disabled users who can only move one muscle.
Morseall can also be used with wearable laptops, tablets, or handhelds where a keyboard would be inconvenient or unavailable.
Main features:
- Anyone who can press a switch can use Morseall!
- You can go faster if you can control two or three buttons
- An Iambic Keyer is available for ultra-fast coding
- Audio feedback is given for each dot and dash
- Characters can be read aloud as they are typed for verification
- It works with a standard mouse! No custom hardware needed.
- On-line help is always visible for looking up codes
- Takes over the mouse so disabled users can maintain control.
- Code Timing is adjustable from within the program (seven dots=faster)
- A Configuration file allows you to set defaults (/etc/morseall.conf)
- A Reset feature helps users recover if the terminal gets stuck
- Visual feedback on your morse code timing as you key it
- Morseall is Free Software, Licensed under the GNU GPL
Enhancements:
- The most-recent code sequence is kept visible, for better sanity checking.
- A repeat code is available for users who cant hold it in for the normal repeat (some sip/puff users need this)
Download (0.49MB)
Added: 2006-08-30 License: GPL (GNU General Public License) Price:
1151 downloads
Soulfind 0.4.8
Soulfind is a free Soulseek server program. more>>
Soulfind is a Soulseek server implementation for Linux, though it can probably be compiled under Mac OS X, BSD or Windows as well (if you have tried to build Soulfind under another OS than Linux, Id like to know if it worked, and what happens if it didnt). This homepage is there to provide some information about it.
Theres also a new #slsk-gpl room on Freenode (irc.freenode.net), Ill try to be there as often as possible (but 50H/month dial-up sucks).
Soulfind is coded using the D programming language and released under the GNU General Public License.
It originally started with me being bored on a sunday afternoon, and coding a basic chat-only Soulseek server... since it was easier than what I had expected, I decided to go on and implement the full protocol.
The name just comes from people ranting about how their searches on the official server do not return enough results... indeed its name is only Soulseek, while this one is Soulfind.
The server supports the Nicotine, Museek and PySoulSeek clients (actually, all clients except the official Windows one should work). The Windows client also works to some extent, but you have to trick it to make it connect to another server on another port, and it also checks for an md5sum in the server answer, which this server doesnt send.
Enhancements:
- This release compiles with DMD 0.155, and supports the new server-handled room and buddy searches.
- Several minor bugs have been fixed, as well as a more important one about privileges (giving some privileges to another user did not add to his existing privileges, but replaced them).
<<lessTheres also a new #slsk-gpl room on Freenode (irc.freenode.net), Ill try to be there as often as possible (but 50H/month dial-up sucks).
Soulfind is coded using the D programming language and released under the GNU General Public License.
It originally started with me being bored on a sunday afternoon, and coding a basic chat-only Soulseek server... since it was easier than what I had expected, I decided to go on and implement the full protocol.
The name just comes from people ranting about how their searches on the official server do not return enough results... indeed its name is only Soulseek, while this one is Soulfind.
The server supports the Nicotine, Museek and PySoulSeek clients (actually, all clients except the official Windows one should work). The Windows client also works to some extent, but you have to trick it to make it connect to another server on another port, and it also checks for an md5sum in the server answer, which this server doesnt send.
Enhancements:
- This release compiles with DMD 0.155, and supports the new server-handled room and buddy searches.
- Several minor bugs have been fixed, as well as a more important one about privileges (giving some privileges to another user did not add to his existing privileges, but replaced them).
Download (0.044MB)
Added: 2006-05-11 License: GPL (GNU General Public License) Price:
1261 downloads
ipfreeze 0.4.8
Ipfreeze is a program that listens to the netlink device. more>>
Ipfreeze is a program that listens to the netlink device. It takes the source address from every incoming packet and adds it to a Netfilter "blacklist" chain. The address is removed from this chain after a user-definable period of time. This allows you to create rules that detect and halt certain odd behaviors, such as ports scans, syn floods, or connection attempts on forbidden ports.
This iptables script manage the rules insertion in the running kernel and launches ipfreeze.pl. This perl script listens on the netlink device for packets that are passed by the firewall (QUEUE target). If a packet is sent, ipfreeze get the source IP and insert a new rule in the firewall that will destroy every packets coming from that IP. This rule is automatically removed after the user defines a period (usually 10 or 20min).
Theses iptables scripts are inteded to be used on gnu/linux systems that are always connected to the internet or to protect small simple networks. I started to write this for my personnal purposes. I do not pretend it will give you maximum security but I have been using it from more that one year and I am very happy with it.
Main features:
- Protection from floods (like syn or ping floods)
- basic anti-nmap ports detection
- whitelist and permanent blacklist
- forbidden ports (why should someone connect to the telnet port of a firewall mmmh ?)
- Masquerading and dNAT to share your internet access.
<<lessThis iptables script manage the rules insertion in the running kernel and launches ipfreeze.pl. This perl script listens on the netlink device for packets that are passed by the firewall (QUEUE target). If a packet is sent, ipfreeze get the source IP and insert a new rule in the firewall that will destroy every packets coming from that IP. This rule is automatically removed after the user defines a period (usually 10 or 20min).
Theses iptables scripts are inteded to be used on gnu/linux systems that are always connected to the internet or to protect small simple networks. I started to write this for my personnal purposes. I do not pretend it will give you maximum security but I have been using it from more that one year and I am very happy with it.
Main features:
- Protection from floods (like syn or ping floods)
- basic anti-nmap ports detection
- whitelist and permanent blacklist
- forbidden ports (why should someone connect to the telnet port of a firewall mmmh ?)
- Masquerading and dNAT to share your internet access.
Download (0.005MB)
Added: 2006-07-07 License: GPL (GNU General Public License) Price:
1204 downloads
AROS-Max 0.4.8
AROS-Max is a AROS-based live-CD. more>>
AROS-Max is a AROS-based live-CD.
AROS Max is a pre-configured live bootable CD image, made to show off the best that AROS has to offer. It requires an AROS capable PC, your mileage may vary.
If you require help getting AROS-Max to run please ask for help on the Max area at the AROS-Exec messageboard, please do not email us directly with support problems!
AROS is a portable and free desktop operating system aiming at being compatible with AmigaOS 3.1, while improving on it in many areas. The source code is available under an open source license, which allows anyone to freely improve upon it.
The goals of the AROS project is it to create an OS which:
1. Is as compatible as possible with AmigaOS 3.1.
2. Can be ported to different kinds of hardware architectures and processors, such as x86, PowerPC, Alpha, Sparc, HPPA and other.
3. Should be binary compatible on Amiga and source compatible on any other hardware.
4. Can run as a standalone version which boots directly from hard disk and as an emulation which opens a window on an existing OS to develop software and run Amiga and native applications at the same time.
5. Improves upon the functionality of AmigaOS.
To reach this goal, we use a number of techniques. First of all, we make heavy use of the Internet. You can participate in our project even if you can write only one single OS function. The most current version of the source is accessible 24 hours per day and patches can be merged into it at any time. A small database with open tasks makes sure work is not duplicated.
Some time back in the year 1993, the situation for the Amiga looked somewhat worse than usual and some Amiga fans got together and discussed what should be done to increase the acceptance of our beloved machine. Immediately the main reason for the missing success of the Amiga became clear: it was propagation, or rather the lack thereof. The Amiga should get a more widespread basis to make it more attractive for everyone to use and to develop for. So plans were made to reach this goal. One of the plans was to fix the bugs of the AmigaOS, another was to make it an modern operating system. The AOS project was born.
But exactly what was a bug? And how should the bugs be fixed? What are the features a so-called modern OS must have? And how should they be implemented into the AmigaOS?
Two years later, people were still arguing about this and not even one line of code had been written (or at least no one had ever seen that code). Discussions were still of the pattern where someone stated that "we must have ..." and someone answered "read the old mails" or "this is impossible to do, because ..." which was shortly followed by "youre wrong because ..." and so on.
In the winter of 1995, Aaron Digulla got fed up with this situation and posted an RFC (request for comments) to the AOS mailing list in which I asked what the minimal common ground might be. Several options were given and the conclusion was that almost everyone would like to see an open OS which is compatible to AmigaOS 3.1 (kickstart 40.68) on which further discussions could be based upon to see what is possible and what is not.
So the work began and AROS was born.
<<lessAROS Max is a pre-configured live bootable CD image, made to show off the best that AROS has to offer. It requires an AROS capable PC, your mileage may vary.
If you require help getting AROS-Max to run please ask for help on the Max area at the AROS-Exec messageboard, please do not email us directly with support problems!
AROS is a portable and free desktop operating system aiming at being compatible with AmigaOS 3.1, while improving on it in many areas. The source code is available under an open source license, which allows anyone to freely improve upon it.
The goals of the AROS project is it to create an OS which:
1. Is as compatible as possible with AmigaOS 3.1.
2. Can be ported to different kinds of hardware architectures and processors, such as x86, PowerPC, Alpha, Sparc, HPPA and other.
3. Should be binary compatible on Amiga and source compatible on any other hardware.
4. Can run as a standalone version which boots directly from hard disk and as an emulation which opens a window on an existing OS to develop software and run Amiga and native applications at the same time.
5. Improves upon the functionality of AmigaOS.
To reach this goal, we use a number of techniques. First of all, we make heavy use of the Internet. You can participate in our project even if you can write only one single OS function. The most current version of the source is accessible 24 hours per day and patches can be merged into it at any time. A small database with open tasks makes sure work is not duplicated.
Some time back in the year 1993, the situation for the Amiga looked somewhat worse than usual and some Amiga fans got together and discussed what should be done to increase the acceptance of our beloved machine. Immediately the main reason for the missing success of the Amiga became clear: it was propagation, or rather the lack thereof. The Amiga should get a more widespread basis to make it more attractive for everyone to use and to develop for. So plans were made to reach this goal. One of the plans was to fix the bugs of the AmigaOS, another was to make it an modern operating system. The AOS project was born.
But exactly what was a bug? And how should the bugs be fixed? What are the features a so-called modern OS must have? And how should they be implemented into the AmigaOS?
Two years later, people were still arguing about this and not even one line of code had been written (or at least no one had ever seen that code). Discussions were still of the pattern where someone stated that "we must have ..." and someone answered "read the old mails" or "this is impossible to do, because ..." which was shortly followed by "youre wrong because ..." and so on.
In the winter of 1995, Aaron Digulla got fed up with this situation and posted an RFC (request for comments) to the AOS mailing list in which I asked what the minimal common ground might be. Several options were given and the conclusion was that almost everyone would like to see an open OS which is compatible to AmigaOS 3.1 (kickstart 40.68) on which further discussions could be based upon to see what is possible and what is not.
So the work began and AROS was born.
Download (MB)
Added: 2005-12-17 License: Freeware Price:
1422 downloads
PyWork 0.4.8
PyWork is a high performance Python Web framework. more>>
PyWork is a high performance Python Web framework.
The author has been developing web applications for years. In this journey several tools and well known languages where used before meeting Python. I am not going to explain all the great things Python does and gives, but in these advantages, this new (yet another) web framework is based. The idea is to permit the separation of the view code from the application or controller code.
It does so by defining some basic rules for HTTP request processing. When using PyWork you configure mappings between the uris and python objects (which will extend the Action class). When a request enters PyWork, an action method is called that executes the application code and returns a view identifier to be displayed. This very simple idea brings a lot of power to your app by making it more reusable, less buggy and with very little code.
Also by letting your python objects be called by the web server, it lets you use all the python libraries and packages available (DB, Image Processing, Report generation, XML technologies and so on). Your action classes also will be unit-testable as they dont need to live in a running server to be executed. This is great because it will permit you to code your tests and integrate them in your web application development process. They also are standard python code that you can distribute as a standard python package.
More advantages, being your classes standard objects it will let you use the standard debugging api (PDB) to easily debug your application code. With all these and the main ingredient Python, web applications lead to easy maintainance, higher portability and faster development.
In the next sections we will explain: Installation and Configuration; A proper explanation of an HTTP request lifecycle is explained, it then introduces a *very* simple application, followed by more formal explanations of Action and Views. The other chapters explain PyWorks api stack.
<<lessThe author has been developing web applications for years. In this journey several tools and well known languages where used before meeting Python. I am not going to explain all the great things Python does and gives, but in these advantages, this new (yet another) web framework is based. The idea is to permit the separation of the view code from the application or controller code.
It does so by defining some basic rules for HTTP request processing. When using PyWork you configure mappings between the uris and python objects (which will extend the Action class). When a request enters PyWork, an action method is called that executes the application code and returns a view identifier to be displayed. This very simple idea brings a lot of power to your app by making it more reusable, less buggy and with very little code.
Also by letting your python objects be called by the web server, it lets you use all the python libraries and packages available (DB, Image Processing, Report generation, XML technologies and so on). Your action classes also will be unit-testable as they dont need to live in a running server to be executed. This is great because it will permit you to code your tests and integrate them in your web application development process. They also are standard python code that you can distribute as a standard python package.
More advantages, being your classes standard objects it will let you use the standard debugging api (PDB) to easily debug your application code. With all these and the main ingredient Python, web applications lead to easy maintainance, higher portability and faster development.
In the next sections we will explain: Installation and Configuration; A proper explanation of an HTTP request lifecycle is explained, it then introduces a *very* simple application, followed by more formal explanations of Action and Views. The other chapters explain PyWorks api stack.
Download (0.26MB)
Added: 2006-06-21 License: Freeware Price:
1221 downloads
Tar2RubyScript 0.4.8
Tar2RubyScript transforms a directory tree, containing your application, into one single Ruby script. more>>
Tar2RubyScript transforms a directory tree, containing your application, into one single Ruby script, along with some code to handle this archive. Tar2RubyScript can be distributed to our friends. When theyve installed Ruby, they just have to double click on it and your application is up and running!
So, its a way of executing your application, not of installing it. You might think of it as the Ruby version of Javas JAR... Lets call it an RBA (Ruby Archive).
"Its Rubys JAR..."
Like packing related application files into one RBA application, you could as well pack related library files into one RBA library. Now you dont need to install the compound library in the traditional way before using it. Just require the RBA.
Because the RBA is pure Ruby and no other programs or libraries are needed, its easy to distribute it to friends. They dont have to install anything but Ruby itself.
Unlike the JAR-people, we dont need a new extension for RBAs. A JAR isnt a Java Class, it contains a Java class; an RBA both is and contains a Ruby script. Its also easier to change the format of an RBA in the future, because the algorithm to handle the RBA comes with it at a cost in bytes of less then 10K.
Another difference between the two is the entry point: JAR does something with a manifest; RBA just loads init.rb . And, well, they compress, we dont.
If you like Tar2RubyScript, you might want to read Distributing Ruby Applications. Its about how I build, pack and distribute my Ruby applications. Theory and practice.
Enhancements:
- This release fixes a bug concerning looping symlinks and a bug concerning too many open files.
- It adds support for hard links and symbolic links (not on Windows).
<<lessSo, its a way of executing your application, not of installing it. You might think of it as the Ruby version of Javas JAR... Lets call it an RBA (Ruby Archive).
"Its Rubys JAR..."
Like packing related application files into one RBA application, you could as well pack related library files into one RBA library. Now you dont need to install the compound library in the traditional way before using it. Just require the RBA.
Because the RBA is pure Ruby and no other programs or libraries are needed, its easy to distribute it to friends. They dont have to install anything but Ruby itself.
Unlike the JAR-people, we dont need a new extension for RBAs. A JAR isnt a Java Class, it contains a Java class; an RBA both is and contains a Ruby script. Its also easier to change the format of an RBA in the future, because the algorithm to handle the RBA comes with it at a cost in bytes of less then 10K.
Another difference between the two is the entry point: JAR does something with a manifest; RBA just loads init.rb . And, well, they compress, we dont.
If you like Tar2RubyScript, you might want to read Distributing Ruby Applications. Its about how I build, pack and distribute my Ruby applications. Theory and practice.
Enhancements:
- This release fixes a bug concerning looping symlinks and a bug concerning too many open files.
- It adds support for hard links and symbolic links (not on Windows).
Download (0.24MB)
Added: 2006-08-10 License: GPL (GNU General Public License) Price:
1171 downloads
AI::DecisionTree 0.08
AI::DecisionTree is Perl module for automatically Learns Decision Trees. more>>
AI::DecisionTree is Perl module for automatically Learns Decision Trees.
SYNOPSIS
use AI::DecisionTree;
my $dtree = new AI::DecisionTree;
# A set of training data for deciding whether to play tennis
$dtree->add_instance
(attributes => {outlook => sunny,
temperature => hot,
humidity => high},
result => no);
$dtree->add_instance
(attributes => {outlook => overcast,
temperature => hot,
humidity => normal},
result => yes);
... repeat for several more instances, then:
$dtree->train;
# Find results for unseen instances
my $result = $dtree->get_result
(attributes => {outlook => sunny,
temperature => hot,
humidity => normal});
The AI::DecisionTree module automatically creates so-called "decision trees" to explain a set of training data. A decision tree is a kind of categorizer that use a flowchart-like process for categorizing new instances. For instance, a learned decision tree might look like the following, which classifies for the concept "play tennis":
OUTLOOK
/ |
/ |
/ |
sunny/ overcast rainy
/ |
HUMIDITY | WIND
/ *no* /
/ /
high/ normal /
/ strong/ weak
*no* *yes* /
*no* *yes*
(This example, and the inspiration for the AI::DecisionTree module, come directly from Tom Mitchells excellent book "Machine Learning", available from McGraw Hill.)
A decision tree like this one can be learned from training data, and then applied to previously unseen data to obtain results that are consistent with the training data.
The usual goal of a decision tree is to somehow encapsulate the training data in the smallest possible tree. This is motivated by an "Occams Razor" philosophy, in which the simplest possible explanation for a set of phenomena should be preferred over other explanations. Also, small trees will make decisions faster than large trees, and they are much easier for a human to look at and understand. One of the biggest reasons for using a decision tree instead of many other machine learning techniques is that a decision tree is a much more scrutable decision maker than, say, a neural network.
The current implementation of this module uses an extremely simple method for creating the decision tree based on the training instances. It uses an Information Gain metric (based on expected reduction in entropy) to select the "most informative" attribute at each node in the tree. This is essentially the ID3 algorithm, developed by J. R. Quinlan in 1986. The idea is that the attribute with the highest Information Gain will (probably) be the best attribute to split the tree on at each point if were interested in making small trees.
<<lessSYNOPSIS
use AI::DecisionTree;
my $dtree = new AI::DecisionTree;
# A set of training data for deciding whether to play tennis
$dtree->add_instance
(attributes => {outlook => sunny,
temperature => hot,
humidity => high},
result => no);
$dtree->add_instance
(attributes => {outlook => overcast,
temperature => hot,
humidity => normal},
result => yes);
... repeat for several more instances, then:
$dtree->train;
# Find results for unseen instances
my $result = $dtree->get_result
(attributes => {outlook => sunny,
temperature => hot,
humidity => normal});
The AI::DecisionTree module automatically creates so-called "decision trees" to explain a set of training data. A decision tree is a kind of categorizer that use a flowchart-like process for categorizing new instances. For instance, a learned decision tree might look like the following, which classifies for the concept "play tennis":
OUTLOOK
/ |
/ |
/ |
sunny/ overcast rainy
/ |
HUMIDITY | WIND
/ *no* /
/ /
high/ normal /
/ strong/ weak
*no* *yes* /
*no* *yes*
(This example, and the inspiration for the AI::DecisionTree module, come directly from Tom Mitchells excellent book "Machine Learning", available from McGraw Hill.)
A decision tree like this one can be learned from training data, and then applied to previously unseen data to obtain results that are consistent with the training data.
The usual goal of a decision tree is to somehow encapsulate the training data in the smallest possible tree. This is motivated by an "Occams Razor" philosophy, in which the simplest possible explanation for a set of phenomena should be preferred over other explanations. Also, small trees will make decisions faster than large trees, and they are much easier for a human to look at and understand. One of the biggest reasons for using a decision tree instead of many other machine learning techniques is that a decision tree is a much more scrutable decision maker than, say, a neural network.
The current implementation of this module uses an extremely simple method for creating the decision tree based on the training instances. It uses an Information Gain metric (based on expected reduction in entropy) to select the "most informative" attribute at each node in the tree. This is essentially the ID3 algorithm, developed by J. R. Quinlan in 1986. The idea is that the attribute with the highest Information Gain will (probably) be the best attribute to split the tree on at each point if were interested in making small trees.
Download (0.025MB)
Added: 2006-10-12 License: Perl Artistic License Price:
1111 downloads
Secleted [ 0 ] software to compare
- Page: 1 of 2
- 1
- 2
Copyright Notice:
Software piracy is theft, Using crack, password, serial numbers, registration codes, key generators is illegal and prevent future software development. The above tennis 0.4.8 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
