Find out just how much your login box can do for your customer | Auth0
With over 53 social login options, you can fast-track the signup and login experience for users.
From improving customer experience through seamless sign-on to making MFA as easy as a click of a button – your login box must find the right balance between user convenience, privacy and security.
Sign up
PeerGFS PEER Software - File Sharing and Collaboration
One Solution to Simplify File Management and Orchestration Across Edge, Data Center, and Cloud Storage
PeerGFS is a software-only solution developed to solve file management/file replication challenges in multi-site, multi-platform, and hybrid multi-cloud environments.
GAAF is a tool for analyzing Genetic Algorithms (GA for short). It allows to check the behavior of a particular GA resolving a particular problem so one can get empirical information to decide which GA best fits problem's conditions.
Java package to study a clustering model described in the paper \"Novel Clustering Algorithm Based Upon Games on Evolving Network\" by Q. Li, Z. Chen, Y. He and J-P. Jiang (in arxiv: http://arxiv.org/pdf/0812.5064v1), generalizations and similar issues.
Java API for implementing any kind of Genetic Algorithm and Genetic Programming applications quickly and easily. Contains a wide range of ready-to-use GA and GP algorithms and operators to be plugged-in or extended. Includes Tutorials and Examples.
Transforming NetOps Through No-Code Network Automation - NetBrain
For anyone searching for a complete no-code automation platform for hybrid network observability and AIOps
NetBrain, founded in 2004, provides a powerful no-code automation platform for hybrid network observability, allowing organizations to enhance their operational efficiency through automated workflows. The platform applies automation across three key workflows: troubleshooting, change management, and assessment.
ECSKernel is a multiagent coordination algorithm testbed, built on the RoboCupRescue disaster simulation platform. It is easily configurable and can be used with user-generated scenarios.
Distributed Ant Robotics is divided into two parts. First is the simulation of “ant colony”. Second part is the algorithm application. Where you can use algorithms for ant behavior.
TBLTools is a set of GATE processing resources that implements the Fast Transformation Based Learning Algorithm. You can train it to learn rules for NLP tasks such as Named Entity Recognition and Shallow parsing.
A set of Java libraries for translating textual numbers (including cardinals, ordinals, etc.) between various language systems (e.g. Arabic, Indic, Chinese). Primary users will be developers of machine translation systems and curious desktop users.
TACS (Trust Ant Colony System) is a Trust model for P2P, Ad-hoc and Wireless Sensor networks (also valid for multi-agent systems) based on the bio-inspired algorithm ACS (Ant Colony System).
Build or enhance your payments stack, while maintaining control with an open-source, full-stack and modular infrastructure.
Juspay's Payments Orchestration Platform offers a comprehensive product suite for businesses, including open-source payment orchestration, global payouts, seamless authentication, payment tokenization, fraud & risk management, end-to-end reconciliation, unified payment analytics & more. The company’s offerings also include end-to-end white label payment gateway solutions & real-time payments infrastructure for banks. These solutions help businesses achieve superior conversion rates, reduce fraud, optimize costs, and deliver seamless customer experiences at scale.
A discretization algorithm based on the Minimum Description Length. Implemented as a filter according to the standards and interfaces of WEKA, the Java API for Machine Learning. More Info: http://bruno-wp.blogspot.com/search/label/Software
The Decision Tree Learning algorithm ID3 extended with pre-pruning for WEKA, the free open-source Java API for Machine Learning. It achieves better accuracy than WEKA's ID3, which lacks pre-pruning.Info: http://bruno-wp.blogspot.com/search/label/Softwar
Proposed is an algorithm
that uses computer vision, combined with a modified Rubine classifier, to allow
arbitrary N-sided polygons as accepted sketches in real-time.
Random Forest classification implementation in Java based on Breiman's algorithm (2001). It assumes the data is in the form [ X_1, X_2, . . ., X_M, Y ] where Y \in {0, 1, . . ., C}. The user must define M, C, and m initially.
Wodka is the implementation of a genetic algorithm (GA) that can bread two dimensional structures that might be used as robots in sodarace competitions.
RL HNFP is a neuro Fuzzy model which can automatic generate set of rule. So it can implement in domain although human don't have knowledge on it. This project implement that algorithm in Java so other people can use that for their application
The project implements Dana Angluin's learning algorithm with intent to look into the possibility of computational learning of changing (shifting) information.
DrPangloss is a python implementation of a three operator genetic algorithm, complete with a java swing GUI for running the GA and visualising performance, generation by generation
KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.
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.
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.
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.
The Drools.NET is a .NET port for Drools, which is a java Rules Engine based on Charles Forgy's Rete algorithm. Drools.NET enables .NET developers/Users to exploit the powerful Rule Engine like Drools through a completely managed .NET code base.
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.