The MCL algorithm is short for the Markov Cluster Algorithm,
a fast and scalable cluster algorithm for graphs based on
simulation of (stochastic) flow in graphs. The algorithm was
developed by Stijn van Dongen at the Centre for Mathematics and
Computer Science (also known as CWI) in the Netherlands.
The MCL algorithm is very fast, very scalable, and has a number
of attractive properties causing it to deliver high-quality
clusterings.
WWW: http://micans.org/mcl/
from Andreas Kahari <andreas.kahari@unix.net>
galculator is a GTK2-based scientific calculator with ordinary
notation/reverse polish notation, different number bases (DEC, HEX,
OCT, BIN) and different units of angular measure (DEG, RAD, GRAD).
Maxima is a descendant of DOE Macsyma, which had its origins in the
late 1960s at MIT. It is the only system based on that effort still
publicly available and with an active user community, thanks to its
open source nature. Macsyma was the first of a new breed of computer
algebra systems, leading the way for programs such as Maple and
Mathematica. Maxima itself is reasonably feature complete at this
stage, with abilities such as symbolic integration, 3D plotting, and
an ODE solver, but there is a lot of work yet to be done in terms of
bug fixing, cleanup, and documentation.
WWW: http://maxima.sourceforge.net/
Submitted by rich@cannings.org with minor tweaks by me
--
This module implements some algorithms for calculating Fast Fourier
Transforms for one-dimensional data sets of size 2^n. The data,
assumed to arise from a constant sampling rate, is represented by
an array reference, which is then used to create a Math::FFT object.
Available methods include complex and real discrete fourier transforms,
convolution, power spectra and windowing functions, as well as some
statistical utilities.
o put examples into ${PREFIX}/share/examples/xspread
o remove unnecessary build documentation from PLIST
o use ${MASTER_SITE_OPENBSD} since the original ftp server refuses
anonymous connections
o add comment about license
o regen patches with update-patches
Bit::Vector is an efficient C library which allows you to handle
bit vectors, sets (of integers), "big integer arithmetic" and
boolean matrices, all of arbitrary sizes.
Changes in this release:
Minimized and isolated constructs that do not adhere to C/C++
standards, and added flags NTL_CLEAN_INT and NTL_CLEAN_PTR
which force stricter compliance with these standards
Added functions IsWhiteSpace, CharToIntVal,
and IntValToChar to the tools module
Added methods allocated, position1 to generic vector classes
Added method allocated to the class vec_GF2
Added conversion routines from unsigned int/long to int, long, float,
and double
Added routines AddPrec, SubPrec, etc., to the RR
module, and declared the practice of directly assigning to the variable
RR::prec obsolete
Fixed a number of minor bugs.
* Non-integer powers of negative numbers now yield errors instead
of weird results.
* The selected angle units are saved now.
* Various bug fixes and pixmap cosmetics.
* Added option to choose between infinite and four-element stack in RPN mode.
* Added option to disable autorelease of arc and hyp buttons.
* RPN-related options are now grayed out when the algebraic mode is chosen.
* Added shortcut ctrl-q for exit.
---
fast array facility to the Python language
Numarray is a reimplementation of Numeric which adds the ability
to efficiently manipulate large numeric arrays in ways similar to
Matlab and IDL.
http://www.pfdubois.com/numpy/
calculator designed for doing quick-and-dirty bitwise calculations. It
supports most common integer arithmetic operations, and operates in hex,
octal, or decimal modes.
This program most resembles a multi-radix version of hoc(1)
(ports/math/hoc).
individual port, introduce a new variable for bsd.port.mk, VMEM_WARNING.
By setting this variable to `Yes', the user is given a warning about the
virtual memory requirements just before the pre-build stage.
o Also give some examples for different shells for what to do about
it, and mention login.conf(5). bash, for example, has a confusing
-v flag to ulimit.
o Document this in bsd.port.mk.5
espie@ ok
Submitted by Yozo Toda <yozo@imit.chiba-u.ac.jp>.
The Coq Proof Assistant is designed to write formal specifications, programs
and to verify that programs are correct with respect to their specification.
workaround, since this is commercial, binary distributed software. This
file is installed world-writable and is modified at program startup.
Thanks to Morten Liebach <morten@hotpost.dk> for reporting it. ok lebel
GNU Octave is a high-level language, primarily intended for numerical
computations. It provides a convenient command line interface for
solving linear and nonlinear problems numerically, and for performing
other numerical experiments using a language that is mostly compatible
with Matlab. It may also be used as a batch-oriented language.
Grace is a tool to make two-dimensional plots of numerical data. It
runs under various (if not all) flavours of UNIX with X11 and M*tif.
Its capabilities are roughly similar to GUI-based programs like
Sigmaplot or Microcal Origin plus script-based tools like gnuplot or
Genplot. Its strength lies in the fact that it combines the
convenience of a graphical user interface with the power of a
scripting language which enables it to do sophisticated calculations
or perform automated tasks.
Flavors:
no_x11 - build command line tool only, no gui
fftw - use math/fftw for optimized FFT
netcdf - use math/netcdf for network common data form support
xmhtml - use www/xmhtml to use grace's internal HTML browser
for helpfiles etc.
WWW: http://plasma-gate.weizmann.ac.il/Grace/
MAINTAINER= Nikolay Sturm <Nikolay.Sturm@desy.de>
--
FFTW is a free collection of fast C routines for computing the
Discrete Fourier Transform in one or more dimensions. It includes
complex, real, and parallel transforms, and can handle arbitrary
array sizes efficiently. FFTW is typically faster than other
publically-available FFT implementations, and is even competitive
with vendor-tuned libraries. (See our web page for extensive
benchmarks.) To achieve this performance, FFTW uses novel code-generation
and runtime self-optimization techniques (along with many other
tricks).
WWW: http://www.fftw.org/
Submitted by Nikolay Sturm <Nikolay.Sturm@desy.de>
* Now respects CFLAGS/CPPFLAGS, no need for patches.
* autoconf removed, CONFIGURE_STYLE set to simple.
* Use do-install target now that the install method is so messy.
* New homepage.
COMMENTS don't end with .
HOMEPAGE is there for a reason.
Only bsd.port.mk uses tabspaces set to 4.
pre-package does not run as root, post-install does.
copying files is not good enough to make them executable.
and numerical analysis, very similar to Matlab.
Yorick's array syntax, interpreted programs are compact,
nearly free of explicit loops, and can run at speeds up to
20% of optimized compiled speed.
It can do interactive graphics via the X Window System,
including x-y plots, quadrilateral meshes and cell arrays.
Includes tools to assist making animated and simple 3d
graphs.
Supports output directly to your screen, in PostScript and
binary CGM format.
Maintainer: Peter Valchev <pvalchev@toxiclinux.org>
like a financial spreadsheet. When invoked it presents you
with a table organized as rows and columns of cells. If
invoked without a file argument, by default the initial
table is empty.
Each cell can be associated with a numeric value, a label
string and/or an expression which evaluates to a numeric
value or label string, often based on other cell values
(formula).
MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
--
Math::GMP is designed to be a drop-in replacement both for Math::BigInt
and for regular integer arithmetic. Unlike BigInt, though, Math::GMP
uses the GNU gmp library for all of its calculations, as opposed
to straight Perl functions. This results in a speed increase of
anywhere from 5 to 30 times.
A Math::GMP object can be used just as a normal numeric scalar would
be -- the module overloads the normal arithmetic operators to provide
as seamless an interface as possible.
efficiently solves systems of linear equalities and inequalities.
Constraints may be either requirements or preferences. Client code
specifies the constraints to be maintained, and the solver updates the
constrained variables to have values that satisfy the constraints.
A technical report is included in the distribution that describes the
algorithm, interface, and implementation of the Cassowary solver.
Additionally, the distribution contains toy sample applications
written in Smalltalk, C++, Java, and Python, and a more complex
example Java applet, the "Constraint Drawing Application".
MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
also performs standart or Monte Carlo simulations. It allows you
to specify a set of linear or nonlinear equations and solve them
using parameter values you choose or parameter values sampled
from specified statistical distributions. Outputs can be compared.
It consists of two pieces - a model generator and a simulation
engine. The model generator was created to facilitate the model
maintenance and simulation definition, while keeping execution
time fast. Other programs have been created to the same end, the
Matlab family of graphical interactive programs being some of the
more general and easy to use.
MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
Submitted by Peter Stromberg <home@wilfried.net>.
wmcalc is a program designed to act as a simple four-function
calculator. It is different from other calculator programs,
however in that it is designed to take up very little desktop
space.
functions like f(x) = x^4 - 2. It allows you to view/compare
multiple function's graphs simultaneously, using different colours.
Geg can zoom in/out selections, and is very easy to use by math
students and teachers, providing nice gtk interface.
MAINTAINER= Peter Valchev <pvalchev@toxiclinux.org>
by Victor Shoup. It provides objects and methods for
- arbitrary length integers
- finite fields
- polynomials over fields
- extensions of fields.
NTL's lattice reduction code is also one of the best available anywhere, in
terms of both speed and robustness, and one of the few implementations of block
Korkin-Zolotarev reduction with the Schnorr-Horner pruning heuristic. It has
been used to "crack" several cryptosystems.
MAINTAINER= Tom Knienieder <tom@knienieder.com>
data access and a library that provides an implementation of the
interface. The netCDF library also defines a machine-independent
format for representing scientific data. Together, the interface,
library, and format support the creation, access, and sharing of
scientific data. The netCDF software was developed at the Unidata
Program Center in Boulder, Colorado.
From: Tom Knienieder <tom@knienieder.com>
