is a software package for solving semidefinite program (SDP), intended
for very hard to solve SDPs and SDPs requires ultra high accuracy.
It is based on a Mehrotra-type predictor-corrector infeasible
primal-dual interior-point method. The SDPA-GMP shares the same
features as the SDPA, excpt for calculations will be done
with multiple precision arithmetics via the GMP
(the GNU Multiple Precision Arithmetic Library).
WWW: http://sdpa.indsys.chuo-u.ac.jp/sdpa/index.html
of k-nearest neighbor classification. The package includes the IB1, IB2,
TRIBL, TRIBL2, and IGTree algorithms, and offers various weighting metrics.
WWW: http://ilk.uvt.nl/timbl/
PR: ports/121661
Submitted by: Yuri Victorovich <yuri at tsoft.com>
for large environments composed of unstructured models.
WWW: http://www.cs.unc.edu/~geom/OBB/OBBT.html
PR: ports/118556
Submitted by: Jason W. Bacon <bacon at smithers.neuro.mcw.edu>
It takes 2 array of point measures, compute the confidence intervals
using the PointEstimation module (which is also included in this package)
and use the T-statistic to test the null hypothesis. If the null hypothesis
is rejected, the difference will be given as the lower_clm and upper_clm of
the TTest object.
WWW: http://search.cpan.org/dist/Statistics-TTest/
PR: ports/119740
Submitted by: dawe <daweonline at gmail.com>
limits itself to real numbers, but an extra use statement brings full complex
support, along with a full set of mathematical functions typically associated
with and/or extended to complex numbers.
WWW: http://search.cpan.org/dist/Math-Complex/
PR: ports/119441
Submitted by: Jin-Shan Tseng <tjs at cdpa.nsysu.edu.tw>
searching for weakness in SHA-1 hash
SHA-1 Collision Search Graz is a distributed computing project
-- people from through out the world download and run software
to band together to make one of the largest supercomputers in
the world. Every computer makes the project closer to our goals.
The project is trying to see if like MD4 in 1996, MD5/RIPEMD
in 2004, and the the direct predecessor SHA-0 in 2004 also,
there is a weakness in the hash.
WWW: http://boinc.iaik.tugraz.at/sha1_coll_search/
PR: ports/116691
Submitted by: Tuc <freebsd-ports@t-b-o-h.net>
linear programming solver written in C++. It is primarily meant to be used as
a callable library, but a basic, stand-alone executable version is also
included.
WWW: http://www.coin-or.org/Clp/index.html
PR: ports/115185
Submitted by: Robin Schilham
It is designed to be enjoyed using keyboard. Result is shown in
scrollable display, history of expressions is available with up
and down arrow.
Some other features:
optional keypad, syntax highlight, matched parenthesis indicator,
just-in-time calculation (show result even before you finish typing)
and autocomplete for variables.
WWW: http://speedcrunch.digitalfanatics.org/
Note: Moved from science to math at danfe@'s request (no repocopy since there
is no history to preserve).
PR: ports/114969
Submitted by: Yinghong.Liu <relaxbsd at gmail.com>
Hoc, the High Order Calculator, is an interpreted language for
floating-point calculations. Its most basic use is as a powerful and
convenient calculator, interactively evaluating expressions such as
1+2*sin(0.7). But hoc is no ordinary calculator: It also lets you
assign values to variables, define your own functions, and use loops,
conditionals, and everything else you'd expect in a programming
language.
Hoc was developed by Brian Kernighan and Rob Pike, and introduced in
their 1984 book The Unix Programming Environment. This version has been
extended and improved by Nadav Y. Har'El.
WWW: http://nadav.harel.org.il/homepage/hoc/
Author: Nadav Y. Har'El <nadav@harel.org.il>
CVC Lite is no longer supported. Please use CVC3 (math/cvc3) for all your
validity checking needs.
Approved by: rafan (mentor, implicit), lwhsu (maintainer)
2007-06-30 math/cvcl: CVC Lite is no longer supported. Please use CVC3 (math/cvc3) for all your validity checking needs!
multi-precision floating point arithmetic with a Pascal/Modula like
syntax. It has several builtin functions for algorithmic number
theory like gcd, Jacobi symbol, Rabin probabilistic prime test,
continued fraction and quadratic sieve factorization, Pollard rho
factorization, etc.
WWW: http://www.mathematik.uni-muenchen.de/~forster/sw/adownload.html
PR: ports/113862
Submitted by: Lars Engels <lars.engels at 0x20.net>
a variety of platforms, is able to handle large, complex simulations, but
is also reasonably easy for novices to operate.
PR: ports/112577
Submitted by: Jason W. Bacon <bacon at smithers.neuro.mcw.edu>
gretl is used in the mathematical analysis of time series,
and has a functionality that is similar to various statistical
and signal processing components of it++, octave, scilab,
R, numpy/scipy, etc. -- most of which are in the math
category. It should really be placed there, rather than
in misc. In recognition of the fact that it implements
some methods that are commonly (but not exclusively!) used
in econometrics, it should also be given a secondary listing
in finance. (In my opinion, however, it shouldn't be given
a primary listing in that category, because most of the
ports there deal with the nuts-and-bolts of accounting,
payment methods, taxes, and stock tracking. To my knowledge,
the only ports now in finance that remotely resemble gretl
are quantlib, xtrader, and qtstalker, all of which employ
simpler methods that are more specific to financial time
series than are the more general methods in gretl.
PR: ports/113052
Submitted by: bf <bf2006a@yahoo.com>
permutations, without repitition, of a given set
and subset size. Associative arrays are preserved.
WWW: http://pear.php.net/package/Math_Combinatorics/
PR: ports/112824
Submitted by: Zhen REN <bg1tpt at gmail.com>
the following design goals:
* JTS conforms to the Simple Features Specification for SQL published by the
Open GIS Consortium
* JTS provides a complete, consistent, robust implementation of fundamental
2D spatial algorithms
* JTS is fast enough for production use
* JTS is written in 100% pure Java(TM)
* JTS is open source (under the LGPL license)
<http://www.vividsolutions.com/Jts/JTSHome.htm>
Calculations are done on expr, if given. Otherwise, the standard input is used.
Numbers can be entered in hexadecimal (0xbeef), decimal (1984), octal (007),
and binary (0b1001). All numerical operators (+, -, *, /, %), bit operators
(|, ^, &, ~, <<, >>), and logical operators (==, !=, <, >, <=, >=, !, &&, ||)
are supported.
WWW: http://cyth.net/~ray/moo/
PR: ports/111824
Submitted by: Steven Kreuzer <skreuzer at f2o.org>
That is, it estimates the c coefficients for a line-fit of the type
y= c(0)*x(0) + c(1)*x1 + c(2)*x2 + ... + c(k)*xk
given a data set of N observations, each with k independent x variables
and one y variable. Naturally, N must be greater than k---and preferably
considerably greater. Any reasonable undergraduate statistics book will
explain what a regression is. Most of the time, the user will provide a
constant ('1') as x(0) for each observation in order to allow the
regression package to fit an intercept.
WWW: http://search.cpan.org/dist/Statistics-Regression/
A Double-Double and Quad-Double Arithmetic library.
Double-double and quad-double numbers are unevaluated sum of
two and four IEEE doubles capable of representing 106 and 212 bits
of significand, respectively. The library is written in C++, taking full
advantage of operator overloading. C, Fortran 77, and Fortran 90 interfaces
are also provided.
This work was done at Lawrence Berkeley National Laboratory,
NERSC Division, Yozo Hida with Xiaoye S. Li and David H. Bailey.
WWW: http://www.cs.berkeley.edu/~yozo/
library, which implements multilayer artificial neural networks in C with
support for both fully connected and sparsely connected networks.
Cross-platform execution in both fixed and floating point are supported. It
includes a framework for easy handling of training data sets. It is easy to
use, versatile, well documented, and fast. PHP, C++, .NET, Ada, Python, Delphi,
Octave, Ruby, Pure Data and Mathematica bindings are available. A reference
manual accompanies the library with examples and recommendations on how to use
the library. A graphical user interface is also available for the library.
WWW: http://leenissen.dk/fann/
PR: ports/109853
Submitted by: Tz-Huan Huang <tzhuan at csie.org>
of the Basic Linear Algebra Subroutines(BLAS; math/blas).
It supports various architectures.
WWW: http://www.tacc.utexas.edu/resources/software/
Based largely on: hrs's original port (thanks)
powerful modern algorithms. It features a stable and very fast implementation
of a self-initializing multiple polynomial quadratic sieve (MPQS), plus a
highly experimental and unfinished number field sieve (NFS) implementation.
Primary design goals are speed, portability and ease of use. Msieve claims to
be the fastest implementation for factoring general inputs between 40 and 100
decimal digits.
Author: Jason Papadopoulos <jasonp@boo.net>
WWW: http://www.boo.net/~jasonp/qs.html
PR: ports/107477
Submitted by: Daniel Roethlisberger <daniel at roe.ch>
arbitrary directed and undirected graphs with thousands of nodes and millions
of edges. Since the module makes use of the open source igraph library
written in almost 100% pure C, it is blazing fast and outperforms most other
pure Python-based packages around.
WWW: http://cneurocvs.rmki.kfki.hu/igraph
PR: ports/106971
Submitted by: Li-Wen Hsu <lwhsu at lwhsu.org>
2006-11-16 math/p5-AI-NeuralNet-Mesh: project no longer exists
2006-11-16 net/p5-Archie: project no longer exists
2006-11-15 www/mod_jk2: "JK2 is officially unsupported, no further development will take place."
2006-11-15 www/mod_jk2-apache2: "JK2 is officially unsupported, no further development will take place."
It can multiplicate (by matrix or number), add, substract, invert,
transpose and get the determinant of matrices. And these calculations
can be done on matrices of any order.
It has two interfaces: GTK GUI and console-interface.
Morten Slot Kristensen <ontherenth@gmail.com>
WWW: http://mplus.dk/matrices/
PR: ports/104983
Submitted by: Morten Slot Kristensen
