Search Results for "z-zip"

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

FieldTrip is the MATLAB software toolbox for MEG, EEG and iEEG analysis, which is released free of charge as open source software under the GNU general public license. FieldTrip is developed by members and collaborators of the Donders Institute for Brain, Cognition, and Behaviour at Radboud University, Nijmegen, the Netherlands. The toolbox offers advanced analysis methods of MEG, EEG, and invasive electrophysiological data, such as time-frequency analysis, source reconstruction using...

...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: "Complex_Domain_Coloring") 3) Texture definitions (RGB and HSV) for parametric surfaces can now be expressed as functions of complex numbers 4) Added a software implementation for the OpenGL variable gl_FrontFacing (fixed an issue with GPU drivers on MacOSX Catalina). ...

Researchers, Mathematicians and Enthusiasts. Download "Billiards Covers" to see the most current list of periodic paths in triangles. Download "Billiards Everything" to discover new periodic billiard paths, an unresolved problem from 1775! Follow "The Great Periodic Path Hunt" at gwtokarsky.github.io for the latest news. Email tokarsky@ualberta.ca for feedback.

The new version of MinimPy (MinimPy2) is available for download at: https://osdn.net/dl/minimpy2/MinimPy2.zip Please send your feedback about this new version to mahmood.saghaei@gmail.com (include MinimPy2 in the subject) ============================================================ MinimPy is a desktop application program for sequential allocation of subjects to treatment groups in clinical trials by using the method of minimization. Comprehensive reference help is available at http://minimpy.sourceforge.net MinimPy has been fully described in the following article: Saghaei, M. and Saghaei, S. (2011) Implementation of an open-source customizable minimization program for allocation of patients to parallel groups in clinical trials. ...

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 (CvHMM) is an implementation of discrete Hidden Markov Models (HMM) based on OpenCV. It is simple to understand and simple to use. The Zip file contains one header for the implementation and one main.cpp file for a demonstration of how it works. Hope it becomes useful for your projects.

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.

Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.

Many computational problems need arithmetic operations in polynomial finite rings over Z/nZ, where n is an integer (n>1). This library provides efficient operations for applications such as integer factorization and primality testing.

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.