Search Results for "32-bit"
Sort By:
Showing 18 open source projects for "32-bit"
View related business solutions-
MongoDB Atlas runs apps anywhereMongoDB Atlas gives you the freedom to build and run modern applications anywhere—across AWS, Azure, and Google Cloud. With global availability in over 115 regions, Atlas lets you deploy close to your users, meet compliance needs, and scale with confidence across any geography.
-
Go from Code to Production URL in SecondsSkip the Kubernetes configs. Cloud Run handles HTTPS, scaling, and infrastructure automatically. Two million requests free per month.
-
1
CRC RevEng
Arbitrary-precision CRC calculator and algorithm finder
CRC RevEng is a portable, arbitrary-precision CRC calculator and algorithm finder. It calculates CRCs using any of the 113 preset algorithms, or a user-specified algorithm to any width. It calculates reversed CRCs to give the bit pattern that produces a desired forward CRC. CRC RevEng also reverse-engineers any CRC algorithm from sufficient correctly formatted message-CRC pairs and optional known parameters. It comprises powerful input interpretation options. Compliant with Ross Williams' Rocksoft(tm) model of parametrised CRC algorithms. -
2
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/ -
3
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. -
4
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. -
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
5
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 -
6
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. -
7
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. -
8
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 pair of stack and queue. ... -
9
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. -
Paessler - Monitor Your Whole Network in MinutesWaiting weeks for a monitoring rollout isn't an option when infrastructure doesn't stop running. PRTG's auto-discovery scans your network and suggests from over 200 pre-configured sensor types, so you're watching servers, applications and devices within minutes, not after a multi-week deployment. Enterprise-strength monitoring, without the enterprise complexity. Start your free trial today.
-
10
Visual Integer Factor
Puzzle game demonstrating whats so hard about binary integer factoring
...Draw a binary integer from a cell going upright, then explore the allowed transforms which may lead you to a factored state in 2 dimensions, from the lowest digit of the 2 odd integers both upright and upleft, its factors, and in the 2d space they are rectangle edges of, those pixels/digitbits must be on when there is an on bit somewhere downleft and downright after crossing empty cells, but if it finds either whole diagonal row empty then it must also be empty/zerodigit. The 2 main rules are: Any 2 cells below may both turn off and turn on the one above, or the reverse, and any on cell may move horizontally to an empty cell. -
11
GJSieve
A basic prime number sieve/tester.
If you are looking for the 64-bit version, find it here: http://sourceforge.net/projects/gjsieve/files/200/gjsieve203.exe/download GJSieve is a basic, yet full-featured sieve and tester for numbers of several classifications, including Proth, Cullen, and Woodall. GJSieve is built on the GNU Multiple-Precision (GMP) integer + rational library, and is available for both Windows and OSX. -
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
Noisy Channel Simulator
Demonstrate errors in transmission of a file over a noisy channel.
This program was written to dimonstrate errors in transmission for a presentation on Claude Shannon's Noisy Channel Coding Theorem. It takes an input file, the probability of a bit being flipped, and, if specified, the size of the header of the file. The program was intended to take monochrome bitmap files as input, so that each bit refers to a pixel in the image and thus, it would be easy to see errors in the output file, as some of the pixels would be flipped; however, it will work on any input file. -
14
...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.
-
15
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.
-
16
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.
-
17
Mandel is a command-line program for generating Mandelbrot set fractals - support for Julia sets is coming soon. Output is in the form of 8 bit greyscale Device Independent Bitmaps, which can be readily viewed with many common graphics programs.
-
18
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.
- Previous
- You're on page 1
- Next
