Verish is a language for reasoning that resembles a natural language. It is equivalent to Lower Predicate Calculus, and has a built-in framework for defining and using abbreviations, and for introducing additional principles of reasoning that can be automatically expanded into a sequence of steps that use only basic principles of reasoning. It has a basic reasoning checking function, and can automatically expand one additional principle of reasoning into a sequence of steps using only the basic principles. It can also add HTML markup to a proof for display as a Web page.
Miramath is an Open Source project inspired by the MathCad mathematical application. The main user interface consists of a page into which mathematical expressions can be entered or edited and then evaluated. It features a Wysiwyg equation editor, automatic evaluation of equations, integrated plotting, symbolic algebra using Sympy, and numerical computations using Scipy.
FroZenLight interrelates line arts, mathematics, and cryptography. Circular shaped mirrors which are arranged in a grid-like manner reflect a light ray according to the reflection law of geometric optics. While random positions of the light source produce chaotic reflection patterns, it is possible to position the light source so that beautiful symmetric reflection patterns are created.
pyuds is a Python library for measuring uncertainty in the Dempster-Shafer theory of evidence. The functionals supported are the Generalized Hartley (GH) uncertainty functional, Generalized Shannon (GS) uncertainty functional, and Aggregate Uncertainty (AU) functional. The library can be utilized either through its API, or through a user-friendly Web interface.
TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.
Treep is a simple language for doing symbolical computations. It operates on numbers and strings that can be organized in more complex objects. These objects are lists of name-value pairs that are stored in memory as AVL trees. It has about sixty built-in functions to operate on such data and a way to define new functions. Treep syntax very much resembles Lisp. The power of treep is its simplicity and security. Treep is a good tool do process objects and relations between them. For example it is possible to define graphs as a sets of vertices and edges in text file, parse that file, do any computations you like, write modified data to text file. Treep works well on graphs, trees, linked lists, simple hashes. Treep is not good at processing texts, dealing with system input/output.
GSL shell offers an interactive user interface that gives access to the GSL collection of mathematical functions. It is based on the powerful and elegant scripting language Lua. GSL shell is not just a wrapper over the C API of GSL, but offers a much more simple and expressive way to use GSL. The objective is to give the user the power to easily access GSL functions without having to write a complete C application. It also has a powerful module to produce plots or almost any kind of graphics based on data or functions.
clac (Command Line Advanced Calculator) evaluates mathematical expressions input via command line arguments or from stdin and writes the results to stdout. Unlike other command line calculators, clac has infix (natural order) expression syntax, is quite comfortable with complex numbers, defines a great many functions and constants by default, and allows easy definition of new user functions and constants using Python.
The METSlib QAP solver is a Tabu Search solver for the quadratic assignment problem, a combinatorial optimization problem that arises in many applicative cases. It can be used to find optimal locations for a set of facilities while minimizing the cost of moving commodities between them, to optimize the placement of components on a circuit board, and for many other applications. This software is based on the METSlib framework.