216,000+ customers in over 135 countries grow their businesses with HubSpot
Think CRM software is just about contact management? Think again. HubSpot CRM has free tools for everyone on your team, and it’s 100% free. Here’s how our free CRM solution makes your job easier.
Get free CRM
Red Hat Ansible Automation Platform on Microsoft Azure
Red Hat Ansible Automation Platform on Azure allows you to quickly deploy, automate, and manage resources securely and at scale.
Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
An Interactive Fiction Player written for Java Virtual Machine. It implements the Z-machine and Glulx specifications and can be used either standalone or as an applet. The Z-Code/Glulx interpreter runs adventures made by Infocom and contemporary Inte
This is a development code for computer science research. It implements a solver for compressible gas dynamics. The code is distributed-memory parallel using MPI and data-parallel using the OpenCL framework.
BLAS (Basic Linear Algebra Subprograms) is used to perform operations such as vector and matrix multiplication. LAPACK is buit using BLAS. This project is a beginning of BLAS functions and procedures for OpenCL language on GPU.
This Python 3.1 tool manipulates the coordinate system of CNC GCODE for machining or engraving. It can Flip X, Y, or Z coordinates, mirror X, Y, or Z coordinates, flip or Mirror both XY coordinates, or insert Z motions into a GCODE file devoid of them.
The project is aiming to do two things: track the total transit time it takes a news story to travel from site A to site Z across the net and we'll be indexing the content of the article at each hop and tracking the morphing of the content as it goes
A software assistant for manual stereo photo metrology, allowing the generation of 3D digital data (x,y,z) of objects of interest in stereo photos. 3D data can be used in CAD or other applications.
Visual Turing Machine is a tool for visually designing Turing machines. This means no coding in abstract scripting languages, but simple point&click design. It uses the a..z symbol set, plus the "empty" # symbol, and also simulates an infinite tape.
NOTE: Use Fltk_Contour insted this code! FMesh is a simply scientific data visualization tool based on OpenGL. FMesh can generate 2D and 3D graph of contour and color maps for any (x,y,z) scattered data set, many other options are included.
The project aims to provide the basic functions and algorithms
needed for computations in polynomial rings over the ring of
integers, including polynomial arithmetic and D-Groebner Bases.
It might evolve in some
kind of computer algebra system
A GTK+/Gnome2 graphical front end for the IW3HEV Vector Network Analyzer, also has a signal generator, and It displays graphicaly SWR, Phase, Return Loss, X impedance, Serial resistance, |Z| Impedanze, and Inductance, and capacitance.
GI-Gaia ist ein portables Framework zur Berechnung und Visualisierung verteilter Algorithmen (z. B. Bestimmung des größten gemeinsamen Teilers im Ring). Die konkreten Simulationen sind von den Basisdiensten getrennt und werden als Plugins nachgeladen.
ViPEC is an network analyser for electrical networks. It takes a schematic description of an electrical network, and performs a simulation of the circuit response in the frequency domain. Output is in the form of port parameters (S, Y and Z).
PPAT, or Parallel Path following Algorithm using Triangles, is a reliable parallel tool to trace the level curves of any continuous, not necessarily smooth, function f(z): C → R.
Blit contains a group of highly efficient iterative sparse solvers that can handle multiple right-hand-sides (i.e. block solvers). We will implement BLQMR, BLGMRES and other block algorithms in MATLAB, FORTRAN 90, C/C++, CUDA and OpenCL.
We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.