Search Results for "32"
Sort By:
Showing 17 open source projects for "32"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
Secure File Transfer for Windows with Cerberus by RedwoodCerberus supports unlimited users and connections on a single IP, with built-in encryption, 2FA, and a browser-based web client — all deployable in under 15 minutes with a 25-day free trial.
-
1
CUTLASS
CUDA Templates for Linear Algebra Subroutines
...To support a wide variety of applications, CUTLASS provides extensive support for mixed-precision computations, providing specialized data-movement and multiply-accumulate abstractions for half-precision floating point (FP16), BFloat16 (BF16), Tensor Float 32 (TF32), etc. -
2
OpenSIMPLY
Discrete-event simulation modeling software for science and education
...Some application of this modeling software are: - traffic simulation - network simulation, - emergency and evacuation ways simulation and much more. This simulation tool runs in Windows and Linux, on 32-bit and 64-bit platforms, as a GUI or console (terminal) application. Write the model only once, simulate anywhere. Videos on installing OpenSIMPLY for different IDEs and operating systems : https://www.youtube.com/playlist?list=PLnyWoktGqA -
3
lpsolve
Mixed Integer Linear Programming (MILP) solver.
Mixed Integer Linear Programming (MILP) solver lp_solve solves pure linear, (mixed) integer/binary, semi-cont and special ordered sets (SOS) models.lp_solve is written in ANSI C and can be compiled on many different platforms like Linux and WINDOWS This project is moved to github: https://lp-solve.github.io/ -
4
-
$300 Free Credits for Your Google Cloud ProjectsLaunch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
-
5
64-bit prime test
Test 64-bit integers for pribality. Miller-Rabin, Lucas. BPSW
The code here tests 64-bit integers for primality. For 32-bit values it uses hashing and then a single Miller-Rabin test. 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. -
6
ampclib
Arithmetic Multlple Precision Computation Library
...The ampclib consists of three classes: +Integer (multiple precision integers) +Rational (multiple precision rational numbers using the Integer class) +Primes (prime number computations and number theoretic functions for unsigned 32 bit integers) The latest release contains optimizations and bug fixes. -
7
BioFVM
3-D diffusion solver for biological problems
...BioFVM was first published in: A. Ghaffarizadeh, S.H. Friedman, and P. Macklin. BioFVM: an efficient, parallelized diffusive transport solver for 3-D biological simulations. Bioinformatics 32(8): 1156-8, 2016. DOI: 10.1093/bioinformatics/btv730 method paper: http://dx.doi.org/10.1093/bioinformatics/btv730 -
8
riboshape
Predicting ribosome footprint profile shapes from transcript sequences
...It applies kernel smoothing to codon sequences to build predictive features, and uses these features to builds a sparse regression model to predict the ribosome footprint profile shapes. Reference: Liu, T.-Y. and Song, Y.S. Prediction of ribosome footprint profile shapes from transcript sequences. Proceedings of ISMB 2016, Bioinformatics, Vol. 32 No. 12 (2016) i183-i191. -
9
Jafaran
Fast and more random implementations of java.util.Random.
...Also available on github since 2015/12/13: https://github.com/jeffhain/jafaran Principal classes: - Implementations using Mersenne-Twister algorithm (good pseudo-randomness): MTSyncRNG MTSeqRNG - Implementations using Marsaglia Xor-Shift (fast): MXSIntSeqRNG (32 bits) MXSLongSeqRNG (64 bits) (nextLong() faster, larger period) - Ziggurat: Random-based implementation of Ziggurat algorithm. -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
Runge
Runge is an Interactive Solver for Systems of Differential Equations
...When it needs to compute derivatives (Jacobian matrix, for example) it does that analytically, i.e. without using numerical methods. It's portable. It works on Windows and Linux 32 and 64 bit and Mac OS X 64 bit. It's open. It allows you to implement and embed your own algorithms (aka "solvers"). It's easy to use. It allows to export results to MS Excel and MATLAB. It's multilingual. It currently supports Englis and Russian languages. It's free. It's distributed under the Boost Software License. -
11
fastest primes
A fast prime number generator based on the Sieve of Eratosthenes
...While there are other prime number generators that can still beat this one in speed, no other ones that I am aware of allow the level of adjustment of sieve size that this one does. If you are running 64-bit Windows, make sure to download the 64-bit executable as it is faster than the 32-bit executable. -
12
aal
The Advanced Algebraic Language.
...As a result its main focus is ease of use for math problems. To download AAL check out the source code repository. There are versions available for windows and linux with both 32 and 64 bit native binaries: http://svn.code.sf.net/p/aal-lang/code/trunk/bin/ -
13
Suprangen - pseudorandom numbers
Suprangen is a system of libraries for pseudorandom number generation
Suprangen is a system of libraries of pseudorandom number generators for Monte Carlo simulation and similar applications. It includes uniform and normal double precision generators with 32 or 52 random bits, Fortran 90 interfaces, and interfaces to GSL. -
14
Iterate function viewer for Windows and Linux. It has built in 14 different iterate {Mandelbrot) functions. Many possibilities for changing parameters, saving as bitmap or small file. windows-32. Linux 32 - 64bit. Low level written in assembler.
-
15
MegaPi is a programm to calculate Pi. It uses the GMP-Lib for the long numbers. The maximum of Digits is just bounded to your Physical Memory. Available as source, and for GNU/Linux 32 + 64 Bit.
-
16
...Fine control over thread/CPU usage; unlimited precision; smooth/random/function coloring; supports color map files (over 1600 available); many image file formats. For any Java 1.5+ (32/64 Bit) VM.
-
17
Provides efficient, effective implementations of 32- and 64-bit hash functions based on Rabin fingerprints / irreducible polynomials, in Java. Also provides integration with java.security.MessageDigest API.
- Previous
- You're on page 1
- Next
