Search Results for "linux on windows"

newLISP for BSDs, LINUX, MacOS X, SunOS and Win32: small, fast 350+ functions, a -C-, MySQL, PostgreSQL, SQLite, ODBC, TCP/IP, UDP, XML, Java interface, string processing, regular expressions , math, financial, statistical functions, Win32 DLL

C++ BigInt class that enables the user to work with arbitrary precision integers. Latest Version: 10.3 (2019-03-06)

This package provides high-level interface utilities for MCMC models via Just Another Gibbs Sampler (JAGS), facilitating the use of parallel (or distributed) processors for multiple chains, automated control of convergence and sample length diagnostics, and evaluation of the performance of a model using drop-k validation or against simulated data. Template model specifications can be generated using a standard lme4-style formula interface to assist users less familiar with the BUGS syntax. A...

OpenAxiom is an open source Computer Algebra System. It offers an interactive environment, an expressive programming language, a compiler, a large set of mathematical libraries of interest to researchers and practitioners of computational sciences.

Wolfgang is a lightweight tool that allows users to easily create and edit Petri nets and check them against general and workflow specific net properties. Specifically, Wolfgang supports full PNML conform editing functionality of Place-Transition Nets (P/T-Nets) and Colored Petri Nets (CPN) as they are defined in the SEPIA package. Its simple and easy to use interface allows to quickly create Petri nets from scratch, edit them graphically in many ways, store and even export them as PDFs. Use...

Tinger Calc is a powerful scientific calculator environment. It supports elementary math ( +, -, *, /, ^), trigonometric functions (sin, sinh, asin, cos, cosh, acos, tan, tanh, atan), exponential functions (exp, ln, lg, sqrt), math constants (pi, e), system functions (exit, quit, print). The software support email: tingersoft@gmail.com.

A tool written in C++ to generate very large Fibonacci numbers using the primary recursive formula: F(n) = F(n-1) + F(n-2) n > 1; F(1) = 1, F(0) = 0.