intermediate
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 113
HTMLatex 1.3
HTMLatex does on-the-fly rendering of LaTeX source to HTML documents. more>>
HTMLatex is a mod_python application that uses memcached to reduce the massive overhead of repeatedly rendering the same equation. It has an option to sanitize the latex source removing any potentially dangerous code. Currently it is only tested on Apache 2 + mod_python with python 2.3 and py-memcached-1.2. It is fairly generous about the HTML and latex it accepts.
Im unsure if this will work on Windows as I paid zero attention to interoperability.
HTMLatex has two main goals: first, I wanted to avoid preprocessing; I wanted to be able to type the raw latex into an HTML document and be finished. Second, I wanted the HTML/Latex file to remain untouched.
There is one option: DEBUG. If DEBUG is set, the intermediate files are maintained on disk in /tmp/htmlatex -- this is the only method available for helping to troubleshoot latex errors. Oddly enough, performance should theoretically *increase* if debug mode is on as it doesnt require repeated filesystem access to delete files.
There used to be another option: SANITIZE, which checked the latex source for dangerous code and replaces it with a sanitized graphic. I decidd that giving people the option to auto-render latex code over the web that could do arbitrary things to their PC was a bad idea.
All latex code is sanitized now. If you want to turn it off, just comment out all of the _sanitize() calls in Equation._translateToTex().
Enhancements:
- Internet Explorer users can now see the rendered equations.
- Memcached is no longer used. Instead, images are served from the filesystem.
<<lessIm unsure if this will work on Windows as I paid zero attention to interoperability.
HTMLatex has two main goals: first, I wanted to avoid preprocessing; I wanted to be able to type the raw latex into an HTML document and be finished. Second, I wanted the HTML/Latex file to remain untouched.
There is one option: DEBUG. If DEBUG is set, the intermediate files are maintained on disk in /tmp/htmlatex -- this is the only method available for helping to troubleshoot latex errors. Oddly enough, performance should theoretically *increase* if debug mode is on as it doesnt require repeated filesystem access to delete files.
There used to be another option: SANITIZE, which checked the latex source for dangerous code and replaces it with a sanitized graphic. I decidd that giving people the option to auto-render latex code over the web that could do arbitrary things to their PC was a bad idea.
All latex code is sanitized now. If you want to turn it off, just comment out all of the _sanitize() calls in Equation._translateToTex().
Enhancements:
- Internet Explorer users can now see the rendered equations.
- Memcached is no longer used. Instead, images are served from the filesystem.
Download (0.038MB)
Added: 2006-04-17 License: GPL (GNU General Public License) Price:
1286 downloads
Lightfeather 0.5.5
Lightfeather is a 3D engine for Linux, Mac OS X and Windows. more>>
Lightfeather is a 3D engine for Linux, Mac OS X and Windows. Lightfeather project is designed to be easy to use but still take advantage of the features of modern graphics hardware.
The zlib/libpng license under which it is distributed allows you to use it for any purpose whatsoever including commercial projects without the need to redistribute your changes in any form or even mentioning that you use it (although that would be nice, of course).
To use Lightfeather you need to be proficient in c++ programming (a python binding is in the works at the moment so you might be able to use Lightfeather with python in the future). It is geared towards intermediate to professional programmers and not towards beginners.
Before you start working with Lightfeather you should AT LEAST read the Modelconverter and the Renderpasses information in the documentation submenu.
If you want to help with Lightfeathers development, there are lots of possibilities to do so. You could, for example, submit patches, contribute models for the test and example applications or write tutorials. If you want to work on the engine but dont know where to start look into the todo/request list. Help in any form is always very welcome.
Enhancements:
- It is now possible to render the same scene through different cameras into multiple windows.
- A filesystem handler interface has been added, which allows the use of a database or an FTP server like a normal filesystem.
- Resources can be grouped for easier handling.
- Users can integrate their own data into the engines lfm file format.
- Many more changes were made and lots of bugs were fixed.
<<lessThe zlib/libpng license under which it is distributed allows you to use it for any purpose whatsoever including commercial projects without the need to redistribute your changes in any form or even mentioning that you use it (although that would be nice, of course).
To use Lightfeather you need to be proficient in c++ programming (a python binding is in the works at the moment so you might be able to use Lightfeather with python in the future). It is geared towards intermediate to professional programmers and not towards beginners.
Before you start working with Lightfeather you should AT LEAST read the Modelconverter and the Renderpasses information in the documentation submenu.
If you want to help with Lightfeathers development, there are lots of possibilities to do so. You could, for example, submit patches, contribute models for the test and example applications or write tutorials. If you want to work on the engine but dont know where to start look into the todo/request list. Help in any form is always very welcome.
Enhancements:
- It is now possible to render the same scene through different cameras into multiple windows.
- A filesystem handler interface has been added, which allows the use of a database or an FTP server like a normal filesystem.
- Resources can be grouped for easier handling.
- Users can integrate their own data into the engines lfm file format.
- Many more changes were made and lots of bugs were fixed.
Download (24MB)
Added: 2007-08-12 License: zlib/libpng License Price:
805 downloads
linSmith 0.99.3
linSmith is a Smith Charting program, mainly designed for educational use. more>>
linSmith project is a Smith Charting program, mainly designed for educational use.
linSmith is a Smith Charting program, mainly designed for educational use. As such, there is an emphasis on capabilities that improve the showing the effect of-style of operation.
Main features:
- Definition of multiple load impedances (at different frequencies)
- Addition of discrete (L, C, series and parallel LC, and transformer) and line components (open and closed stubs, and line segments)
- Connection in series and parallel
- Easy experimenting with component values using scrollbars
- A virtual component switches from impedance to admittance to help explaining (or understanding) parallel components
- The chart works in real impedances (not normalized ones)
- Direct view of the result on the screen
- Ability to generate publication quality Postscript output
- A log file with textual results at each intermediate step
- Load and circuit configuration is stored separately, permitting several solutions without re-defining the other.
<<lesslinSmith is a Smith Charting program, mainly designed for educational use. As such, there is an emphasis on capabilities that improve the showing the effect of-style of operation.
Main features:
- Definition of multiple load impedances (at different frequencies)
- Addition of discrete (L, C, series and parallel LC, and transformer) and line components (open and closed stubs, and line segments)
- Connection in series and parallel
- Easy experimenting with component values using scrollbars
- A virtual component switches from impedance to admittance to help explaining (or understanding) parallel components
- The chart works in real impedances (not normalized ones)
- Direct view of the result on the screen
- Ability to generate publication quality Postscript output
- A log file with textual results at each intermediate step
- Load and circuit configuration is stored separately, permitting several solutions without re-defining the other.
Download (0.94MB)
Added: 2006-11-24 License: GPL (GNU General Public License) Price:
1067 downloads
eCromedos 1.0.1
eCromedos is a document preparation system that allows concurrent publication of documents in print and web. more>>
eCromedos is a document preparation system that allows concurrent publication of documents in print and web.
Documents are written in an XML-conforming markup language and converted to HTML or printable document formats by means of a special software.
eCromedoss defines document formats for a range of document classes, which are formally layed down in a set of Document Type Definitions (DTD). The mapping of raw documents to representational formats is done via XSL-transformations.
The eCromedos Document Processor (EDP) is a modified XSL-transformer with a plugins-based architecture, through which it offers enhanced functionality which could not be realised with XSL-transformations alone. The most salient feature is the possibility to have listings in various programming languages syntactically highlighted during transformation.
For production of printable documents, the EDP generates LATEX as an intermediate format, which can be further processed into high-quality PostScript and PDF by use of the TEX typesetting system. All that is needed is a functional TEX-installation. The user does not need any previous knowledge about TEX or LATEX.
Enhancements:
- This release contains a number of major bugfixes and a couple of minor corrections and additions to the documentation.
- Users of version 1.0.0 are encouraged to upgrade.
<<lessDocuments are written in an XML-conforming markup language and converted to HTML or printable document formats by means of a special software.
eCromedoss defines document formats for a range of document classes, which are formally layed down in a set of Document Type Definitions (DTD). The mapping of raw documents to representational formats is done via XSL-transformations.
The eCromedos Document Processor (EDP) is a modified XSL-transformer with a plugins-based architecture, through which it offers enhanced functionality which could not be realised with XSL-transformations alone. The most salient feature is the possibility to have listings in various programming languages syntactically highlighted during transformation.
For production of printable documents, the EDP generates LATEX as an intermediate format, which can be further processed into high-quality PostScript and PDF by use of the TEX typesetting system. All that is needed is a functional TEX-installation. The user does not need any previous knowledge about TEX or LATEX.
Enhancements:
- This release contains a number of major bugfixes and a couple of minor corrections and additions to the documentation.
- Users of version 1.0.0 are encouraged to upgrade.
Download (0.36MB)
Added: 2006-04-25 License: GPL (GNU General Public License) Price:
1277 downloads
Designer Framework 1.0
Designer Framework provides a highly customizable e-commerce framework. more>>
Designer Framework provides a highly customizable e-commerce framework.
It automatically builds e-commerce interfaces that support a products contraints and properties and can be used to model the product to be sold, automatically and dynamically generating different output formats depending on the generator used.
It includes a Java modelling application, a finite state machine described in XML as intermediate format for the customer interface, and XSLT scripts for transforming the state machine into the final interface.Designer Framework is a highly customizable e-commerce framework.
It automatically builds e-commerce interfaces that support a products contraints and properties and can be used to model the product to be sold, automatically and dynamically generating different output formats depending on the generator used.
It includes a Java modelling application, a finite state machine described in XML as intermediate format for the customer interface, and XSLT scripts for transforming the state machine into the final interface.
<<lessIt automatically builds e-commerce interfaces that support a products contraints and properties and can be used to model the product to be sold, automatically and dynamically generating different output formats depending on the generator used.
It includes a Java modelling application, a finite state machine described in XML as intermediate format for the customer interface, and XSLT scripts for transforming the state machine into the final interface.Designer Framework is a highly customizable e-commerce framework.
It automatically builds e-commerce interfaces that support a products contraints and properties and can be used to model the product to be sold, automatically and dynamically generating different output formats depending on the generator used.
It includes a Java modelling application, a finite state machine described in XML as intermediate format for the customer interface, and XSLT scripts for transforming the state machine into the final interface.
Download (MB)
Added: 2007-02-16 License: GPL (GNU General Public License) Price:
983 downloads
Perl x86 Disassembler 0.16
Perl x86 Disassembler is an Intel x86 disassembler written in Perl. more>>
The libdisasm library provides basic disassembly of Intel x86 instructions from a binary stream. The intent is to provide an easy to use disassembler which can be called from any application; the disassembly can be produced in AT&T syntax and Intel syntax, as well as in an intermediate format which includes detailed instruction and operand type information.
This disassembler is derived from libi386.so in the bastard project; as such it is x86 specific and will not be expanded to include other CPU architectures. Releases for libdisasm are generated automatically alongside releases of the bastard; it is not a standalone project, though it is a standalone library.
The recent spate of objdump output analyzers has proven that many of the people [not necessarily programmers] interested in writing disassemblers have little knowledge of, or interest in, C programming; as a result, these "disassemblers" have been written in Perl.
Usage
The basic usage of the library is:
1. initialize the library, using disassemble_init()
2. disassemble stuff, using disassemble_address()
3. un-initialize the library, using disassemble_cleanup
These routines have the following prototypes:
int disassemble_init(int options, int format);
int disassemble_cleanup(void);
int disassemble_address(char *buf, int buf_len, struct instr *i);
Instructions are disassembled to an intermediate format:
struct instr {
char mnemonic[16];
char dest[32];
char src[32];
char aux[32];
int mnemType; /* type of instruction */
int destType; /* type of dest operand */
int srcType; /* type of source operand */
int auxType; /* type of 3rd operand */
int size; /* size of insn in bytes */
};
The sprint_address() can be used in place of the disassemble_address() routine in order to generate a string representation instead of an intermediate one:
int sprint_address(char *str, int len, char *buf, int buf_len);
...so that a simple disassembler can be implemented in C with the following code:
#include
char buf[BUF_SIZE]; /* buffer of bytes to disassemble */
char line[LINE_SIZE]; /* buffer of line to print */
int pos = 0; /* current position in buffer */
int size; /* size of instruction */
disassemble_init(0, INTEL_SYNTAX);
while ( pos > BUF_SIZE ) {
/* disassemble address to buffer */
size = sprint_address(buf + pos, BUF_SIZE - pos, line, LINE_SIZE);
if (size) {
/* print instruction */
printf("%08X: %sn", pos, line);
pos += size;
} else {
printf("%08X: Invalid instructionn");
pos++;
}
}
disassemble_cleanup();
Alternatively, one can print the address manually using the intermediate format:
#include
char buf[BUF_SIZE]; /* buffer of bytes to disassemble */
int pos = 0; /* current position in buffer */
int size; /* size of instruction */
struct instr i; /* representation of the code instruction */
disassemble_init(0, INTEL_SYNTAX);
while ( pos > BUF_SIZE ) {
disassemble_address(buf + pos, BUF_SIZE - pos, &i);
if (size) {
/* print address and mnemonic */
printf("%08X: %s", pos, i.mnemonic);
/* print operands */
if ( i.destType ) {
printf("t%s", i.dest);
if ( i.srcType ) {
printf(", %s", i.src);
if ( i.auxType ) {
printf(", %s", i.aux);
}
}
}
printf("n");
pos += size;
} else {
/* invalid/unrecognized instruction */
pos++;
}
}
disassemble_cleanup();
This is the recommended usage of libdisasm: the instruction type and operand type fields allow analyzing of the disassembled instruction, and can provide cues for xref generation, syntax hi-lighting, and control flow tracking.
<<lessThis disassembler is derived from libi386.so in the bastard project; as such it is x86 specific and will not be expanded to include other CPU architectures. Releases for libdisasm are generated automatically alongside releases of the bastard; it is not a standalone project, though it is a standalone library.
The recent spate of objdump output analyzers has proven that many of the people [not necessarily programmers] interested in writing disassemblers have little knowledge of, or interest in, C programming; as a result, these "disassemblers" have been written in Perl.
Usage
The basic usage of the library is:
1. initialize the library, using disassemble_init()
2. disassemble stuff, using disassemble_address()
3. un-initialize the library, using disassemble_cleanup
These routines have the following prototypes:
int disassemble_init(int options, int format);
int disassemble_cleanup(void);
int disassemble_address(char *buf, int buf_len, struct instr *i);
Instructions are disassembled to an intermediate format:
struct instr {
char mnemonic[16];
char dest[32];
char src[32];
char aux[32];
int mnemType; /* type of instruction */
int destType; /* type of dest operand */
int srcType; /* type of source operand */
int auxType; /* type of 3rd operand */
int size; /* size of insn in bytes */
};
The sprint_address() can be used in place of the disassemble_address() routine in order to generate a string representation instead of an intermediate one:
int sprint_address(char *str, int len, char *buf, int buf_len);
...so that a simple disassembler can be implemented in C with the following code:
#include
char buf[BUF_SIZE]; /* buffer of bytes to disassemble */
char line[LINE_SIZE]; /* buffer of line to print */
int pos = 0; /* current position in buffer */
int size; /* size of instruction */
disassemble_init(0, INTEL_SYNTAX);
while ( pos > BUF_SIZE ) {
/* disassemble address to buffer */
size = sprint_address(buf + pos, BUF_SIZE - pos, line, LINE_SIZE);
if (size) {
/* print instruction */
printf("%08X: %sn", pos, line);
pos += size;
} else {
printf("%08X: Invalid instructionn");
pos++;
}
}
disassemble_cleanup();
Alternatively, one can print the address manually using the intermediate format:
#include
char buf[BUF_SIZE]; /* buffer of bytes to disassemble */
int pos = 0; /* current position in buffer */
int size; /* size of instruction */
struct instr i; /* representation of the code instruction */
disassemble_init(0, INTEL_SYNTAX);
while ( pos > BUF_SIZE ) {
disassemble_address(buf + pos, BUF_SIZE - pos, &i);
if (size) {
/* print address and mnemonic */
printf("%08X: %s", pos, i.mnemonic);
/* print operands */
if ( i.destType ) {
printf("t%s", i.dest);
if ( i.srcType ) {
printf(", %s", i.src);
if ( i.auxType ) {
printf(", %s", i.aux);
}
}
}
printf("n");
pos += size;
} else {
/* invalid/unrecognized instruction */
pos++;
}
}
disassemble_cleanup();
This is the recommended usage of libdisasm: the instruction type and operand type fields allow analyzing of the disassembled instruction, and can provide cues for xref generation, syntax hi-lighting, and control flow tracking.
Download (0.038MB)
Added: 2005-03-07 License: Artistic License Price:
1701 downloads
CodeInvaders Challenge 3.1
CodeInvaders Challenge project is a Java-based, real-time programming game based on the Eclipse platform. more>>
CodeInvaders Challenge project is a Java-based, real-time programming game based on the Eclipse platform.
CodeInvaders Challenge is a Java™-based, real-time programming game based on the Eclipse platform. It uses the Eclipse platform and a simple API that allows users unfamiliar with Java to easily compete while they learn the language.
CodeInvaders Challenge gives users the opportunity to pit their Java programming skills against other players in a battle of space conquest. Each player writes a Java class that represents and controls a spaceship. Each ship (class) is placed in a simulated battle along with ships from other players.
The game puts up to six spaceships together in a match and places each of them in a random location with the same amount of energy. The spaceship class allows each player to control his ships thrusters and weapons. The ship can move around to collect energy, attack opponents, and bring energy back to its home planet. Points are awarded for different actions, and the player with the most points wins.
When used in a tournament, CodeInvaders Challenge allows direct, real-time competition between teams. Each player can submit his intermediate solutions and test against the submitted ships from other players. This competition allows each player to learn from the strategies of other players and modify his ship appropriately. After the final submission from each player, the final winner can be found by running a tournament consisting of several rounds and eliminations.
<<lessCodeInvaders Challenge is a Java™-based, real-time programming game based on the Eclipse platform. It uses the Eclipse platform and a simple API that allows users unfamiliar with Java to easily compete while they learn the language.
CodeInvaders Challenge gives users the opportunity to pit their Java programming skills against other players in a battle of space conquest. Each player writes a Java class that represents and controls a spaceship. Each ship (class) is placed in a simulated battle along with ships from other players.
The game puts up to six spaceships together in a match and places each of them in a random location with the same amount of energy. The spaceship class allows each player to control his ships thrusters and weapons. The ship can move around to collect energy, attack opponents, and bring energy back to its home planet. Points are awarded for different actions, and the player with the most points wins.
When used in a tournament, CodeInvaders Challenge allows direct, real-time competition between teams. Each player can submit his intermediate solutions and test against the submitted ships from other players. This competition allows each player to learn from the strategies of other players and modify his ship appropriately. After the final submission from each player, the final winner can be found by running a tournament consisting of several rounds and eliminations.
Download (MB)
Added: 2006-11-28 License: Other/Proprietary License Price:
1060 downloads
PHP Running Management 1.0.2
PHP Running Management or phpRunMan is a set of scripts for runners. more>>
PHP Running Management or phpRunMan is a set of scripts for runners. Users can enter intermediate times of their training or race performance for calculating various statistics (distance, avg speed, time/km, projection on different distance, etc.). In PHP Running Management you can enter comments for the whole run or every intermediate segment so the data can be used as a logbook.
Every run (training or competition) is entered as a list of segments and times. You can specify the number of laps and the "offset" (manual correction) of the distance.
Several views are proposed:
- Year view: displays all the runs with their distance, time, average speed, etc.
- Detail view: shows the profile of a run by segment (time, speed, cumulated distance and other indicators).
- Month view: aggregates runs per month over the selected year, shows every months distance, time, average speed.
All the scripts are written in PHP (requires GD lib activated too) and the data is stored in MySQL database.
<<lessEvery run (training or competition) is entered as a list of segments and times. You can specify the number of laps and the "offset" (manual correction) of the distance.
Several views are proposed:
- Year view: displays all the runs with their distance, time, average speed, etc.
- Detail view: shows the profile of a run by segment (time, speed, cumulated distance and other indicators).
- Month view: aggregates runs per month over the selected year, shows every months distance, time, average speed.
All the scripts are written in PHP (requires GD lib activated too) and the data is stored in MySQL database.
Download (0.49MB)
Added: 2006-06-26 License: GPL (GNU General Public License) Price:
1215 downloads
PerlPoint::Parser 0.45
PerlPoint::Parser Perl module is a PerlPoint Parser. more>>
PerlPoint::Parser Perl module is a PerlPoint Parser.
SYNOPSIS
# load the module:
use PerlPoint::Parser;
# build the parser and run it
# to get intermediate data in @stream
my ($parser)=new PerlPoint::Parser;
$parser->run(
stream => @stream,
files => @files,
);
The PerlPoint format, initially designed by Tom Christiansen, is intended to provide a simple and portable way to generate slides without the need of a proprietary product. Slides can be prepared in a text editor of your choice, generated on any platform where you find perl, and presented by any browser which can render the chosen output format.
To sum it up, PerlPoint Software takes an ASCII text and transforms it into slides written in a certain document description language. This is, by tradition, usually HTML, but you may decide to use another format like XML, SGML, TeX or whatever you want.
Well, this sounds fine, but how to build a translator which transforms ASCII into the output format of your choice? Thats what PerlPoint::Parser is made for. It performs the first translation step by parsing ASCII and transforming it into an intermediate stream format, which can be processed by a subsequently called translator backend. By separating parsing and output generation we get the flexibility to write as many backends as necessary by using the same parser frontend for all translators.
PerlPoint::Parser supports the complete GRAMMAR with exception of certain tags. Tags are supported the most common way: the parser recognizes any tag which is declared by the author of a translator. This way the parser can be used for various flavours of the PerlPoint language without having to be modified. So, if there is a need of a certain new flag, it can quickly be added without any change to PerlPoint::Parser.
The following chapters describe the input format (GRAMMAR) and the generated stream format (STREAM FORMAT). Finally, the class methods are described to show you how to build a parser.
<<lessSYNOPSIS
# load the module:
use PerlPoint::Parser;
# build the parser and run it
# to get intermediate data in @stream
my ($parser)=new PerlPoint::Parser;
$parser->run(
stream => @stream,
files => @files,
);
The PerlPoint format, initially designed by Tom Christiansen, is intended to provide a simple and portable way to generate slides without the need of a proprietary product. Slides can be prepared in a text editor of your choice, generated on any platform where you find perl, and presented by any browser which can render the chosen output format.
To sum it up, PerlPoint Software takes an ASCII text and transforms it into slides written in a certain document description language. This is, by tradition, usually HTML, but you may decide to use another format like XML, SGML, TeX or whatever you want.
Well, this sounds fine, but how to build a translator which transforms ASCII into the output format of your choice? Thats what PerlPoint::Parser is made for. It performs the first translation step by parsing ASCII and transforming it into an intermediate stream format, which can be processed by a subsequently called translator backend. By separating parsing and output generation we get the flexibility to write as many backends as necessary by using the same parser frontend for all translators.
PerlPoint::Parser supports the complete GRAMMAR with exception of certain tags. Tags are supported the most common way: the parser recognizes any tag which is declared by the author of a translator. This way the parser can be used for various flavours of the PerlPoint language without having to be modified. So, if there is a need of a certain new flag, it can quickly be added without any change to PerlPoint::Parser.
The following chapters describe the input format (GRAMMAR) and the generated stream format (STREAM FORMAT). Finally, the class methods are described to show you how to build a parser.
Download (0.41MB)
Added: 2007-02-12 License: Perl Artistic License Price:
985 downloads
LPI 101 study guide 2.0
Linux Holdings Linux study guide. more>>
This study guide from Linux Holdings will help you to train for the Linux LPI 101 exam.
Linux Holdings is a linux and Open Source training company, training Linux Administration as the core focus.
These are not the only Open Source courses we offer, but the most popular.
Training info
Linux Holdings offer a full spectrum of Linux and open source courses. These start from basic low-level courses to the very advanced administration courses.
All our administration courses are based on the international LPI certification. Our trainers are the best available in South Africa. They are not just excellent Linux administrators with many years experience; they are also the best trainers in the industry. Good administrators are not necessarily good trainers; we give you the best of both sides.
Our entry-level and intermediate courses include the ICDL for OpenOffice.org. We have a full marketing and development department constantly developing and updating courses. Linux Holdings invests huge amounts of time and resources in development, testing and research to give the best training available today.
Our quality department ensures that all students are trained to the highest standard possible. It is also the quality departments duty to ensure that students start with the right course so the learning gradient is not to high or to low. Speak to us so that we can suggest the proper courses for your IT experience.
<<lessLinux Holdings is a linux and Open Source training company, training Linux Administration as the core focus.
These are not the only Open Source courses we offer, but the most popular.
Training info
Linux Holdings offer a full spectrum of Linux and open source courses. These start from basic low-level courses to the very advanced administration courses.
All our administration courses are based on the international LPI certification. Our trainers are the best available in South Africa. They are not just excellent Linux administrators with many years experience; they are also the best trainers in the industry. Good administrators are not necessarily good trainers; we give you the best of both sides.
Our entry-level and intermediate courses include the ICDL for OpenOffice.org. We have a full marketing and development department constantly developing and updating courses. Linux Holdings invests huge amounts of time and resources in development, testing and research to give the best training available today.
Our quality department ensures that all students are trained to the highest standard possible. It is also the quality departments duty to ensure that students start with the right course so the learning gradient is not to high or to low. Speak to us so that we can suggest the proper courses for your IT experience.
Download (MB)
Added: 2007-01-30 License: (FDL) GNU Free Documentation License Price:
1025 downloads
Algorithm::Line::Bresenham 0.11
Algorithm::Line::Bresenham is a Perl module that contains a simple pixellated line-drawing algorithm. more>>
Algorithm::Line::Bresenham is a Perl module that contains a simple pixellated line-drawing algorithm.
SYNOPSIS
use Algorithm::Line::Bresenham qw/line/;
my @points = line(3,3 => 5,0);
# returns the list: [3,3], [4,2], [4,1], [5,0]
line(3,3 => 5,0, &draw_line);
# calls draw_line on each point in turn
Bresenham is one of the canonical line drawing algorithms for pixellated grids. Given a start and an end-point, Bresenham calculates which points on the grid need to be filled to generate the line between them.
Googling for Bresenham, and line drawing algorithms gives some good overview. The code here takes its starting point from Mark Feldmans Pascal code in his article Bresenhams Line and Circle Algorithms at http://www.gamedev.net/reference/articles/article767.asp.
FUNCTIONS
line
line ($from_y, $from_x => $to_y, $to_x);
Generates a list of all the intermediate points. This is returned as a list of array references.
line ($from_y, $from_x => $to_y, $to_x, &callback);
Calls the referenced function on each point in turn. The callback could be used to actually draw the point. Returns the collated return values from the callback.
circle
my @points = circle ($y, $x, $radius)
Returns the points to draw a circle with
<<lessSYNOPSIS
use Algorithm::Line::Bresenham qw/line/;
my @points = line(3,3 => 5,0);
# returns the list: [3,3], [4,2], [4,1], [5,0]
line(3,3 => 5,0, &draw_line);
# calls draw_line on each point in turn
Bresenham is one of the canonical line drawing algorithms for pixellated grids. Given a start and an end-point, Bresenham calculates which points on the grid need to be filled to generate the line between them.
Googling for Bresenham, and line drawing algorithms gives some good overview. The code here takes its starting point from Mark Feldmans Pascal code in his article Bresenhams Line and Circle Algorithms at http://www.gamedev.net/reference/articles/article767.asp.
FUNCTIONS
line
line ($from_y, $from_x => $to_y, $to_x);
Generates a list of all the intermediate points. This is returned as a list of array references.
line ($from_y, $from_x => $to_y, $to_x, &callback);
Calls the referenced function on each point in turn. The callback could be used to actually draw the point. Returns the collated return values from the callback.
circle
my @points = circle ($y, $x, $radius)
Returns the points to draw a circle with
Download (0.003MB)
Added: 2007-05-16 License: Perl Artistic License Price:
901 downloads
RAVE 1.9.9
RAVE (Retrospective Analysis and Visualization Engine) is a framework for generating complex analysis products. more>>
RAVE 1.9.9 is yet another excellent utility for everyone. RAVE stands for Retrospective Analysis and Visualization Engine which is a framework for generating complex analysis products.
RAVE caches the intermediate results of analytic tasks for later use in the same or different analyses. This improves performance by reducing duplicated effort when generating analytic results. RAVE users need to do nothing special in order to take advantage of this performance improvement.
The RAVE project provides tools to use RAVE interactively in a terminal, or to publish "live" RAVE analyses online as a network service for use in network-enabled applications.
CERT/NetSA has deployed RAVE to support analysis using the SiLK suite of flow analysis tools. They also distribute the libraries created to perform common flow analysis tasks using SiLK, such as efficiently using pipe-and-filter-based command-line tools from Python, dealing with heterogeneous data sources and efficiently retrieving time-series data.
Requirements:
- Python 2.4 or higher
Added: 2008-04-09 License: GPL Price: FREE
13 downloads
SigInt 1.0
SigInt project is a command-line software tool that can be used to find and rank mammalian proteins/genes. more>>
SigInt project is a command-line software tool that can be used to find and rank mammalian proteins/genes that specifically and significantly interact with a list of proteins/genes in context of a background mammalian signalome and interactome networks.
The inputs to the program are: (a) a seed list of human Entrez Gene gene symbols, (b) a background networks in SIG format, and (c) a name for the output file (web-page file name with the htm extension). SigInt outputs a sorted list of genes/proteins that interacts with components from the seed list. These components are sorted by a z-score that measures the specificity of these intermediate components to interact with the genes/proteins from the seed list.
SigInt can be run on Linux, Mac and Windows operating systems and it requires a background network text file in SIG format.
Usage:
Extract the archive
chmod +x sigint_lnx.exe
./sigint_lnx.exe
<<lessThe inputs to the program are: (a) a seed list of human Entrez Gene gene symbols, (b) a background networks in SIG format, and (c) a name for the output file (web-page file name with the htm extension). SigInt outputs a sorted list of genes/proteins that interacts with components from the seed list. These components are sorted by a z-score that measures the specificity of these intermediate components to interact with the genes/proteins from the seed list.
SigInt can be run on Linux, Mac and Windows operating systems and it requires a background network text file in SIG format.
Usage:
Extract the archive
chmod +x sigint_lnx.exe
./sigint_lnx.exe
Download (0.34MB)
Added: 2007-02-15 License: Freeware Price:
993 downloads
MyBook World Edition Packages 0.0
MyBook World Edition Packages project collection provides pre-compiled packages for hacking Western Digital MyBook World Edition more>>
MyBook World Edition Packages project collection provides pre-compiled packages for hacking Western Digital MyBook World Edition, to improve performance and add new features.
At least intermediate Linux experience is required for playing with MyBook. Please, if you do not meet this requirement, ask someone experienced to help you. Otherwise there is a risk that you will brick your MyBook!
<<lessAt least intermediate Linux experience is required for playing with MyBook. Please, if you do not meet this requirement, ask someone experienced to help you. Otherwise there is a risk that you will brick your MyBook!
Download (MB)
Added: 2007-07-11 License: GPL (GNU General Public License) Price:
865 downloads
DBSchema::Normalizer 0.08
DBSchema::Normalizer is a database normalization. more>>
DBSchema::Normalizer is a database normalization. It can convert a table from 1st to 2nd normal form.
SYNOPSIS
# the easy way is to give all parameters to the constructor
# and then call do()
#
use DBSchema::Normalizer;
my $norm = DBSchema::Normalizer->new (
{
DSN => $DSN,
username => $username,
password => $password,
src_table => $sourcetable,
index_field => $indexfield,
lookup_fields => $lookupfields, # comma separated list
lookup_table => $lookuptable,
dest_table => $dest_table,
copy_indexes => "yes",
});
$norm->do(); # Just Do It!
# Alternatively, you can have some more control, by
# creating the lookup table and normalized table separately,
# especially useful if one of them is an intermediate step.
#
use DBSchema::Normalizer qw(create_lookup_table create_normalized_table);
my $norm = DBSchema::Normalizer->new(
{
DSN => $DSN,
username => $username,
password => $password
});
$norm->create_lookup_table (
{
src_table => $tablename,
index_field => $indexfield,
lookup_fields => $lookupfields,
lookup_table => $lookuptable
});
$norm->create_normalized_table (
{
src_table => $tablename,
index_field => $indexfield,
lookup_fields => $lookupfields,
lookup_table => $lookuptable,
dest_table => $dest_table,
copy_indexes => "yes",
});
DBSchema::Normalizer is a module to help transforming MySQL database tables from 1st to 2nd normal form. Simply put, it will create a lookup table out of a set of repeating fields from a source table, and replace such fields by a foreign key that points to the corresponding fields in the newly created table.
All information is taken from the database itself. There is no need to specify existing details. The module is capable of re-creating existing indexes, and should deal with complex cases where the replaced fields are part of a primary key.
<<lessSYNOPSIS
# the easy way is to give all parameters to the constructor
# and then call do()
#
use DBSchema::Normalizer;
my $norm = DBSchema::Normalizer->new (
{
DSN => $DSN,
username => $username,
password => $password,
src_table => $sourcetable,
index_field => $indexfield,
lookup_fields => $lookupfields, # comma separated list
lookup_table => $lookuptable,
dest_table => $dest_table,
copy_indexes => "yes",
});
$norm->do(); # Just Do It!
# Alternatively, you can have some more control, by
# creating the lookup table and normalized table separately,
# especially useful if one of them is an intermediate step.
#
use DBSchema::Normalizer qw(create_lookup_table create_normalized_table);
my $norm = DBSchema::Normalizer->new(
{
DSN => $DSN,
username => $username,
password => $password
});
$norm->create_lookup_table (
{
src_table => $tablename,
index_field => $indexfield,
lookup_fields => $lookupfields,
lookup_table => $lookuptable
});
$norm->create_normalized_table (
{
src_table => $tablename,
index_field => $indexfield,
lookup_fields => $lookupfields,
lookup_table => $lookuptable,
dest_table => $dest_table,
copy_indexes => "yes",
});
DBSchema::Normalizer is a module to help transforming MySQL database tables from 1st to 2nd normal form. Simply put, it will create a lookup table out of a set of repeating fields from a source table, and replace such fields by a foreign key that points to the corresponding fields in the newly created table.
All information is taken from the database itself. There is no need to specify existing details. The module is capable of re-creating existing indexes, and should deal with complex cases where the replaced fields are part of a primary key.
Download (0.033MB)
Added: 2006-11-09 License: Perl Artistic License Price:
1081 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 intermediate 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