Ports Search

This module is meant to be an introduction to the internal operations of Neural Networks. It lets the user create a single node in a neural net based on the Perceptron model.

The Math::FFT module provides an interface to various Fast Fourier Transform (FFT) routines of the C routine of fft4g.c; The one-dimensional data sets, of size 2^n, are assumed to be sampled at a constant rate. The FFT methods available are - cdft: Complex Discrete Fourier Transform - rdft: Real Discrete Fourier Transform - ddct: Discrete Cosine Transform - ddst: Discrete Sine Transform - dfct: Cosine Transform of RDFT (Real Symmetric DFT) - dfst: Sine Transform of RDFT (Real Symmetric DFT) as well as their inverses. The C code for the FFT routines of fft4g.c is copyrighted 1996-99 by Takuya OOURA. The file arrays.c included here to handle passing arrays to and from C comes from the PGPLOT module of Karl Glazebrook <kgb@aaoepp.aao.gov.au>. The perl interface of the Math::FTT module is Copyright 2000 by Randy Kobes <randy@theoryx5.uwinnipeg.ca>, and may be distributed under the same terms as Perl itself.

Math::FixedPrecision provides a way to do decimal math without floating point errors. WARNING: In order for all tests to complete successfully, you must replace the stock BigFloat.pm with the one located in this distribution. This file will also be updated as part of the 5.6.1 distribution, when that is released. Please copy the included BigFloat.pm to {PERLVERSION}/lib/Math/BigFloat.pm.

Algorithm::Combinatorics is an efficient generator of combinatorial sequences, where efficient means: * Speed: The core loops are written in C. * Memory: No recursion and no stacks are used. Tuples are generated in lexicographic order.

Algorithm::CurveFit implements a nonlinear least squares curve fitting algorithm. That means, it fits a curve of known form (sine-like, exponential, polynomial of degree n, etc.) to a given set of data points.

Algorithm::KMeans is a perl5 module for the clustering of numerical data in multidimensional spaces. Since the module is entirely in Perl (in the sense that it is not a Perl wrapper around a C library that actually does the clustering), the code in the module can easily be modified to experiment with several aspects of automatic clustering. For example, one can change the criterion used to measure the "distance" between two data points, the stopping condition for accepting final clusters, the criterion used for measuring the quality of the clustering achieved, etc.

Algorithm-Munkres is a perl extension for Munkres' solution to classical Assignment problem for square and rectangular matrices This module extends the solution of Assignment problem for square matrices to rectangular matrices by padding zeros. Thus a rectangular matrix is converted to square matrix by padding necessary zeros.

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. The library is efficient (in terms of algorithmical complexity) and therefore fast (in terms of execution speed) for instance through the widespread use of divide-and-conquer algorithms. The package also includes an object-oriented Perl module for accessing the C library from Perl, and optionally features overloaded operators for maximum ease of use. The C library can nevertheless be used stand-alone, without Perl.

A library of generic CAD-related geometry calculations.

This perl library aims to provide as many tools to make it as simple as possible to calculate distances between geographic points, and anything that can be derived from that.