lrng is a collection of uniform pseudorandom number
generators, written in C, and based on algorithms by Francois
Panneton, Pierre L'Ecuyer, and Makoto Matsumoto.
A collection and description of functions to compute density,
distribution and quantile function and to generate random variates
of the stable distribution.
ocamlgraph is a graph library for Objective Caml. It provides an
easy-to-use graph data structure together with several operations
and algorithms over graphs.
This is a component of SPARK 2015: Those looking for the automatic
theorem prover known as Alt-Ergo should refer to math/alt-ergo instead
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 ltfat.
The Large Time/Frequency Analysis Toolbox (LTFAT) is a Matlab/Octave toolbox
for working with time-frequency analysis, wavelets and signal processing. It
is intended both as an educational and a computational tool. The toolbox
provides a large number of linear transforms including Gabor and wavelet
transforms along with routines for constructing windows (filter prototypes)
and routines for manipulating coefficients.
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 nlwing2.
This package allows efficient computation of nonlinear aerodynamic properties
of a wing. It employs 2D section data to build a 3D potential vortex model of
the flow. It uses a robust Euler-Newton method to track the change of flow
vorticity quantities as the angle of attack progresses.
This is a much simplified, lightweight version of match/p5-Bit-Vector,
and wraps Perl's (sometimes confusing) vec() function in an
object-oriented abstraction.
This module converts to and from Base36 numbers (0..9 - A..Z)
It was created because of an article/challenge in "The Perl Review"
This module implements a Genetic Algorithm (GA) in pure Perl. Other Perl
modules that achieve the same thing (perhaps better, perhaps worse) do
exist. Please check CPAN. I mainly wrote this module to satisfy my own
needs, and to learn something about GAs along the way.
I will not go into the details of GAs here, but here are the bare basics.
Plenty of information can be found on the web.
In a GA, a population of individuals compete for survival. Each individual
is designated by a set of genes that define its behaviour. Individuals
that perform better (as defined by the fitness function) have a higher
chance of mating with other individuals. When two individuals mate, they
swap some of their genes, resulting in an individual that has properties
from both of its "parents". Every now and then, a mutation occurs where
some gene randomly changes value, resulting in a different individual. If
all is well defined, after a few generations, the population should
converge on a "good-enough" solution to the problem being tackled.
The PARI system is a package which is capable of doing formal computations on
recursive types at high speed.
It is possible to use PARI in two different ways:
1) as a library, which can be called from any upper-level language
application (for instance written in C, C++, Pascal or Fortran);
2) as a sophisticated programmable calculator, named GP, which contains
most of the standard control instructions of a standard language
like C.
This is the alpha quality version that development is in the way.
Algorithm, improvement of implementation are done.
Because improvement of performance was big, ports was made as -devel in
particular.