Open Source Linux Mathematics Software - Page 68

Plot 2D (plotting X vs Y) scatter plots directly to a compressed image file. Platform independent standalone package. Plot up to 12 series. ASCII options file. Console/Terminal and win32 GUI. Code is ANSI C with C++ encapsulation. Try it on the website.

Pocket CRF is a modified version of CRF++, it maintains the simplicity of CRF++ and is able to use high order features. Pocket M3N is a simple Max Margin Markov Networks package for sequence labeling tasks.

The Point Cloud Compiler is a tool for converting point cloud image (3D) to human-visible image (2D) by orthogonal projection.

PolyBoRi is implemented as a C++ library for Polynomials over Boolean Rings, which provides high-level data types for Boolean polynomials. A python-interface yields extensible algorithms for computing Groebner bases over Boolean Rings.

A little program written in C++ that decides if a point is inside of a polygon. Also computes the polygon's area.

I was disappointed that 360 sided polygons looked like circles. Had tried and struggled with pythonturtle, svg, and freecad. This is my attempt to make one.

A python program that can be used to investigate a set of equilateral polyhedra containing heptagons.

Allows user to convert from vertex to facet description and vice versa, convex union of two polyhedra, intercestion of two polyhedra, remove redundant vertices or inequalities from vertex or facet description.

Fits and scores vertices from models onto reference vertices to find its polyhedral identity and symmetry quantitatively. Java based with GUI

Spanish-language PHP application dedicated to graph polynomial functions.

This is a research project. A new modulation method 'Advanced PCC-OFDM' is developed. With this method you can construct a modulation, which is fast decaying in frequency domain, while maintaining spectral efficiency.

The objective of this project is to build a general-purpose polynomials system solver. While a few of those programs are available, this one will incorporate recent mathematical advances on mixed volume computations, sparse condition numbers and condition-metric homotopy.

PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).

PortOpt [Portfolio Optimizer] is a C++ program (with Python binding) implementing the Markowitz(1952) mean-variance model with agent's linear indifference curves toward risk in order to find the optimal assets portfolio under risk. You have to provide PortOpt (in text files or - if you use the api - using your own code) the variance/covariance matrix of the assets, their average returns and the agent risk preference. It returns the vector of assets' shares that composes the optimal portfolio. In order to minimise the variance it internally uses QuadProg++, a library that implement the algorithm of Goldfarb and Idnani for the solution of a (convex) Quadratic Programming problem by means of an active-set dual method. This solution is very efficient as it allows to solve hundred of thousand of portfolio problems in seconds. PortOpt runs as a text/console tool so it can be easily used in your own scripts.

Implementation of the PowerWatershed algorithm (q=2) described in the following paper (ICCV 2009) http://www.esiee.fr/~najmanl/papers/couprie2009iccv.pdf

A Javascript collection with over 400 mathematical functions including but not limited to: extended statistical functions, geometry, matrix calculation and a lot more. A simple frontend including a virtual keyboard is also in this packet.

PrechacThis is a web-based siteswap generator for jugglers. It finds all symmetric passing patterns fulfilling given constraints like period-length and maximum height of throws.

PredatorPreySimulation is a graphical Java application for simulating a predator prey ecosystem using the Volterra-Lotka equations.

Prenzl!! is a desktop application and a screen saver running artistic cellular automata. The application is based on an Eclipse architecture and the rules can be in native. Our mission is to provide a viewer and an SDK for this kind of art, called CArt.

This small Java Application makes the user availible to calculate if a number is prim without many resource requirements.

The interactive mathematical programming system GYWOPT is released as free software. It has been developed since early 2000 for experiments with the Integral Basis Method for integer programming by U.-U. Haus, M. Köppe and R. Weismantel.

This project is to attempt to find prime factors of a very large number. The code we are starting with uses the Eratothenes Sieve algorith and is multithreaded. We hope to get this running on a Parallel Knoppix cluster.

Searches for prime numbers within a given range and outputs in a format proper for uploading.

The goal is to use distributed computing in the least bandwidth-intensive way to find a large prime number. We will have four parts to the project.

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?