Calc is arbitrary precision arithmetic system that uses a C-like language. It's useful as a calculator, an algorithm prototype, and as a mathematical research tool. More importantly, calc provides a machine-independent means of computation. Calc comes with a rich set of builtin mathematical and programmatic functions.
Fimex is a the File Interpolation, Manipulation, and EXtraction library for gridded geospatial data. It converts between different, extensible data formats (currently netcdf, NcML, grib1/2, metgm, wdb, and felt). It enables you to change the projection and interpolation of scalar and vector grids. It makes it possible to subset the gridded data and to extract only parts of the files. For simple usage, Fimex also comes with the command line program fimex.
Racket (formerly PLT Scheme) is a programming language suitable for implementation tasks ranging from scripting to application development, including GUIs, Web services, etc. It includes the DrRacket programming environment, a virtual machine with a just-in-time compiler, tools for creating stand-alone executables, the Racket Web server, extensive libraries, documentation for both beginners and experts, and more. It supports the creation of new programming languages through a rich, expressive syntax system. Example languages include Typed Racket, ACL2, FrTime, and Lazy Racket.
Mapyrus is software for creating plots of points, lines, polygons, and labels in PostScript, PDF, SVG, and Web image output formats. It combines the following three components: A Logo or turtle graphics language, reading of GIS datasets and RDBMS tables, and running as a stand-alone program, as a Java Servlet, or as a self-contained Web server.
DOLFIN is the C++ interface of the FEniCS project for the Automation of Computational Mathematical Modeling (ACMM), providing a consistent PSE (Problem Solving Environment) for solving ordinary and partial differential equations. Key features include a simple, consistent and intuitive object-oriented API; automatic and efficient evaluation of variational forms through FFC; automatic and efficient assembly of linear systems; and support for general families of finite elements.
LK is an implementation of the Lin-Kernighan heuristic for the Traveling Salesman Problem and for the minimum weight perfect matching problem. It is tuned for 2-d geometric instances, and has been applied to certain instances with up to a million cities. Also included are instance generators and Perl scripts for munging TSPLIB instances. <P>This implementation introduces ``efficient cluster compensation'', an experimental algorithmic technique intended to make the Lin-Kernighan heuristic more robust in the face of clustered data.
dnacgr is a program to visualise patterns in DNA and RNA by using Chaos Game representation. It shows the probability of bases and sequences, and can read .fasta and .seq format files. dnacgr can be used for genome analysis, and it reads millions of bases from files in seconds. It runs on the console, and requires SVGAlib. It prints to a file in PNG format.
DREAM (The Distributed Resource Evolutionary Algorithm Machine) seeks to provide the technology and software infrastructure necessary to support the next generation of evolving infohabitants in a way that makes that infrastructure universal, open, and scalable. It will use existing hardware infrastructure in a much more efficient manner, by utilising otherwise-unused CPU time. It will allow infohabitants to co-operate, communicate, negotiate and trade; and emergent behaviour is expected to result. It is expected that there will be an emergent economy that results from the provision and use of CPU cycles by infohabitants and their owners. The DREAM infrastructure will be evaluated with new work on distributed data mining, distributed scheduling, and the modelling of economic and social behaviour.
FaCiLe is a constraint programming library over integer finite domain written in OCaml. It offers all usual facilities to create and manipulate finite domain variables, arithmetic expressions and constraints (possibly non-linear), built-in global constraints, and search goals. It also allows you to build easily user-defined constraints and goals (including recursive ones), making pervasive use of OCaml higher-order functionals to provide a simple and flexible interface for the user.
DynaMo is a software library providing classes that take care of the calculation of the motions of objects under the influence of force, torque, and impulse. It can also compute forces for you through the mechanism of constraints. These allow you to easily connect geometries to each other in various ways. A constraint only has to be specified once, and the library will continually enforce it from that moment on by applying the required reaction forces. Over a dozen constraints available, including several types of hinges and a constraint for collision response calculations.