Sub-second maintenance. 2x read/write performance. Built-in vector search for AI apps.
Cloud SQL Enterprise Plus delivers near-zero downtime with 35 days of point-in-time recovery. Supports MySQL, PostgreSQL, and SQL Server.
Try Free
$300 Free Credits for Your Google Cloud Projects
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.
Math tools in Python to tackle down problems in Operational Research fields. Comes with a Django based web interface to allow remote access to complex simulation means.
Compliant and Reliable File Transfers Backed by Top Security Certifications
Cerberus FTP Server delivers SOC 2 Type II certified security and FIPS 140-2 validated encryption.
Stop relying on non-certified, legacy file transfer tools that creak under the weight of modern security demands. Get full audit trails, advanced access controls and more supported by an award-winning team of experts. Start your free 25-day trial today.
This project provides a set of Python tools for creating various kinds of neural networks, which can also be powered by genetic algorithms using grammatical evolution. MLP, backpropagation, recurrent, sparse, and skip-layer networks are supported.
Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator
ngram is a module to compute the similarity between two strings. It is different to python's "difflib.SequenceMatcher" in that it cares more about the size of both strings. ngram is an port and extension of the perl module called "String::Trigram
The project contains algorithms for locating the most central groups in complex networks. In particular implementations of various centrality measures and heuristic search algorithms. All functionality is exposed via XML-RPC for easier exploitation.
AppSignal's MCP server hands Claude, Cursor, or Zed your real errors, traces, and the deploy that shipped them. AI writes the fix; you review the diff.
This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.
The NUMIPAD library implements several methods/algorithms to solve inverse problems and adaptive decomposition (i.e. Tikhonov regularization, Total Variation, Basis Pursuit, etc.)
"Blue Planet" is a research project simulating the behaviour and darwinian evolution of unicellular lifeforms, each controlled by its own genetic program. Moreover, "Blue Planet Inhabitants" are suited for swarm intelligence and swarm research.
A threaded Web graph (Power law random graph) generator written in Python. It can generate a synthetic Web graph of about one million nodes in a few minutes on a desktop machine. It implements a threaded variant of the RMAT algorithm.
This is a Python script for Blender which uses short (quaternion-based, floretion-based) algorithms to draw curves in space. The user can create new shapes and curves by setting a variety of parameters.
The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.
TAROT is a easy-to-use framework for Monte Carlo simulations in python. Calculations between different kinds of randomly distributed numbers are made as easy as basic arithmetics. Tarot provides an interactive graphical interface for interpretation.
A simple (~20 line python) O(n^6) algorithm for the traveling salesman problem that seems to do pretty well for most graphs; so well that I have not been able to find a graph which it does optimally solve. Those with spare cycles are welcome to help out.
Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.
Automated computer program grading solutions designed for trainings on computer languages, data structures and algorithms. See http://openjudge.net for details.
A Python library for easy creation and manipulation of Google Earth KML and KMZ placemark files.
Please get your copy from http://pykml.cvs.sourceforge.net/viewvc/pykml/pykml/?view=tar
UIMP(Unified Image Manipulation Program) is an OS independent Image Processing system, which provides over 1000 algorithms and supports web online, console and GUI program.
SenseRank Sys:
- builds the dictionaries (multidim matrices) of words’ values;
- for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense