intermediate algebra
Sponsored Links
Sponsored Links
Secleted [ 0 ] software to compare
Results 1 - 15 of about 174
ATGeogebra 1.0
ATGeogebra provides a simple archetype product to display GeoGebra files. more>>
ATGeogebra provides a simple archetype product to display GeoGebra files.
GeoGebra is a free and multi-platform dynamic mathematics software for schools that joins geometry, algebra and calculus .
If you have any interest in educational technology, you should take a look at this fine piece of software: http://www.geogebra.org
The basic idea of ATGeogebra is to be able to show Geogebra worksheet files ( .ggb ) within a plone site.
The .ggb files have to be loaded with Geogebras java applet and the product does that for you.
The software jar files are inside the product’s skins directory and all you have to do is to create a "Geogebra Activity" item and upload the .ggb file.
You will find a sample Geogebra worksheet ( .ggb ) inside the product’s samples directory ( same as shown in the screenshot above ).
If you use CMFContentPanels, a special viewlet will be installed.
This is a initial release. Its very simple, but fully functional.
<<lessGeoGebra is a free and multi-platform dynamic mathematics software for schools that joins geometry, algebra and calculus .
If you have any interest in educational technology, you should take a look at this fine piece of software: http://www.geogebra.org
The basic idea of ATGeogebra is to be able to show Geogebra worksheet files ( .ggb ) within a plone site.
The .ggb files have to be loaded with Geogebras java applet and the product does that for you.
The software jar files are inside the product’s skins directory and all you have to do is to create a "Geogebra Activity" item and upload the .ggb file.
You will find a sample Geogebra worksheet ( .ggb ) inside the product’s samples directory ( same as shown in the screenshot above ).
If you use CMFContentPanels, a special viewlet will be installed.
This is a initial release. Its very simple, but fully functional.
Download (1.0MB)
Added: 2007-04-14 License: GPL (GNU General Public License) Price:
923 downloads
Genezzo::Plan::MakeAlgebra 0.63
Genezzo::Plan::MakeAlgebra is a Perl module that can convert a SQL parse tree to relational algebra. more>>
Genezzo::Plan::MakeAlgebra is a Perl module that can convert a SQL parse tree to relational algebra.
SYNOPSIS
use Genezzo::Plan::MakeAlgebra;
This module converts a SQL parse tree into a set of relational algebra operations.
<<lessSYNOPSIS
use Genezzo::Plan::MakeAlgebra;
This module converts a SQL parse tree into a set of relational algebra operations.
Download (0.45MB)
Added: 2006-08-16 License: Perl Artistic License Price:
1165 downloads
Math::Algebra::Symbols 1.21
Math::Algebra::Symbols is a Symbolic Algebra in Pure Perl. more>>
Math::Algebra::Symbols is a Symbolic Algebra in Pure Perl.
SYNOPSIS
Example symbols.pl
#!perl -w -I..
use Math::Algebra::Symbols hyper=>1;
use Test::Simple tests=>5;
($n, $x, $y) = symbols(qw(n x y));
$a += ($x**8 - 1)/($x-1);
$b += sin($x)**2 + cos($x)**2;
$c += (sin($n*$x) + cos($n*$x))->d->d->d->d / (sin($n*$x)+cos($n*$x));
$d = tanh($x+$y) == (tanh($x)+tanh($y))/(1+tanh($x)*tanh($y));
($e,$f) = @{($x**2 eq 5*$x-6) > $x};
print "$an$bn$cn$dn$e,$fn";
ok("$a" eq $x+$x**2+$x**3+$x**4+$x**5+$x**6+$x**7+1);
ok("$b" eq 1);
ok("$c" eq $n**4);
ok("$d" eq 1);
ok("$e,$f" eq 2,3);
<<lessSYNOPSIS
Example symbols.pl
#!perl -w -I..
use Math::Algebra::Symbols hyper=>1;
use Test::Simple tests=>5;
($n, $x, $y) = symbols(qw(n x y));
$a += ($x**8 - 1)/($x-1);
$b += sin($x)**2 + cos($x)**2;
$c += (sin($n*$x) + cos($n*$x))->d->d->d->d / (sin($n*$x)+cos($n*$x));
$d = tanh($x+$y) == (tanh($x)+tanh($y))/(1+tanh($x)*tanh($y));
($e,$f) = @{($x**2 eq 5*$x-6) > $x};
print "$an$bn$cn$dn$e,$fn";
ok("$a" eq $x+$x**2+$x**3+$x**4+$x**5+$x**6+$x**7+1);
ok("$b" eq 1);
ok("$c" eq $n**4);
ok("$d" eq 1);
ok("$e,$f" eq 2,3);
Download (0.10MB)
Added: 2007-06-29 License: Perl Artistic License Price:
849 downloads
PDL::LinearAlgebra::Complex 0.03
PDL::LinearAlgebra::Complex is a PDL interface to the lapack linear algebra programming library (complex number). more>>
PDL::LinearAlgebra::Complex is a PDL interface to the lapack linear algebra programming library (complex number).
SYNOPSIS
use PDL::Complex
use PDL::LinearAlgebra::Complex;
$a = r2C random (100,100);
$s = r2C zeroes(100);
$u = r2C zeroes(100,100);
$v = r2C zeroes(100,100);
$info = 0;
$job = 0;
cgesdd($a, $job, $info, $s , $u, $v);
This module provide an interface to parts of the lapack library (complex number). These routine accept either float or double piddles.
EOD
pp_defc("gesvd", HandleBad => 0, RedoDimsCode => $SIZE(r) = $PDL(A)->ndims > 2 ? min($PDL(A)->dims[1], $PDL(A)->dims[2]) : 1;, Pars => [io,phys]A(2,m,n); int jobu(); int jobvt(); [o,phys]s(r); [o,phys]U(2,p,q); [o,phys]VT(2,s,t); int [o,phys]info(), GenericTypes => [F,D], Code => generate_code
integer lwork;
char trau, travt;
types(F) %{
extern int cgesvd_(char *jobu, char *jobvt, integer *m, integer *n, float *a,
integer *lda, float *s, float *u, int *ldu,
float *vt, integer *ldvt, float *work, integer *lwork, float *rwork,
integer *info);
float *rwork;
float tmp_work[2];
%}
types(D) %{
extern int zgesvd_(char *jobz,char *jobvt, integer *m, integer *n,
double *a, integer *lda, double *s, double *u, int *ldu,
double *vt, integer *ldvt, double *work, integer *lwork, double *rwork,
integer *info);
double *rwork;
double tmp_work[2];
%}
lwork = ($PRIV(__m_size) < $PRIV(__n_size)) ? 5*$PRIV(__m_size) : 5*$PRIV(__n_size);
types(F) %{
rwork = (float *)malloc(lwork * sizeof(float));
%}
types(D) %{
rwork = (double *)malloc(lwork * sizeof(double));
%}
lwork = -1;
switch ($jobu())
{
case 1: trau = A;
break;
case 2: trau = S;
break;
case 3: trau = O;
break;
default: trau = N;
}
switch ($jobvt())
{
case 1: travt = A;
break;
case 2: travt = S;
break;
case 3: travt = O;
break;
default: travt = N;
}
$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
&tmp_work[0],
&lwork,
rwork,
$P(info));
lwork = (integer )tmp_work[0];
{
types(F) %{
float *work = (float *)malloc(2*lwork * sizeof(float));
%}
types(D) %{
double *work = (double *)malloc(2*lwork * sizeof(double));
%}
$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
work,
&lwork,
rwork,
$P(info));
free(work);
}
free(rwork);
,
Doc=>
<<lessSYNOPSIS
use PDL::Complex
use PDL::LinearAlgebra::Complex;
$a = r2C random (100,100);
$s = r2C zeroes(100);
$u = r2C zeroes(100,100);
$v = r2C zeroes(100,100);
$info = 0;
$job = 0;
cgesdd($a, $job, $info, $s , $u, $v);
This module provide an interface to parts of the lapack library (complex number). These routine accept either float or double piddles.
EOD
pp_defc("gesvd", HandleBad => 0, RedoDimsCode => $SIZE(r) = $PDL(A)->ndims > 2 ? min($PDL(A)->dims[1], $PDL(A)->dims[2]) : 1;, Pars => [io,phys]A(2,m,n); int jobu(); int jobvt(); [o,phys]s(r); [o,phys]U(2,p,q); [o,phys]VT(2,s,t); int [o,phys]info(), GenericTypes => [F,D], Code => generate_code
integer lwork;
char trau, travt;
types(F) %{
extern int cgesvd_(char *jobu, char *jobvt, integer *m, integer *n, float *a,
integer *lda, float *s, float *u, int *ldu,
float *vt, integer *ldvt, float *work, integer *lwork, float *rwork,
integer *info);
float *rwork;
float tmp_work[2];
%}
types(D) %{
extern int zgesvd_(char *jobz,char *jobvt, integer *m, integer *n,
double *a, integer *lda, double *s, double *u, int *ldu,
double *vt, integer *ldvt, double *work, integer *lwork, double *rwork,
integer *info);
double *rwork;
double tmp_work[2];
%}
lwork = ($PRIV(__m_size) < $PRIV(__n_size)) ? 5*$PRIV(__m_size) : 5*$PRIV(__n_size);
types(F) %{
rwork = (float *)malloc(lwork * sizeof(float));
%}
types(D) %{
rwork = (double *)malloc(lwork * sizeof(double));
%}
lwork = -1;
switch ($jobu())
{
case 1: trau = A;
break;
case 2: trau = S;
break;
case 3: trau = O;
break;
default: trau = N;
}
switch ($jobvt())
{
case 1: travt = A;
break;
case 2: travt = S;
break;
case 3: travt = O;
break;
default: travt = N;
}
$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
&tmp_work[0],
&lwork,
rwork,
$P(info));
lwork = (integer )tmp_work[0];
{
types(F) %{
float *work = (float *)malloc(2*lwork * sizeof(float));
%}
types(D) %{
double *work = (double *)malloc(2*lwork * sizeof(double));
%}
$TFD(cgesvd_,zgesvd_)(
&trau,
&travt,
&$PRIV(__m_size),
&$PRIV(__n_size),
$P(A),
&$PRIV(__m_size),
$P(s),
$P(U),
&$PRIV(__p_size),
$P(VT),
&$PRIV(__s_size),
work,
&lwork,
rwork,
$P(info));
free(work);
}
free(rwork);
,
Doc=>
Download (0.12MB)
Added: 2007-06-27 License: Perl Artistic License Price:
849 downloads
Meta Matrix Library 0.7.2
Meta Matrix Library is a modular designed collection of C libraries. more>>
Meta Matrix Library is a modular designed collection of C libraries. Meta Matrix Library was developed as part of the Free Finite Element Package to provide easy and consistent access to numerical linear algebra software for sparse and dense matrices.
The dense matrix and vector operations of the package are based on LAPACK and BLAS (focused upon ATLAS). For more details of LAPACK and BLAS see Related Links. Beyond this MEML supports UMFPACK ( SuperLU projected ) as solver for linear systems of equations with sparse matrices.
<<lessThe dense matrix and vector operations of the package are based on LAPACK and BLAS (focused upon ATLAS). For more details of LAPACK and BLAS see Related Links. Beyond this MEML supports UMFPACK ( SuperLU projected ) as solver for linear systems of equations with sparse matrices.
Download (0.45MB)
Added: 2006-05-21 License: BSD License Price:
1256 downloads
Math::Symbolic::MiscAlgebra 0.508
Math::Symbolic::MiscAlgebra contains miscellaneous algebra routines like det(). more>>
Math::Symbolic::MiscAlgebra contains miscellaneous algebra routines like det().
SYNOPSIS
use Math::Symbolic qw/:all/;
use Math::Symbolic::MiscAlgebra qw/:all/; # not loaded by Math::Symbolic
@matrix = ([x*y, z*x, y*z],[x, z, z],[x, x, y]);
$det = det @matrix;
@vector = (x, y, z);
$solution = solve_linear(@matrix, @vector);
This module provides several subroutines related to algebra such as computing the determinant of quadratic matrices, solving linear equation systems and computation of Bell Polynomials.
Please note that the code herein may or may not be refactored into the OO-interface of the Math::Symbolic module in the future.
You may choose to have any of the following routines exported to the calling namespace. :all tag exports all of the following:
det
linear_solve
bell_polynomial
<<lessSYNOPSIS
use Math::Symbolic qw/:all/;
use Math::Symbolic::MiscAlgebra qw/:all/; # not loaded by Math::Symbolic
@matrix = ([x*y, z*x, y*z],[x, z, z],[x, x, y]);
$det = det @matrix;
@vector = (x, y, z);
$solution = solve_linear(@matrix, @vector);
This module provides several subroutines related to algebra such as computing the determinant of quadratic matrices, solving linear equation systems and computation of Bell Polynomials.
Please note that the code herein may or may not be refactored into the OO-interface of the Math::Symbolic module in the future.
You may choose to have any of the following routines exported to the calling namespace. :all tag exports all of the following:
det
linear_solve
bell_polynomial
Download (0.10MB)
Added: 2007-08-09 License: Perl Artistic License Price:
806 downloads
GeoGebra 2.6b
GeoGebra project is a dynamic mathematics software that joins geometry, algebra, and calculus. more>>
GeoGebra project is a dynamic mathematics software that joins geometry, algebra, and calculus.
Two views are characteristic of GeoGebra: an expression in the algebra window corresponds to an object in the geometry window and vice versa
<<lessTwo views are characteristic of GeoGebra: an expression in the algebra window corresponds to an object in the geometry window and vice versa
Download (MB)
Added: 2006-10-23 License: GPL (GNU General Public License) Price:
1432 downloads
Template Numerical Toolkit 1.26
Template Numerical Toolkit (TNT) is a collection of interfaces and reference implementations of numerical objects. more>>
Template Numerical Toolkit (TNT) is a collection of interfaces and reference implementations of numerical objects useful for scientific computing in C++.
The toolkit defines interfaces for basic data structures, such as multidimensional arrays and sparse matrices, commonly used in numerical applications. Template Numerical Toolkits goal is to provide reusable software components that address many of the portability and maintennace problems with C++ codes.
TNT provides a distinction between interfaces and implementations of TNT components. For example, there is a TNT interface for two-dimensional arrays which describes how individual elements are accessed and how certain information, such as the array dimensions, can be used in algorithms; however, there can be several implementations of such an interface: one that uses expression templates, or one that uses BLAS kernels, or another that is instrumented to provide debugging information.
By specifying only the interface, applications codes may utilize such algorithms, while giving library developers the greatest flexibility in employing optimization or portability strategies.
TNT Data Structures
- C-style arrays
- Fortran-style arrays
- Sparse Matrices
- Vector/Matrix
TNT utilities
- array I/O
- math routines (hypot(), sign(), etc.)
- Stopwatch class for timing measurements
Libraries that utilize TNT
- JAMA: a linear algebra library with QR, SVD, Cholesky and Eigenvector solvers.
- old (pre 1.0) TNT routines for LU, QR, and Eigenvalue problems
<<lessThe toolkit defines interfaces for basic data structures, such as multidimensional arrays and sparse matrices, commonly used in numerical applications. Template Numerical Toolkits goal is to provide reusable software components that address many of the portability and maintennace problems with C++ codes.
TNT provides a distinction between interfaces and implementations of TNT components. For example, there is a TNT interface for two-dimensional arrays which describes how individual elements are accessed and how certain information, such as the array dimensions, can be used in algorithms; however, there can be several implementations of such an interface: one that uses expression templates, or one that uses BLAS kernels, or another that is instrumented to provide debugging information.
By specifying only the interface, applications codes may utilize such algorithms, while giving library developers the greatest flexibility in employing optimization or portability strategies.
TNT Data Structures
- C-style arrays
- Fortran-style arrays
- Sparse Matrices
- Vector/Matrix
TNT utilities
- array I/O
- math routines (hypot(), sign(), etc.)
- Stopwatch class for timing measurements
Libraries that utilize TNT
- JAMA: a linear algebra library with QR, SVD, Cholesky and Eigenvector solvers.
- old (pre 1.0) TNT routines for LU, QR, and Eigenvalue problems
Download (0.028MB)
Added: 2006-03-30 License: Public Domain Price:
1308 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
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
Convert::CharMap 0.01
Convert::CharMap is a Perl module that can conversion between Unicode Character Maps. more>>
Convert::CharMap is a Perl module that can conversion between Unicode Character Maps.
SYNOPSIS
use Convert::CharMap;
my $map = Convert::CharMap->load(CharMapML => test.xml);
$map->save(UCM => test.ucm);
This module transforms between unicode character map formats, using an in-memory representation of CharMapML as the intermediate format.
Currently is supports the CharMapML, YAML and UCM (write-only) backends; ENC, Iconv and other maps are also planned.
<<lessSYNOPSIS
use Convert::CharMap;
my $map = Convert::CharMap->load(CharMapML => test.xml);
$map->save(UCM => test.ucm);
This module transforms between unicode character map formats, using an in-memory representation of CharMapML as the intermediate format.
Currently is supports the CharMapML, YAML and UCM (write-only) backends; ENC, Iconv and other maps are also planned.
Download (0.004MB)
Added: 2006-08-18 License: Perl Artistic License Price:
1164 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
CoinXtension 0.2
CoinXtension is a small extension for the programmer-friendly graphics framework Coin 3D. more>>
CoinXtension offers some additional operators for existing data types of Coin 3D; but more important it extends the linear algebra capabilities of the original framework, by adding the new data type C3Xt_matrix3d, that offers such usefull routines as for eigenvalue or QR-decomposition.
CoinXtension library only depends on Coin 3d and libstdc++, thus it should work on all plattforms on which Coin 3D is available, altough it was developed and tested only on Linux/x86.
This is the first release and the software is still alpha, so dont expect it to be exactly the same in some days or weeks, nor that it works the way you imagined!
Furthermore the development of the library is not really a directed process, but i integrate new features as i come accross things in projects that might usefull in future ones too.
Enhancements:
- Support for Euler angles and many bugfixes.
<<lessCoinXtension library only depends on Coin 3d and libstdc++, thus it should work on all plattforms on which Coin 3D is available, altough it was developed and tested only on Linux/x86.
This is the first release and the software is still alpha, so dont expect it to be exactly the same in some days or weeks, nor that it works the way you imagined!
Furthermore the development of the library is not really a directed process, but i integrate new features as i come accross things in projects that might usefull in future ones too.
Enhancements:
- Support for Euler angles and many bugfixes.
Download (0.022MB)
Added: 2006-10-12 License: BSD License Price:
1107 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
jscl-meditor 2.3
jscl-meditor is a java symbolic computing library and mathematical editor. more>>
jscl-meditor is a java symbolic computing library and mathematical editor.
Main features:
- polynomial system solving
- vectors and matrices
- factorization
- derivatives
- integrals (rational functions)
- boolean algebra
- simplification
- MathML output
- Java code generation
- geometric algebra
Regarding readability, the goal is to produce a code as nice and short as the pseudo-code found in textbooks or research papers. As an illustration, here is what the Euclidean algorithm would look like:
Polynomial gcd(Polynomial p, Polynomial q) {
while(q.signum()!=0) {
Polynomial r=p.remainder(q);
p=q;
q=r;
}
return p;
}
It entails a dedicated development effort. This choice of clear coding, enabled by java, may have consequences in terms of performance compared to other software. But it could be worth the commitment, in the respect that understanding an algorithm just by looking at the code is made possible. For instance, object-orientation allows to hide ugly optimizations behind a clean, easy to use interface.
Some may doubt however that java will ever be as clear as C++ because it doesnt provide operator overloading, which means that a+b is written a.add(b), and will remain as such. The interested reader can look at the ongoing discussion on the matter at Sun.
As for portability, it means that a lot of platforms are available at no cost, from powerful unix workstations or servers to handheld devices. To make it possible, the project is split in two parts : the engine (jscl) and the mathematical editor front-end (meditor). The engine is usable interactively or in batch mode from a java shell interpreter (like BeanShell for instance), or as a java library in any third-party application.
The front-end has currently two implementations (see below). Among others, it is intended for taking course notes. With it, a student can perform the calculations asked by their teacher fast and reliably. The plain text format should make the exchange of notes easy. The produced worksheets can be published on-line thanks to the MathML output feature, for instance on meditorworld (MathML capable browser needed, tested to work with Mozilla).
<<lessMain features:
- polynomial system solving
- vectors and matrices
- factorization
- derivatives
- integrals (rational functions)
- boolean algebra
- simplification
- MathML output
- Java code generation
- geometric algebra
Regarding readability, the goal is to produce a code as nice and short as the pseudo-code found in textbooks or research papers. As an illustration, here is what the Euclidean algorithm would look like:
Polynomial gcd(Polynomial p, Polynomial q) {
while(q.signum()!=0) {
Polynomial r=p.remainder(q);
p=q;
q=r;
}
return p;
}
It entails a dedicated development effort. This choice of clear coding, enabled by java, may have consequences in terms of performance compared to other software. But it could be worth the commitment, in the respect that understanding an algorithm just by looking at the code is made possible. For instance, object-orientation allows to hide ugly optimizations behind a clean, easy to use interface.
Some may doubt however that java will ever be as clear as C++ because it doesnt provide operator overloading, which means that a+b is written a.add(b), and will remain as such. The interested reader can look at the ongoing discussion on the matter at Sun.
As for portability, it means that a lot of platforms are available at no cost, from powerful unix workstations or servers to handheld devices. To make it possible, the project is split in two parts : the engine (jscl) and the mathematical editor front-end (meditor). The engine is usable interactively or in batch mode from a java shell interpreter (like BeanShell for instance), or as a java library in any third-party application.
The front-end has currently two implementations (see below). Among others, it is intended for taking course notes. With it, a student can perform the calculations asked by their teacher fast and reliably. The plain text format should make the exchange of notes easy. The produced worksheets can be published on-line thanks to the MathML output feature, for instance on meditorworld (MathML capable browser needed, tested to work with Mozilla).
Download (1.8MB)
Added: 2007-08-06 License: LGPL (GNU Lesser General Public License) Price:
812 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 algebra 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