Search Results for "smtp-test"

Easy-to-use command-line calculator for basic and scientific calculations.

zshg is an implementation of a constant-time connectivity test for graphs. It is based on "Property Testing in Bounded Degree Graphs" by Oded Goldreich and Dana Ron, "Algorithmic and Analysis Techniques in Property Testing" by Dana Ron.

...This ~2500 lines Pure C factorization software : - is imediately compatible with Microsoft Windows, Linux (no one dependancy) - is a C99 command line factorizer from 0 to 300 bits (330 bits were factored in the lab) - is built so that you can easily use and test the software - use its own "big num" library named cint - use AVL trees to organize information - use Lanczos Block, a pure C iterative matrix eigenvalues finder algorithm - use Pollard's Rho algorithm to answer under 64 bits The Microsoft Windows executable is included in the zip, the readme.md gives you details. Small and larger RSA numbers have been factored by the software, such as the 100 decimal digit number RSA-100. ...

CUDALucas is a program implementing the Lucas-Lehmer primality test for Mersenne numbers using the Fast Fourier Transform implemented by nVidia's cuFFT library. You need a CUDA-capable nVidia card with compute compatibility >= 1.3 up to CUDA 6.5, 2.x up to 7.0 and 3.x for >=CUDA 8.0 . The program is run from the command line, however it can be configured without using a terminal. See the Wiki for more details.

...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. ...

...Related probable primes (3^p -+ 3^((p + 1)/2) + 1)/7 are sieved at the same time. See http://oeis.org/A125743, A125744. After sieving, the Berrizbeitia-Iskra or a Proth test can be run; this is best implemented with FFT mod (3^3p+1) using GWNUM library. A sample implementation (a patch to the LLR program) is available from Batalov. [1] P.Berrizbeitia B.Iskra, 2010; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.189.311 [2] OEIS: http://oeis.org/

Statistics modules in Perl Data Language, with a quick-start guide for non-PDL people. They make the PDL shell work like R, but with PDL threading (fast automatic iteration) of procedures including t-test, linear regression, and k-means clustering.

LightLife offers a clearly laid out user interface to test a universe without any effort. It support various modifications, can save and open Windows-Bitmaps and has got a build-in database of the most common objects.

TestGuesser guesses the answers to simulated test questions and calculates the proportion of correct answers.

libNT is a Number Theory Library which is based on a BigInteger Class. It will contain several algorithms for solving Number Theory Problems. Written in the IDE Code::Blocks

*** There is now an active effort to include a QT-only (no KDE) based IDE for Octave that is part of the main Octave source code. I recommend that you build and test that version of an IDE, as it will be the most supported option going forward. *** The octavede is a development environment for the Octave mathematical software package. Octave normally is run in a terminal. Octavede provides an GTK/X11 application that provides functionality similar to other mathematical software packages.

test *only* 1) nr3, Poisson distribution 2) mixture model

Mathtest tests you in various mathematical operations on a user set amount of questions. The goal of the program is to keep math in practice by running the program daily.

Graph (Set of Vertices and Edges) Editor and Analyser. Can test new "algorithms" on graphs using this software. Done as a 6th Sem CSE, BE Project.

Glucas is a client to make primality test for Mersenne numbers. It is related to GIMPS effort to search the bigest primes ever found. In addition, it can be used as an excellent performance test. Posix thread, OpenMP and SunMP compatible

Rubik's Cube Simulator is a program which runs with OpenGL and glut (works both with Unix (using posix threads) and Windows). It has a window which show a 3D Rubik's Cube. This cube can be maniplulated using a term window. This program is useful to test

The Random Bit Generator Test Suite will take in large blocks of binary data and attempt to tell the user what is not random about them. Code developers, mathematicians and statisticans welcome to help.

bjsim is a blackjack simulator, designed to test various basic (noncounting, total, noncompositional) strategies under various conditions: number of decks, game rules (double after split, dealer hitting soft 17, etc.).

Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)