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
Your monitoring isn't a stack. It's a pile. Fix that.
Errors, performance, logs, uptime. One install, one invoice, one UI.
Replace Datadog, New Relic, and Sentry without adding three more dashboards.
Description and detailed explanation on Fourier Transform, some FFT, LPC etc. Runable project demonstrates DCT transform on continuous audio, show and edit audio source with different zooming and view.
The program enables to get performance of C/C++ program for any metric
The program enables to get performance of C/C++ program and separated pieces of code for any metrics (for instance : time, memory, metrics defined by user etc.). The measurement results are represented in detailed/summary reports.
Latest Version: 2.10
OpenSHORE is an XML based Semantic Document Repository (SDR) with a free definable meta model that builds up a semantic network from sections and relations in documents. The acronym SHORE means Semantic Hypertext Object Repository.
Put idle assets to work with competitive interest rates, borrow without selling, and trade with precision. All in one platform.
Geographic restrictions, eligibility, and terms apply.
Based on the Buckwalter Morphological Analyzer (Version 1.0) for doing Arabic stemming and POS tagging. Includes a rewrite of the original Perl script, with better documentation and more flexible options, and a C++ interface (usable as a library or app).
UIMA solution for analysing web-server logs, that does things like analyze the user behavioral patterns in the channels followed by users from the log files, report current and the past behaviour of the visitors in selfservice systems.
A toolkit for crawling information from web pages by combining different kinds of "actions". Actions are simple operations such as navigation to a specified url or extraction of text from the html. Also available is a graphic user interface.
The Unstructured Information Management Architecture (UIMA) Framework is an open, scalable and extensible platform for building analytic solutions that process unstructured information to find latent meaning, relationships and relevant facts.
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.
Refal.NET - Versatile, Compact yet Powfull Text Transformer and Compiler-Writing System. Based on Refal.NET Virtual Machine (+Refal.NET Compiler), this RAD-tool might be used for rapid prototyping, decreasing up to 10 times development efforts.
The Text Annotation Environment (tae) can be used to annotate natural language text manually or automatically (UIMA Annotator) with meta information (tokens, part-of-speech, named entities, ...). Tae is based on Eclipse and IBM's UIMA.
Graph representation of the parapsychological (scientific) models and propositions. The graph will help to visualize the relation between the diferent hypothesis and estimates the level of confidence of a given hypothesis or model.
The bandit project is a repository of the various known algorithmic solutions for the multi-armed bandit problem. The project is also a repository of several datasets that could be used for benchmarking purposes.
The algorithm allows any kind of weights (costs, frequencies), including non-numerical ones. The {0, 1, ..., n-1} alphabet is used to encode message. Built tree is n-ary one.The algorithm is based on a set of template classes : Cell(SYMBOL, WEIGHT), Node(
The Annotation Graph Schema API aims to aid developers in the creation and querying
of Annotation bases where the use of XML-based tools is needed. It is easily integratable with any persistent representation and has a flexible in-memory model.
This is a project to create a compiler that converts grammars written in SRGS standard (http://www.w3.org/TR/speech-grammar/) to a graph understandable by HMM based ASR engines. Check srgs-parser.sf.net