Search Results for "calculate linux"

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...

Efficient indexing and searching (1M Weibo 500M data is indexed in 28 seconds, search response time is 1.65 milliseconds, and search QPS is 19K). Support Chinese word segmentation (concurrent word segmentation using the sego word segmentation package, speed 27MB/sec). Support to calculate the proximity distance of keywords in the text (token proximity). When a request to add a document to the index comes in, the main coroutine will send the text to be segmented to a word segmentation...

UProm Requirement Management System (traceability and requirement coverage). Includes : - An admin module to manage SCRUM Project and tree of requirements - A multi-user Web-based client - Tools for databases management (HSQLDB, PostGreSQL,...) UProm