This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way.
Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for...
Simple Calculator for coherent sampling of sinusoids
A simple desktop application that is handy to calculate sampling parameters for sinusoidal waveforms.
There is one set of parameters for the source side, and another for the capture side. Once you arrive at suitable parameters for either side you can copy and paste to the other and calculate appropriate values.
Simple UI to test the effectiveness of a heuristic algorithm against the brute force method for path finding among an arbitrary number of arbitrarily placed points on a grid. This is an educational project, don't expect new and better methods.
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.
Virtual TI emulates nearly the entire line of Texas Instruments graphing calculators, and offers features that speed up both debugging and testing of calculator programs. Windows version is quite stable but the Linux/OSX version is only in planning.