With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
Try free now
Gen AI apps are built with MongoDB Atlas
The database for AI-powered applications.
MongoDB Atlas is the developer-friendly database used to build, scale, and run gen AI and LLM-powered apps—without needing a separate vector database. Atlas offers built-in vector search, global availability across 115+ regions, and flexible document modeling. Start building AI apps faster, all in one place.
JTransforms is the first, open source, multithreaded FFT library written in pure Java. Benchmark results show better performance than FFTW. The latest version is available at http://github.com/wendykierp/JTransforms.
NoteLab is an advanced "digital notebook" specifically designed for tablet computers. With its stroke smoothing, antialiasing, and "smart rendering," NoteLab provides a beautiful and powerful note taking environment on any operating system.
Full access to Enterprise features. No credit card required.
What if You Could Automate 90% of Your Repetitive Tasks in Under 30 Days? At ServoDesk, we help businesses like yours automate operations with AI, allowing you to cut service times in half and increase productivity by 25% - without hiring more staff.
OpenForecast is a package of general purpose, forecasting models written in Java that can be applied to any data series. No knowledge of forecasting is required. Using this package, the most appropriate algorithm for your data will be selected.
Java ILP is a simple java interface to (mixed) integer linear programming solvers such as lp_solve, Glpk, Gurobi, SAT4J (0-1 ILP), MiniSat+(0-1 ILP), CPLEX, or Mosek. (documentation at http://javailp.sourceforge.net/)
Geom4J is a computational geometry library for Java. It contains implementation of the most important computational geometry data structures and algorithms coded in pure Java, designed for ease of use and optimized for performance.
HcryptoJ (Historical cryptology in Java) is a Java based programming library for implementing and analyzing historical ciphers. HcryptoJ is designed to support research and teaching in historical cryptography and computer science. Licensed under GPL.
Mark Six Analyst is a database of Hong Kong Lottery or so-called Mark Six. It provides a tool of various statistics method to show relationships between data and forecasts.
The final build of this software now is distributed in R, embedded in "RedeR': an R/Bioconductor package for hierarchical and nested network analysis... more about RedeR: http://bioconductor.org/packages/2.9/bioc/html/RedeR.html
The program simulates N trials of the Monty Hall Problem and outputs the successes of both switching and not switching the doors. http://en.wikipedia.org/wiki/Monty_Hall_problem http://www.youtube.com/watch?v=cXqDIFUB7YU
swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).
Numerical math is tool that demonstrates numerical math methods. It includes following areas: interpolation, numerical differentiation, numerical integration, root finding, linear systems, non-linear systems, differential equations.
A program to calculate and create lists of possible variations (permutations) and selections (combinations) of a given set of elements. Creating the cartesian product of two sets is also possible.
Parallel Colt is a multithreaded version of Colt - a library for high performance scientific computing in Java. It contains efficient algorithms for data analysis, linear algebra, multi-dimensional arrays, Fourier transforms, statistics and histogramming
This program accompanies the paper "Counting large distances in convex polygons" by Filip Moric and David Pritchard. The program, written in Java, searches a finite set of distance configurations in order to deduce theorems about convex polygons.