Search Results for "codes"

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

SAS codes for LMG variable importance, Box-Cox transformation including interactions. Documentation and PowerPoint slides. Directories under "Files" with descriptions: NESUG 2014: "A Fast, High-Precision Implementation of the Univariate One-Parameter Box-Cox Transformation Using the Golden Section Search in SAS/IML®" SESUG 2017: "Decomposing the R-squared of a Regression Using the Shapley value in SAS®" SESUG 2019: "Conditionally Executing Data Steps and Statements Based on the Presence of Variables in a SAS® Dataset" GASP 2020: "Online Winsorization of the Survey of Construction’s Price Estimates" My SESUG 2015 materials can also be found in my project "constrainingarrays" at https://sourceforge.net/projects/constrainingarrays/.

...As values get larger it uses up to two more Miller Rabin rounds, and at the end it uses BPSW (which is one rould of Miller Rabin and then one of Lucas). Compared to other codes that achieve the same I believe that the hash tables used here are compact, and both the programs and the intermediate data used to create them are provided. This may be of interest just to people wanting a C++ implementation of the Lucas test.

A collection of sparse Fourier transform codes developed by faculty at MSU. Currently codes for four different prototype sparse FFTs are here: 1.) DMSFT, implemented by Ruochuan Zhang. This is a fast, stable, noise robust, and *fully discrete* improvement on the ideas in GFFT below. It is THE BEST sparse FFT around!!! If you're looking for AAFFT, try this out first. 2.)

BNS - Burris Numerical System was written to store the last digit of a number in 3 dimensional space but store the rest of the number mathematically in the 4th dimension of space. The result is that no matter how long the number is you can write it down on a piece of paper and put it in your pocket. The software can be used to retrieve the number. This can be used to save computer files. The only limit with BNS is how much time the user has. The software nor the numerical system has no...

The Moving Finite Elements project hosts a collection of simulation codes for time-dependent PDE systems that implement various forms of Keith Miller's gradient-weighted moving finite element (GWMFE) method. The Calliope sub-project aims to provide new reference implementations in modern object-oriented Fortran. Click on the Calliope tab on the main project menu bar.

This project deals with a new concept of the heterogeneous grid for acceleration of the numerical linear algebra computing. We design this grid with respect to maximal ratio between cost and computational power. It allows a parallelization of scientific codes with minimal programming effort. We also optimize grid concept to be less sensitive to network parameters.

The Lightweight Integrating Multiphysics Environment for coupling codes (LIME) is a small software package for creating multiphysics simulation codes. LIME is intended to be especially useful when separate computer codes (which may be written in any standard computer language) already exist to solve different parts of a multiphysics problem. LIME provides the key high-level software (written in C++), a well defined approach (with example templates), and interface requirements to enable the assembly of multiple physics codes into a single coupled-physics simulation code. ...

OpenMie aims to solve electromagnetic scattering problems via the Mie method to provide a benchmark against which to test more general scattering codes. Complete field solutions are given for a number of practical geometries.

Reed-Solomon codes list decoder C++ implementation

Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.

LaTex to braille translator for Maths, intended to be able to support multiple braille codes.

Smalltalk numerical analysis codes based on Didier Besset's "Object-Oriented Implementation of Numerical Methods: An Introduction with Java & Smalltalk", 2000, Morgan Kaufmann Publishers.

Java numerical analysis codes based on Didier Besset's "Object-Oriented Implementation of Numerical Methods: An Introduction with Java & Smalltalk", 2000, Morgan Kaufmann Publishers.

Paean is a tool to demonstrate in real-time the effect of various error-correcting codes on data transmitted via several channel models.

Given a String , returns the next logically sequential string defined by a rule. The basic rule is, given a sequence of alphabets, it checks the string and returns a new string with one or more alteration. javadocs and source codes available inside.