Ports Search

Calcoo is a scientific calculator designed to provide maximum usability. The features that make Calcoo better than (at least some) other calculator programs are: * Bitmapped button labels and display digits to improve readability. * No double-function buttons. * Undo/redo buttons. * Copy/paste interaction with X clipboard. * Both RPN (reverse Polish notation) and algebraic modes are available. * Tick marks to separate thousands. * Two memory registers with displays. * Displays for Y, Z, and T registers. * It is a purely scientific calculator. Features that Calcoo lacks: * Statistical mode. * HEX mode.

Algae is a programming language for numerical analysis. It was written in the Boeing Company to fulfill their need for a fast and versatile tool, capable of handling large systems. Algae has been applied to interesting problems in aerospace and related fields for more than a decade.

Aspcud is a solver for package dependencies. A package universe and a request to install, remove, or upgrade packages have to be encoded in the CUDF format. Such a CUDF document can then be passed to aspcud along with an optimization criteria to obtain a solution to the given package problem.

Asymptote is a powerful script-based vector graphics language that provides a natural coordinate-based framework for technical drawing. Labels and equations are typeset with LaTeX, for high-quality PostScript output. A major advantage of Asymptote over other graphics packages is that it is a programming language, as opposed to just a graphics program: it can therefore exploit the best features of script (command-driven) and graphical user interface (GUI) methods.

Biggles is a Python module for creating publication-quality 2D scientific plots. It supports multiple output formats (postscript, x11, png, svg, gif), understands simple TeX, and sports a high-level, elegant interface. It's intended for technical users with sophisticated plotting needs. The goal is to produce the best scriptable plotting program.

The octave-forge package is the result of The GNU Octave Repositry project, which is intended to be a central location for custom scripts, functions and extensions for GNU Octave. contains the source for all the functions plus build and install scripts. This is cgi. Common Gatway Interface for Octave.

Chryzodus is a cross-platform graphical program drawing beautiful and colorful chryzodes. If you do not know what chryzodes are, take a look at http://www.chryzode.org/. Then you will be able to explore the world of chryzodes by yourself using Chryzodus. But one does not even need to know much about chryzodes to use Chryzodus and see beautiful images appear on the screen!

The octave-forge package is the result of The GNU Octave Repositry project, which is intended to be a central location for custom scripts, functions and extensions for GNU Octave. contains the source for all the functions plus build and install scripts. This is queueing. The queueing toolbox provides functions for queueing networks and Markov chains analysis. This package can be used to compute steady-state performance measures for open, closed and mixed networks with single or multiple job classes. Mean Valud Analysis (MVA), convolution and various bounding techniques are implemented. Various transient and steady-state performance measures for Markov chains can als be computed (including state occupancy probabilities, mean time to absorption, time-averaged sojourn times), both for continuous-time and discrete-time chains.

Maxima is a Common Lisp implementation of MIT's Macsyma system for computer based algebra.

GOBLIN is a C++ class library focussed on graph optimization and network programming problems. It deals with all of the standard graph optimization problems discussed by textbooks and in courses on combinatorial optimization. Today, GOBLIN provides strongly polynomial algorithms for the following graph optimization problems: - Shortest paths in graphs and digraphs with negative lengths. - Negative cycles and minimum mean cycles. - Strong and 2-connected components. - Minimum spanning trees, arborescences and 1-trees. - Maximum st-flows, feasible circulations and b-flows. - Min-cost st-flows, b-flows and circulations. - Assignment problems of any kind. - 1-matchings, b-matchings, capacitated b-matchings, f-factors and degree-constrained subgraphs. - Directed and undirected Chinese postman problems, T-joins. The library also includes methods for NP-hard problems, namely TSP, ATSP, stable sets and graph colouring.