Search Results for "git:/git.code.sf.net/p/docfetcher/code" - Page 8
Sort By:
Showing 181 open source projects for "git:/git.code.sf.net/p/docfetcher/code"
View related business solutions-
DriveStrike: Remote Wipe | Data Breach ProtectionDriveStrike protects devices and data in the event of loss, theft, or use in remote locations. Remotely locate, lock, and wipe devices you manage to prevent data compromise. DriveStrike prevents data breaches to ensure confidentiality, compliance, and a competitive edge.
-
Monitor production, track downtime and improve OEE.Evocon is a visual and user-friendly OEE software that helps manufacturing companies improve productivity and remove waste as they become better.
-
1
The Random Bit Generator Test Suite will take in large blocks of binary data and attempt to tell the user what is not random about them. Code developers, mathematicians and statisticans welcome to help.
-
2
The code in this project is incomplete and buggy in parts. It has been superseded by the math packages I wrote for PEAR (pear.php.net). Use those instead (see the Math section of the packages list). -- Jesus M. Castagnetto
-
3
Project moved to Google Code since SourceForce is a broken, buggy, non-responsive service. I had to re-log in over 100 times just to change this description. Please visit the project at http://code.google.com/p/starflighttlc/ for the latest version of th
-
4
This is an ocaml binding for LevMar Minimization library. The library offers minimization from IR^n to IR^d finding the point which minimizes the distance ||f(p)-x0|| where x0 is the solution in the image space. The binding enables to use ocaml functions
-
SOCRadar Extended Threat Intelligence PlatformSOCRadar Extended Threat Intelligence, a natively single platform from its inception that proactively identifies and analyzes cyber threats with contextual and actionable intelligence.
-
5
Improving the speed of the signal analysis code for Seti@home. Leveraging modern processors advanced features such as SIMD and parallel execution units, as well as identifying better methods to code existing functions.
-
6
Fast-Fourier-Transform-based number theory code to test Mersenne numbers for primality using the Lucas-Lehmer test and the Crandall-Fagin irrational-base discrete weighted transform (IBDWT) algorithm (Math. Computation 62 (205), pp.305-324, January 1994)
