154 projects tagged "Windows"
Updated 02 Nov 2004
Cactus
| Pop | 127.00 |
|---|---|
| Vit | 3.52 |
Cactus is a general, modular, parallel environment for solving systems of partial differential equations. The code has been developed over many years by a large international collaboration of numerical relativity and computational science research groups and can be used to provide a portable platform for solving any system of partial differential equations.
Updated 07 Jul 2010
GNU CLISP
| Pop | 384.84 |
|---|---|
| Vit | 12.82 |
GNU CLISP is an ANSI Common Lisp implementation with an interpreter, compiler, debugger, object system (CLOS, MOP), sockets, fast bignums, arbitrary precision floats, and a foreign language interface that runs on most Unix variants and Win32.
Updated 21 Aug 2001
crank
| Pop | 117.65 |
|---|---|
| Vit | 2.90 |
Crank is a project to provide a GUI toolkit to facilitate (and where possible, automate) the breaking of classical (pen-and-paper) cryptosystems. Initial focus is on the cryptanalysis of monoalphabetic substitution ciphers.
Updated 30 Jan 2001
distributed.net clients
| Pop | 45.79 |
|---|---|
| Vit | 1.80 |
distributed.net is a loosely knit group of computer users from all of the world that is taking up challenges requiring lots of computing power (most notably the RC5, DES, and OGR cracking contests). It is simple to participate in the challenges by downloading and running their client software (which uses idle CPU time to complete its tasks).
Updated 08 Jan 2012
GLE (Graphics Layout Engine)
| Pop | 243.88 |
|---|---|
| Vit | 10.63 |
GLE (Graphics Layout Engine) is a graphics scripting language designed for creating publication quality figures (e.g., a chart, plot, graph, or diagram). GLE supports various chart types (including function plot, histogram, bar chart, scatter plot, contour plot, color map, and surface plot) through a simple but flexible set of graphing commands. More complex output can be created by relying on GLE's scripting language, which is full featured with subroutines, variables, and logic control. GLE relies on LaTeX for text output and supports mathematical formulae in graphs and figures.
Updated 17 Sep 2012
Groups, Algorithms, and Programming
| Pop | 92.52 |
|---|---|
| Vit | 8.41 |
Groups, Algorithms, and Programming (GAP) is a system for computational discrete algebra with particular emphasis on computational group theory and related areas. It provides a Pascal-like interpreted language, data types for many algebraic objects, a function library, and large libraries of data.
Updated 31 Oct 2001
ixlib
| Pop | 48.35 |
|---|---|
| Vit | 2.57 |
ixlib is a C++ tools library based upon the STL. It provides garbage collection, a small well-integratable JavaScript interpreter, linear algebra components (e.g., linear solver, LU decomposition), planar geometry, polygons, automatic arrays, rasterization for geometric primitives and polygons, regular expressions and XML parsing (non-DTD). Its main design goals were simplicity and small size.
Updated 04 Jul 2004
KSEG
| Pop | 69.71 |
|---|---|
| Vit | 3.47 |
KSEG is a program for exploring Euclidean geometry, similar to Geometer's Sketchpad. It features points, lines, transformations, measurements, calculations, simple editable recursive Constructions (similar to macros), adaptively sampled loci, and selection groups. Several languages are supported. KSEG is very fast, stable, and has an efficient and consistent UI. It uses Qt and does not require KDE.
Updated 23 Aug 2001
L Math Processor
| Pop | 36.33 |
|---|---|
| Vit | 4.13 |
The L math processor (lmp) implements many basic primitives for mathematical solution of equations and terms just like the FSF tool expr. But further, lmp handles floating point numbers and knows some more operations.
Updated 03 Dec 2002
LinAl
| Pop | 55.32 |
|---|---|
| Vit | 1.54 |
LinAl was designed to bring together C++ and FORTRAN. At the same time LinAl is supposed to be easy to use, fast, and reasonably safe. The LinAl library is based on STL techniques and uses STL containers for the storage of matrix data and STL algorithms where feasible. Low level, algebraic operators, linear solvers, and eigenvalue solvers are implemented, based on calls to BLAS, LAPACK, and CGSOLX.
