Math::Symbolic is a Perl module that aims at providing means of symbolic computation to the Perl programmer without resorting to any (non-Open Source) external libraries and/or applications.
Thin Plate Spline, or TPS for short, is an interpolation method that finds a "minimally bended" smooth surface that passes through all given points. TPS of 3 control points is a plane, more than 3 is generally a curved surface and less than 3 is undefined.
The name "Thin Plate" comes from the
... [More] fact that a TPS more or less simulates how a thin metal plate would behave if it was forced through the same control points.
This library is based on Jarno Elonen's work on http://elonen.iki.fi/code/tpsdemo/ [Less]
XS++ (implemented as ExtUtils::XSpp) is a system for extending the Perl programming language by wrapping C++ libraries for use from Perl. It works by generating XS code (the equivalent mechanism for wrapping C code) from an interface definition.
The Perl wrapper for CERN's ROOT library, a comprehensive data analysis framework.
SOOT is very similar to the Ruby-ROOT or PyROOT extensions for their respective languages. Specifically, the first revision of SOOT was implemented after the model of Ruby-ROOT.
SOOT uses a very dynamic approach
... [More] to wrapping a very large and quickly evolving library. Due to the dynamic nature (using the CInt introspection), SOOT is able to handle most of the ROOT classes without explicitly wrapping them. [Less]
This command line tool and Perl module attempts to implement reasonably robust benchmarking with little extra effort and expertise required from the user. That is to say, benchmarking using this module is likely an improvement over the typical "time ./something".
See this blog post for a
... [More] discussion: http://blogs.perl.org/users/steffen_mueller/2010/09/your-benchmarks-suck.html [Less]
An interface to spatial (2D) indexes with support for pluggable algorithms and storage backends.
Right now, this package ships with a quad tree implementation. (Algorithm::SpatialIndex::Strategy::QuadTree) and an in-memory storage backend (Algorithm::SpatialIndex::Storage::Memory).
This module implements robust confidence interval calculations on efficiency-like quantities. The algorithm is explained in the note by Marc Paterno at
http://home.fnal.gov/~paterno/images/effic.pdf
This module implements a mechanism to limit the number of concurrent processes in a cooperative multiprocessing environment. This is an alternative to, for example, running several daemons.
Roughly speaking, a typical setup would be the following:
Cron starts a new process every minute.
The
... [More] process attempts to get a lock as shown in synopsis.
If it obtains a lock, it starts working and exits when the work is done.
If not, "max_procs" processes are already working, so it exits. [Less]
This site uses cookies to give you the best possible experience.
By using the site, you consent to our use of cookies.
For more information, please see our
Privacy Policy