The Java Algebra System (JAS) is an object oriented, type safe, multi-threaded approach to computer algebra. JAS provides a well designed software library using generic types for algebraic computations implemented in the Java programming language. The library can be used as any other Java software package, or it can be used interactively or interpreted through a Jython or JRuby front end. The focus at the moment is on commutative and solvable polynomials, power-series, multivariate polynomial factorization, Gröbner bases, and applications.
GluCat is a library of template classes that model the universal Clifford algebras over the field of real numbers, with arbitrary dimension and arbitrary signature. It implements a model of each Clifford algebra corresponding to each non-degenerate quadratic form up to a maximum set by the user. GluCat classes are designed to be used as template parameters for other template libraries. GluCat includes the PyClical extension module for Python. This implements the Python classes index_set and clifford, which interface to corresponding C++ classes in GluCat.
The Java Penrose Empires Package allows you to compute the empires (forced tiles) for an arbitrary initial patch of tiles. Tilings may be saved for later, and may be exported to PDF, EPS, or PNG. This software represents a new method of computing forced tiles. Rather than using a "growth" approach (where some tiles are randomly forced), this system only shows the forced tiles in the system, leaving all unforced areas blank.
Blitz++ library moves high-level optimizations out of compilers and into libraries in C++. It was created due to the fact that until recently, C++ lagged behind Fortran's performance by anywhere from 20% to a factor of ten. The C++ programming language offers many features useful for tackling complex scientific computing problems, but unfortunately, these advanced features came with this hefty performance pricetag. This program presents a possible solution.
DSP implements several low-level digital signal processing (DSP) primitives accelerated, when available, by the Intel/AMD SIMD instruction sets MMX/SSE/SSE2. Portable C versions are provided for compatibility on non-IA32 machines. Routines are provided to compute 16-bit integer dot products (FIR filtering, correlation); sum-of-squares (signal energy measurement), and peak sample detection (for automatic gain control, etc.).
FFTW is a fast C FFT library. It includes complex, real, symmetric, multidimensional, and parallel transforms, and can handle arbitrary array sizes efficiently.It is typically faster than other freely available FFT implementations, and is even competitive with vendor-tuned libraries (benchmarks are available at the homepage). To achieve this performance, it uses novel code generation and runtime self optimization techniques (along with many other tricks).
DEVS has been developed for over a year to serve as an experimental framework for natural systems modeling techniques. It enables discrete event, general purpose, object oriented, component based, GIS connected, and collaborative visual simulation model development and execution. The sample model implementation shows that this experimental environment can be used for solving any complex problems solvable by discrete-event simulation, but it is especially suited for natural system simulation. Currently only hierarchical block and cellular models are modeled and simulated, but a multi-layered modeling paradigm for spatially distributed systems (with vector and cellular models) will eventually be implemented in the environment.