With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.
You 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.
Try free now
Grafana: The open and composable observability platform
Faster answers, predictable costs, and no lock-in built by the team helping to make observability accessible to anyone.
Grafana is the open source analytics & monitoring solution for every database.
pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.
A collection of practical tips can be found at the bottom of this page
...In July 2023, work on the second edition was announced, which expands the project with updated content, new problems inspired by recent big-tech interviews, and introductions to modern machine learning techniques such as XGBoost, CNNs, RNNs, and LSTMs. This collection serves both as a historical record of algorithm problem-solving and as a living resource for programmers preparing for interviews.
in-memory key value server with fuzzy search capabilities
Levin is an event-based key/value server based on radix-tree (space optimized trie).
Key search can be performed with an approximate key matching algorithm based on Levenshtein edit distance.
Eye candy showing parallel Conway's Life games in the bit planes of the screen, using boolean BitBlt operations. (Independently rediscovered algorithm given already in Smalltalk-80 Blue Book, by the inventors of BitBlt.)
It's a modern take on desktop management that can be scaled as per organizational needs.
Desktop Central is a unified endpoint management (UEM) solution that helps in managing servers, laptops, desktops, smartphones, and tablets from a central location.
This music player is supposed to be simple and all centered around an infinite intelligent queue (some other players call this PartyShuffle or DJ mode). You can manually add songs to it - but if you don't or the queue gets too short, it will automatically intelligently fill it with further songs.
The intelligent queue decision currently is based on:
* song ratings
* context-based choices, e.g. related songs more likely
Other features of this player:
* open source, simplified BSD...
This is a fast C implementation of Arturo Camacho's SWIPE' pitch extraction algorithm. See the project homepage for more about the advantages of the SWIPE' algorithm. swipe-1.0.tar.gz contains the current source, which should compile quite neatly.
Fast cython implementation of trie data structure for Python. Development is inactive, but moved to: http://github.com/martinkozak/cytrie.
The Peach Validator is a small program used verify the application of the Lhun's algorithm to s.i.n numbers. This program is designed to offer some insight into writting program wrappers or GUI applications with python.
PyPotrace is a Python programming language binding for Peter Selinger's Potrace raster to vector conversion algorithm. No separate Potrace library or application required!
Total Network Visibility for Network Engineers and IT Managers
Network monitoring and troubleshooting is hard. TotalView makes it easy.
This means every device on your network, and every interface on every device is automatically analyzed for performance, errors, QoS, and configuration.
python-stablesort is a back-port of the new Python 2.3 stable listsort algorithm to all Python versions (from 1.5.2 to 2.2.3). See the Project Home Page for more info.
A human-readable ISC-Licensed implementation of the LZO1X algorithm.
...Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed.
So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In addition, I will provide a textual description of the algorithm so that it can be easily ported to any programming language.
I expect a severe performance degradation, but I leave optimizing for speed to other people.