Give your IT, operations, and business teams the ability to deliver exceptional services—without the complexity.
Freshservice is an intuitive, AI-powered platform that helps IT, operations, and business teams deliver exceptional service without the usual complexity. Automate repetitive tasks, resolve issues faster, and provide seamless support across the organization. From managing incidents and assets to driving smarter decisions, Freshservice makes it easy to stay efficient and scale with confidence.
Try it Free
Build Securely on Azure with Proven Frameworks
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
This project intends to create an indexing search engine, for knowledge management. The primary object is to apply an information retrieval core. And implement a knowledge data discovery theory such as data mining algorithm, text mining.
The TMpred program makes a prediction of membrane-spanning regions and their orientation. The algorithm is based on the statistical analysis of TMbase, a database of naturally occuring transmembrane proteins.
EMPEPA is software that permits to find the most likely rates of a PEPA model according to a set of sample executions by using the EM algorithm. It uses the GNU Scientific Library (GSL).
Lay a foundation for success with Tested Reference Architectures developed by Fortinet’s experts. Learn more in this white paper.
Moving to the cloud brings new challenges. How can you manage a larger attack surface while ensuring great network performance? Turn to Fortinet’s Tested Reference Architectures, blueprints for designing and securing cloud environments built by cybersecurity experts. Learn more and explore use cases in this white paper.
A basis for robot balance that eases the software development of balancing robots with a balancing engine. The DBE also will simulate physics locally on a desktop in Open GL to test the actual balancing algorithm or the client's ideas for a balancing ro
A Java implementation of the NEAT algorithm as created by Kenneth O Stanley. Also provides a toolkit for further experiments to be created and can provide both local and distributed learning environments.
Private-key, symmetrical (same password to encrypt and decode) file encryption with 8-bit to 2147483647-bit (2^3 to 2^31) encryption using my own algorithm and my own extension of MD5 (http://blog.robtoth.net/2009/06/tencryption-computer-programming.html
A compression engine based on the Huffman trie algorithm. The algorithm is pretty cpu-light, and as such, runs much more quickly than RAR or other 'heavy' algorithms, but could still achieve decent compression. Use with tar for multi-file archives.
StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms.
An intuitive user interface shows each algorithm step accurately...
Sales CRM and Pipeline Management Software | Pipedrive
The easy and effective CRM for closing deals
Pipedrive’s simple interface empowers salespeople to streamline workflows and unite sales tasks in one workspace. Unlock instant sales insights with Pipedrive’s visual sales pipeline and fine-tune your strategy with robust reporting features and a personalized AI Sales Assistant.
An object-oriented MATLAB toolbox for nonlinear filtering. Includes algorithms for SIR and SIS particle filters as well as an algorithm for the Extended Kalman Filter (EKF). Several discrete-time models are available. Comes with an easy-to-use GUI.
QMCMinimizer is a java-swing based aplication. It's designed with the purpose to be used as a tool on university degrees such as computer science, for teaching the process of boolean function simplification, through the Quine-McCluskey algorithm.
musicomp is a program which most important element is an evolutionary algorithm which uses data mining methods as a fitness function to generate monophone melodies.
An optimised client-side implementation of the rsync algorithm. It allows updating of files from a remote web server, with efficiency approaching that of rsync -z, without requiring a special remote server application.
This work was a project done in course of the Summer School on Image Processing 2006 (SSIP) in Szeged,Hu. Performs a snake algorithm on 512x512. Image processing tasks are done with OpenCV and the GUI is implemented with Qt4.1.
jGABL (the Java Graph Algorithm Base Library) is a java library for the implementation of graph algorithms. It covers a hierarchy of graph concepts, various graph implementations, and algorithm animation.
N-stage worm propagated via SSH. It executes commands in a given list of hosts and copies files to them with rsync. The paths for its propagation to the cluster are configurable. It offers a scalable/reliable transport API thanks to its adaptive algorithm
This is an attempt to make a X vs. O game, without using a back-tracing, or any other time wasteful algorithm. Instead, an arrays of bonuses are used. Bonuses are given for each move, after which empty fields are sorted.
Military Survelliance open source GPS with Filters(like night vision,Sharpening location,Contrast) with optimal route finding algorithm embedded in the application developed in java.
Real-Time Proactive Secret Sharing Library for RTAI is an implementation of the Shamir's secret sharing scheme and Herzberg's proactive secret sharing algorithm. The library uses a port of GNU GMP in order to make multiple precision arithmetic operatio
MacMakk is a tournament management program for go, the asian boardgame. It uses a new ranking algorithm, called McMakko. It is intended to be portable, with Linux and Windows being the main targets.
The implementations of finding the k shortest paths (KSP) algorithm. A C/C++ library including some classical graph relative algorithm implementations.
In imitative learning, an agent will attempt to match what is observed to their memory. By visualizing the incorrectly matches "scenes", this project will allow algorithm developers to gain a better understanding of what causes their algorithms to fail.
Garbage collection for C++. Small portable library that can even be multithreaded (with some restrictions). It uses the mark & sweep algorithm. No dependencies. Provides garbage-collected array class; provides wrapper class for external classes.