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
Ship Agents Faster
Transform your applications and workflows into powerful agentic systems at global scale.
Gemini Enterprise Agent Platform lets you rapidly build, scale, govern and optimize production-ready agents grounded in your organization's data. The platform enables developers to build custom or pre-built agents for virtually any use case. New customers get $300 in free credits.
ScapeToad is an easy to use application for the cartogram creation. Cartograms are deformed maps where the polygon size is proportional to a given statistical value. ScapeToad reads and writes Shapefiles.
See <https://github.com/christiankaiser/ScapeToad> for the latest version of the code.
E-Learn system, mostly intended for subjects with mathematical base (which supports algorythm). Supports: solving math tasks, theory pages, tests, courses.
A Java application/library that can generate PNG tile overlay images for Google Maps from multiple data sources. Inactive because there are better alternatives: Java - http://geotools.codehaus.org/ PHP - http://www.mapserver.org/
Integrate the power of the fully AJAX enabled technology of ICEfaces into the framework of the ESRI WebADF. No need to code in Javascript or to handle XML communication to build AJAX functionalities. OnlineDemo: http://www2.pch.etat.lu/pchViewer
The program system JCASim is a general-purpose system for simulating cellular automata in Java. It includes a stand-alone application and an applet for web presentations.
RGDicom is a Java viewer of medical images (DICOM - Digital Imaging and Communications in Medicine). It allows direct connection with the medical devices, therefore it implements DICOM 3.0 protocol and includes a lot util features, like edit the images.
A free, open source, artificial life, genetic evolution simulation in which small creatures called Neds roam the world, mate with one another, harvest food, eat and eventually die.
Re-searcher is the system for recurrent psiblast searches. It enables timely detection of new proteins on the protein sequence databases. Searches can be done on a local server or at NCBI. It has a user-friendly web interface.
An effort to create free and open enviroment, to build complex "rail world", including all rail technology lovers' interests - locomotives (steam, diesel, electric) - driving or documentation, physics, traffic control, etc.
IFS Tools is a set of Java applets for the interactive, graphical construction of iterated function system (IFS) fractals. Output is in the form of IFS code and graphics.
WOOKI is a peer-to-peer wiki. It based on unstructured p2P network with data replication. WOOT framework synchronizes data. SWOOKI is a semantic extenion of WOOKI. It is implemented as a plugin of WOOKI. SWOOKI is peer-to-peer semantic wiki.
The TandemSearcher is a Java based application for searching for tandem repeats in the DNA sequences. It is based on the Burrows-Wheeler Transform (BWT).
This is a simulation for x-plane pilots and controllers. It simulates the whole ATC in Switzerland. Included are: ATMS(the server), ATMC(for controllers), PilotClient(for pilots) amd PlaneSim(simulates planes).
Knotwork is a graphical application to create knotworks in a celtic, arabic or viking style. User draws a graph defined by vertices and edges, which gives the basis for building the knotwork. Web page: http://knotwork.sourceforge.net/index.html
Input method based on Java(TM) Input Method Framework(IMF). To install,copy it to "jre/lib/ext", use it as "Chinese Pinyin" IME in any java swing applications. "Japanese" IME is also provided.
Processes boolean functions which can be provided either as a list of 0s and 1s or which can be provided as a formula in first-order logic (using disjunctive or conjunctive normal forms). Internally the Quine McCluskey algorithm is used.
Extraction of binding sites of ligands and search for unknown binding sites on apoproteins. Some call it docking. Some call it binding site detections. Some call it knowledge based.