Search Results for "wstj-z"

Community Z Tools Project (CZT): Tools for editing, typechecking and animating Z specifications and related notations. Includes a Java framework for building formal methods tools. NOTE: development of CZT has now moved to GitHub: https://github.com/community-z-users/czt

K3DSurf (now MathMod) is a program to visualize and manipulate Mathematical models in three, four, five and six dimensions. K3DSurf supports Parametric equations and Isosurfaces. ****** Welcome to the realm of complex numbers! Change-log for MathMod-11.1 (16/06/2021) 1) Support of graphing functions with complex numbers Z=u+iv in 3D and 4D spaces (demo scripts: "Complex3D_xx" and "Complex4D_Saddle") 2) Added support for HSV (hue, saturation, brightness) coloring model (script...

Fortran 2008 added 3 new intrinsic functions: erf, erfc, erfc_scaled. However, they take only real arguments. This package provides a BSD licensed Fortran 2008 module with erf(z), where z is a complex argument. The calculation is based on calculating w(z), the Faddeyeva (plasma dispersion) function. Two algorithms are implemented: TOMS 680 and 916, http://www.netlib.org/toms/. The simple test program calculates values in the Abramowitz, Stegun.

A self-contained C library providing complex error functions, based on Faddeeva's plasma dispersion function w(z). Also provides Dawson's integral and Voigt's convolution of a Gaussian and a Lorentzian.

This project has been moved to bitbucket.org: - https://bitbucket.org/vahidi/jbdd/wiki/Home - https://bitbucket.org/vahidi/jdd/wiki/Home It includes two libraries for working with decision diagrams: - JBDD: a Java interface to two popular BDD libraries, CUDD and BuDDy - JDD: a native Java library supporting BDD, Z-BDD

A program for exploring complex functions, much like the now out-dated f(z). Domain colored plots of complex functions. Click evaluate. Uses reflection so you can code almost anything for your formula. All java. Please help.

The project aims to provide the basic functions and algorithms needed for computations in polynomial rings over the ring of integers, including polynomial arithmetic and D-Groebner Bases. It might evolve in some kind of computer algebra system

GI-Gaia ist ein portables Framework zur Berechnung und Visualisierung verteilter Algorithmen (z. B. Bestimmung des größten gemeinsamen Teilers im Ring). Die konkreten Simulationen sind von den Basisdiensten getrennt und werden als Plugins nachgeladen.

PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.

We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.