Search Results for "algorithm" - Page 15
Sort By:
Showing 2045 open source projects for "algorithm"
View related business solutions-
Our Free Plans just got better! | Auth0You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
-
FusionAuth: Authentication and User Management SoftwareFusionAuth adds login, registration, SSO, MFA, and a bazillion other features to your app in days - not months.
-
1
mapska
The Murder Accountability Project's Serial Killer Algorithm
Algorithm: Copyright (c) 2010, 2016 and 2017 - Murder Accountability Project. License: GNU General Public License (GPL) version 3. -
2
AmPEP and AxPEP
Sequence-based Antimicrobial Peptide Prediction by Random Forest
...However, identification of AMPs through wet-lab experiment is still expensive and time consuming. AmPEP is an accurate computational method for AMP prediction using the random forest algorithm. The prediction model is based on the distribution patterns of amino acid properties along the sequence. Our optimal model, AmPEP with 1:3 data ratio achieved a very high accuracy of 96%, MCC of 0.9, AUC-ROC of 0.99 and Kappa statistic of 0.9. AmPEP outperforms existing methods with respect to accuracy, MCC, and AUC-ROC when tested using the benchmark datasets. ... -
3
AcoPath
Ant Colony Optimization algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of the Ant System is that virtual ants are exploited for finding paths with a specific property, e.g., short distance between physical nodes, in the same way nature guides physical ants. Development takes place at https://github.com/zfoxer/AcoPath -
4
PsoPath
Particle Swarm Optimization algorithm for the shortest path problem
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. The basic idea of Particle Swarm Optimization is the emulation of the social behaviour of, e.g., a flock of birds, as a stochastic optimisation method. Specifically, a particle is an entity representing a solution in the search space. Several particles cooperate... -
Next-Gen Encryption for Post-Quantum Security | CLEAR by Quantum KnightCLEAR by Quantum Knight is a FIPS-140-3 validated encryption SDK engineered for enterprises requiring top-tier security. Offering robust post-quantum cryptography, CLEAR secures files, streaming media, databases, and networks with ease across over 30 modern platforms. Its compact design, smaller than a single smartphone image, ensures maximum efficiency and low energy consumption.
-
5
LaPath
Learning Automata algorithm for the shortest path problem.
The shortest path problem is solved by many methods. Heuristics offer lower complexity in expense of accuracy. There are many use cases where the lower accuracy is acceptable in return of lower consumption of computing resources. Learning Automata (LA) are adaptive mechanisms requiring feedback from the executing environment to converge to certain states. In the context of network routing, LA residing at intermediate nodes along a path, exploit feedback from the destination node for... -
6
The Kinetic Simulation Algorithm Ontology (KiSAO; http://co.mbine.org/standards/kisao) is an ontology of algorithms for simulating and analyzing biological models, as well as the characteristics of these algorithms, their input parameters, and their outputs. In addition, KiSAO captures relationships among algorithms, their parameters, and their outputs. Development of KiSAO has moved to https://github.com/SED-ML/KiSAO/.
-
7
Polar Bookshelf
A personal knowledge repository for PDF and web content
...Save time in creating flashcards in one click from text highlights. We use OpenAI's GPT-3 to automate this tedious process. Review them with our spaced repetition algorithm or sync them to Anki. Manage and save for later all your PDFs, EPUBs, and web pages in one place. Use tags, reading progress, and detailed document information to stay on top of your reading. Use the integrated reader to actively read, highlight, take notes, connect thoughts, and track progress with pagemarks. Build your detailed knowledge base with granular highlight tagging, and flashcards, directly from text highlights. ... -
8
muditulib
a multi-dimensional tuning library
Muditulib, a multi-dimensional tuning library, is a library to be implemented (wholly or partly) in music production software. It consists of a core of C functions. Additionally a Pure Data implementation is provided. This implementation consist of several classes to be used as a modular system. The library makes use of a multi-dimensional numerical pitch representation system, a variant of the very well-known one-dimensional MIDI note system. Ambitions for other implementations are very... -
9
IBANManager
IBANManager library
This library allows you to validate IBAN codes and print in human-friendly format and paper format. -
Turn traffic into pipeline and prospects into customersDocket is an AI-powered sales enablement platform designed to unify go-to-market (GTM) data through its proprietary Sales Knowledge Lake™ and activate it with intelligent AI agents. The platform helps marketing teams increase pipeline generation by 15% by engaging website visitors in human-like conversations and qualifying leads. For sales teams, Docket improves seller efficiency by 33% by providing instant product knowledge, retrieving collateral, and creating personalized documents. Built for GTM teams, Docket integrates with over 100 tools across the revenue tech stack and offers enterprise-grade security with SOC 2 Type II, GDPR, and ISO 27001 compliance. Customers report improved win rates, shorter sales cycles, and dramatically reduced response times. Docket’s scalable, accurate, and fast AI agents deliver reliable answers with confidence scores, empowering teams to close deals faster.
-
10
ModST
A tool to search post-translational modifications in a blind mode
ModST (pronounced as modest) is a tool to search post-translational modifications (PTMs) in mass spectrometry data in an unrestrictive manner. It can search for hundreds of modification without any user provided information for variable modifications. Due to data level parallelization implemented through perl it is fast, portable and easy to use to identify and analyse PTMs in MS/MS data. -
11
Soma-direct
System Omnichannel Marketing Analysis
Soma - System Omnichannel Marketing Analysis is an open-source solution for simplifying the processes of analyzing and predicting consumer behavior. With Soma, you can combine data from multiple systems and channels in the profile joining process. Interactions and behaviors registered as a part of a unique user create and show what a Customer Journey looks like. The data is subjected to an analysis process which enables the examination of the significance of individual touchpoints for the... -
12
clzw
Implementation of LZW compression algorithm in C
Simple, fast implementation of LZW (Lempel–Ziv–Welch) data compression algorithm in C. - Console encoder/decoder tools - OS independent - Could be used in embedded projects - Works with raw code-stream LZW features: - Hardcoded dictionary size - Variable code size - Code search is performed by hash table and embedded in dictionary linked lists (encoder) - No dynamic memory allocation -
13
Blackfriday
Blackfriday, a markdown processor for Go
...Blackfriday itself does nothing to protect against malicious content. If you are dealing with user-supplied markdown, we recommend running Blackfriday's output through HTML sanitizer such as Bluemonday. Blackfriday includes an algorithm for creating sanitized anchor names corresponding to a given input text. This algorithm is used to create anchors for headings when EXTENSION_AUTO_HEADER_IDS is enabled. The algorithm has a specification, so that other packages can create compatible anchor names and links to those anchors. -
14
Abdal AES Encryption
AES Message Encryption Tool
...AES stands for Advanced Encryption Standard, which was developed in 2001 by the US National Institute of Technology and Standards. The advanced encryption standard is accepted by the US government and is now used worldwide. This encryption algorithm replaces the Data Encryption Standard (DES) published in 1977. -
15
Taxamatch
Fuzzy name matching algorithm for scientific names of taxa (biology)
...Since ED-based queries are typically slow against large data sets, Taxamatch includes a range of optimisations to heavily reduce the number of names to be tested at query time without impacting on recall of likely intended correctly spelled target names, speeding up overall query time by a factor of between x100 and x1000. For a more complete discussion of the algorithm, refer to this journal article published in 2014: "Taxamatch, an Algorithm for Near (‘Fuzzy’) Matching of Scientific Names in Taxonomic Databases". https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0107510 -
16
Algorithmic Pseudocode
This repository contains the pseudocode(pdf) of various algorithms
This repository contains the pseudo-code of various algorithms and data structures necessary for Interview Preparation and Competitive Coding. The pseudocodes are written such that they can be easily adapted to any language. Let us remove the clutter of language and focus on the core concepts of the question. -
17
Base62 Encode/Decode Utility
A tool for encoding/decoding to base62
...the base62 program has been written to encode/decode files into this format. The syntax is similar to the popular base64 command line program. Inside the package there is a working c++ version of the base62 algorithm. the sources are inside the package. Note that from release 2.0.0 the algorithm is different from the one used before. If you have coded a file using base62 < 2.0.0 DO NOT USE base62 >= 2.0.0 to decode it. The 2.0.1 release has a new algorithm for chew, we have a compat flag -
18
Helpdezk
HelpDEZk is a powerfull software that manages requests/incidents.
HelpDEZk is a powerfull software that manages requests/incidents. It has all the needed requirements to an efficient workflow management of all processes involved in service execution. This control is done for internal demands and also for outsourced services. HelpDEZk can be used at any company’s area, serving as an support to the shared service center concept, beyond the ability to log all the processes and maintain the request’s history, it can pass it through many approval... -
19
JDS: Data Security
JDS is a powerful data protection program
JDS is a powerful tool for data protection. Documents are encrypted using a special algorithm. The data encryption algorithm is constantly updated to improve security. The program also provides other functions. Such as sending a file to a vault with password access, fast text encryption in 3 types, and much more. The program is easy to use and does not require special knowledge. The standard version has 2 languages (Russian and English) and 9 themes. -
20
Zipline
Zipline, a Pythonic algorithmic trading library
Zipline is a Pythonic algorithmic trading library. It is an event-driven system for backtesting. Zipline is currently used in production as the backtesting and live-trading engine powering Quantopian -- a free, community-centered, hosted platform for building and executing trading strategies. Quantopian also offers a fully managed service for professionals that includes Zipline, Alphalens, Pyfolio, FactSet data, and more. Installing Zipline is slightly more involved than the average Python... -
21
DISTOD
Distributed discovery of bidirectional order dependencies
The DISTOD data profiling algorithm is a distributed algorithm to discover bidirectional order dependencies (in set-based form) from relational data. DISTOD is based on the single-threaded FASTOD-BID algorithm [1], but DISTOD scales elastically to many machines outperforming FASTOD-BID by up to orders of magnitude. Bidirectional order dependencies (bODs) capture order relationships between lists of attributes in a relational table. -
22
localResizeIMG
The front-end local client compresses pictures, compatible with IOS
...I have stepped on many pitfalls, after several version iterations, as well as the feedback and help of many netizens, and model testing. The picture is distorted, some devices do not automatically rotate the direction of the picture, and there is no jpeg compression algorithm. New Blob is not supported, and the size of the file constructed by formData is 0. There are also inexplicable bugs in some models and browsers (such as QQX5 browser). On-demand loading (JS files will be automatically loaded asynchronously according to the corresponding device, saving unnecessary bandwidth) -
23
zstd for Windows
A fast lossless compression algorithm and data compression tool
Zstandard, or zstd as short version, is a fast lossless compression algorithm, targeting real-time compression scenarios at zlib-level and better compression ratios. It's backed by a very fast entropy stage, provided by Huff0 and FSE library. The project is provided as an open-source dual BSD and GPLv2 licensed C library, and a command line utility producing and decoding .zst, .gz, .xz and .lz4 files. -
24
Supervised Reptile
Code for the paper "On First-Order Meta-Learning Algorithms"
...Because Reptile is a first-order algorithm, it avoids computing second derivatives or full meta-gradients, making it computationally simpler while retaining good performance. The repo includes training scripts, dataset fetchers (Omniglot, Mini-ImageNet), and modules for defining the Reptile update logic, variables, and hyperparameters. -
25
Gap-SPH
Basic SPH solver for 3D subsonic fluid flow models
...Viscosity is updated every half-time step to account for nonlinear behavior of one of the phases and all solid boundaries are modeled using the virtual particle method. A basic all-pair search algorithm is used to determine pair lists. The purpose of this self-contained solver is to further develop the code to optimize it to the case of river bedload dynamics. Parallel programming directives have been added where applicable. No GUI for pre- or post- processing is provided yet.
