Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.
Launch 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.
Start Free Trial
Our Free Plans just got better! | Auth0
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.
SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.
MAPONTO is an interactive tool for discovering semantic mappings between database schemas and ontologies as well as between different database schemas. The tool analyzes semantics in the input schemas and ontologies for generating semantic mappings.
JoSQL (Java Objects SQL) provides SQL capabilities for querying, ordering and grouping of collections of Java objects (POJOs). It allows a SQL statement to be applied to the collection of objects and the matching set returned, ordered and grouped.
Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.
Fast search using a standard SQL on Oracle or PostgreSQL database. The package includes the database creator, loader and web application. It supports SMILES and SMARTS substructure searches, similarity search, stereochemistry.
TimeFinder automatically optimizes schedules (timetables) for universities and high schools. It makes manual timetabling for the timetabler easier via a Java GUI. Export+import is supported via xml and text formats. http://timefinder.sourceforge.net/
XPN is relies on a non relational native XML database, where XML documents are stored in a compressed form and indices enables fast access to structure and content, thus enabling a fast evaluation of XQuery queries.
Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.
Classroom allocation using Genetic Algorithms and restricted mutation. Developed by AIGroup: Pablo Cababie, Facundo Cancelo, Alvaro Zweig y Gabriel Barrera
Tpl makes it easy to serialize your C data using just a handful of API functions. The data is stored in its native binary form for maximum efficiency. C, Perl and XML supported. Data is portable across CPU types and OS's from Unix to Mac to Windows.
This library implements several locality sensitive hashing(LSH) based algorithms, including indexing data structure for high dimensional spaces and metric spaces, sketch constructions and set embedding algorithms.
Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!
The Simple, Scalable, Script-based Science Processor for Measurements (S4PM) is a system for highly automated processing of science data, scalable up to large processing systems and scalable down to small, special-purpose processing strings.
It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.
Cutting Problem solved by Genetic algorithms. The goal is to cut a rectangular plate of material into more smaller rectangles. The cuts must be rectangular and guillotinable.
The Open Optimization for Java provides a framework and the implementation of commonly-used algorithms found in Graph Theory and Network Optimization, e.g. shortest path and postman problem.
Openminer, as a data mining engine, is developed on java for analysis of dataset with the methods of data mining. By making use of openminer, we could discovery the knowledge which interests us but hides in the raw data.
An attempt to design minimum cost broadband networks with the use of a modified version of the Particle Swarm Optimization method. A GIS subsystem is used for the visualization of data and results.