Search Results for "use case"

...This process repeats until there is no carry, adding an additional rune if necessary. ToCamelCase is to convert words separated by space, underscore and hyphen to camel case.

...Extendable Output (XOF) — supports arbitrary output length (256–8192+ bits). Post-quantum oriented design — ARX-based sponge resistant to Grover-type attacks. Context and salt separation — unique hashing domains for each use-case. Optimized performance — ~120–130 MB/s Comprehensive verification — verify_all.sh performs KAT tests, determinism checks, and performance validation. Verification Script: chmod +x verify_all.sh ./verify_all.sh https://github.com/01alekseev/PetoronHash-System Ivan Alekseev | petoron.org

Progressive Function Point Analysis Book Released: Print Copy: http://www.amazon.com/Progressive-Function-Point-Analysis-Estimation/dp/1502354160 EBook: http://www.amazon.com/dp/B00NH0MMAG Please support this project and its future releases ! Managers provide the architect/teams with project requirements. The architect/team returns detailed task list with estimated man hours per task making life easier for Project Managers with less guesstimates and proper business/technical process...

A collection of algorithms for querying a set of documents and returning the ones most relevant to the query. The most common use case for these algorithms is, as you might have guessed, to create search engines.

...Each snippet aims to be self-contained and easy to study, with clear inputs, outputs, and the essential logic on display. The catalog format lets you scan for an example, copy it, and adapt it to your use case without wading through a large framework. It favors clarity over micro-optimizations so learners can grasp the idea before worrying about edge performance. Over time it becomes a personal cookbook of solutions you can remix across projects. This approach is especially helpful when you need a quick refresher on a technique you haven’t used in a while.

We developed a systematic algorithmic solution for quantitative drug sensitivity scoring (DSS), based on continuous modeling and integration of multiple dose-response relationships in high-throughput compound testing studies. License: The DSS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to a DSS publication. Citation: Yadav et al. (2014), Quantitative scoring of differential drug sensitivity for individually optimized anticancer therapies. ...

An open-source implementation of our network-based target deconvolution approach, named target addiction score (TAS). License: The TAS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to the publications below. Citation: Yadav B, Peddinti G, Pemovska T, Khan SA, Szwajda A, Tang J, Wennerberg K and Aittokallio T. ...

...We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. ...

...This Java implementation implements our ESM algorithm. See README file: https://sourceforge.net/projects/esmalgorithm/files/ If you use our ESM implementation to support academic research, please cite the following paper: Haibin Liu, Vlado Keselj, and Christian Blouin. Exploring a Subgraph Matching Approach for Extracting Biological Events from Literature. Computational Intelligence, 2013.

WordSort is an algoritm written in c# specifically designed for string sorting with linear complexity. Based on partial hashing approach, provides higher performance than classical algorithms that use the comparison. WordSort includes a console application easy and intuitive to use to evaluate and compare algorithms performance. Only Ordinal sorting and non-case-sensitive sorting provided.