Search Results for "linux 32 bits"
Sort By:
Showing 25 open source projects for "linux 32 bits"
View related business solutions-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
Auth0 B2B Essentials: SSO, MFA, and RBAC Built InAuth0's B2B Essentials plan gives you everything you need to ship secure multi-tenant apps. Unlimited orgs, enterprise SSO, RBAC, audit log streaming, and higher auth and API limits included. Add on M2M tokens, enterprise MFA, or additional SSO connections as you scale.
-
1
CUTLASS
CUDA Templates for Linear Algebra Subroutines
CUTLASS is a collection of CUDA C++ template abstractions for implementing high-performance matrix-multiplication (GEMM) and related computations at all levels and scales within CUDA. It incorporates strategies for hierarchical decomposition and data movement similar to those used to implement cuBLAS and cuDNN. CUTLASS decomposes these "moving parts" into reusable, modular software components abstracted by C++ template classes. These thread-wide, warp-wide, block-wide, and device-wide... -
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
-
Earn up to 16% annual interest with Nexo.Generate interest, borrow against your crypto, and trade a range of cryptocurrencies — all in one platform. Geographic restrictions, eligibility, and terms apply.
-
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. This may be of interest just to people... -
6
ampclib
Arithmetic Multlple Precision Computation Library
ampclib is a simple to use platform independed C++ library for arithmetic multiple precision computations with a ritch and self explaining interface. It provides number theoretic functions and primality tests. 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... -
7
BioFVM
3-D diffusion solver for biological problems
BioFVM is an open source diffusive transport solver for biological problems. It can solve for the diffusion of tens or hundreds of substrates on large 3-D domains. For simplicity, the code has minimal external dependencies. 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... -
8
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. -
9
riboshape
Predicting ribosome footprint profile shapes from transcript sequences
Riboshape is a suite of algorithms to predict 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. -
Go From AI Idea to AI App FastAccess Gemini 3 and 200+ models. Build chatbots, agents, or custom models with built-in monitoring and scaling.
-
10
xorlisp
Bit level lambda continuations and nothing else - Queue automata
Not working yet. To deal with the Halting Problem, computing and data are navigated using debugger ops: linearForward and treeForward, which navigate an astronomically large bit string where 1 is ( and 0 is ). All pairs are derived from (). For example, true is represented as ((()())()), and false is (()(()())). It appears related to the church encoding of lambda where T chooses first parameter and F chooses second, of a pair. Continuations are nearly finished code and are represented as a... -
11
Immutable Sparse Wave Trees (WaveTree)
Realtime bigdata tool for bit strings up to 2^63 based on AVL forest
Realtime bigdata tool at the bit level based on immutable AVL forest which can be run in memory or, in future versions, as a merkle forest like a blockchain. Main object is a sparse bit string (Bits) that efficiently scales up to 2^63 bits normally compressed as forest has duplicated substrings. Bits objects support reading bit, byte, short, int, or long (Java primitives) at any bit index in 64 bit range. Example: instead of building a class to hold a header and then data, represent all of... -
12
MathX
Fixed-length Arithmetic-types library
MathX is a fixed-length arithmetic-types written in pure c++ templates. The goal is to provide signed-integer, unsigned-integer, IEEE-754 float-point and fixed-point types, all with specific number of bits. To this moment, only signed-integer and unsigned-integer are completed for little-endain architecture. Any compiler that support c++03 or c++11 can successfully compile MathX. Refer to README for more information. -
13
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. -
14
fastest primes
A fast prime number generator based on the Sieve of Eratosthenes
The purpose of this project is to make a prime number generator that offers many user adjustable settings and that is also very fast. 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. -
15
Puran2 - Real Random Number Generator
Real Random Number Generator
Puran2 is a real random number generator based on electronic noise. The random bits are stored on a CD. The software allow the access to the random bits like a pseudo random number generator and is easy to use. It can be mixed with random number of a tausworthe generator to grow the count of random number. -
16
BP (Bilinear Pairing)
library for Bilinear Pairing
A library encapsulating bilinear pairing computation and group computation in the cyclic groups G_1, G_2, G_T. The bilinear pairing is a bilinear, non-degenerate map between G_1 and G_2 to an element in G_T. The users can build complex pairing-based software by the Pairing library without much knowledge of elliptic curves or pairing or number theory. The library is smaller than 57 Kbytes, suitable for hand held devices. The size is only 3.7% of the size of the BPC... -
17
aal
The Advanced Algebraic Language.
The Advanced Algebraic Language (AAL) is a very dynamic programming language designed to fill the void that has appeared between mainstream languages and algebra. 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/ -
18
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. -
19
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.
-
20
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.
-
21
Platform independend, multithreaded fractal generator. 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.
-
22
This project has been integrated with project http://sf.net/projects/okopo and will be shutdown when the published files have been transferred there.
-
23
This is a conversion-to-binary training game prototype. Random bits appear, and you must shoot them where they fit onto various bytes (given in octal, hex or even bit ops, decimal or Ascii). Shoot wrongly and you lose that byte, or get it right and win.
-
24
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.
-
25
Mathfun.py is a Python library that contains those little bits of mathemagical ideas that we all enjoy. Primes, prime factorization, Fibonacci sequences, string2value functions...
- Previous
- You're on page 1
- Next
