Open Source Algorithms - Page 45

The SBMLevolver is an evolutionary algorithm package that creates SBML models with user-specified properties and behaviour from a given set of building blocks. Applications lie in network reconstruction and synthetic biology.

SCS - Simple Contest System - is a system for makieing Programming contests in simple way.

Standard Compression Scheme for Unicode. Implementation for PHP and JavaScript. See <http://www.unicode.org/reports/tr6/> for detailed information about SCSU. Suitable for better LZF compression for UTF-8 strings Based on Java source of SCSU by Unicode, Inc. <http://www.unicode.org/reports/tr6/> Working example <http://javascriptarchiver.org/>

SDL_Collide is a simple 2D collision detection library for SDL supporting pixel perfect collision tests between surfaces, bounding box collision checks and circle intersection routines.

Search Agents - a framework for collaboration of meta-heuristic agents

Open Source Tool for Search Engine Optimization (SEO & SEM) used for automatic content processing. These SEO Content Genrators and Article Writers based on Text Writer: https://www.artikelschreiber.com/en/ https://www.unaique.net/en/ https://www.unaique.com/ https://www.artikelschreiben.com/ https://www.buzzerstar.com/ https://googleduplicatecontentsolver.sourceforge.io/ https://inkassos.github.io/inkasso/ https://www.artikelschreiber.com/opensource/ https://www.sebastianenger.com/ https://www.artikelschreiber.com/marketing/review/ https://muckrack.com/markus-muller https://linktr.ee/textgenerator Code Contains: - Perl Source code, language databases and more

In Computer Science, SHOBHIT-Advance String Search Algorithm is a string searching algorithm created by SHOBHIT UPADHYAYA in 2013. He is working as a Software Developer in Bangalore India. “This algorithm uses the first and last index of the substring for a pattern search.” TIME and SPACE Complexity: For a text of length n and substring of length m. Its best case, time complexity is O(m/2) and in worst case, time complexity is O(n – (m/2) ). In all the cases best, average and worst its space complexity is O(1). This algorithm checks two characters at a time. In best case where the substring is at the start of the text, we can check all the character of substring in only m/2 time. In worst case where the substring is at the last of the text, we need to iterate till n – m For more information please visit the following link:- http://learandexperiment.blogspot.in

SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.

SMSCompress is a project of investigation, development and implementation of different SMS compression techniques. Using these techniques, SMS of more than 160 characters can be sent at only one SMS, saving money to the user ;)

Makes self-orthogonal diagonal Latin squares, SODLS, for all valid orders, (that is, not order 2, 3, or 6). Input is an order, (one number), or an order range, (two numbers separated by white space). Output files are in folder SODLS[_n]. Each file contains a SODLS followed by a magic square. The magic square, M, is made from the order N SODLS, Q, and its transpose, as: M[row][col] = N x Q[row][col] + Q[col][row] + 1 See http://budshaw.ca/SODLS.html http://budshaw.ca/addenda/SODLSmethods.html http://budshaw.ca/addenda/SODLSnotes.html http://budshaw.ca/Download.html#sodls

SPar is an internal C++ Domain-Specific Language (DSL) suitable to model and implement classical stream parallel patterns. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. Latest version can be downloaded from the SVN using the following command: svn checkout svn://svn.code.sf.net/p/spar-dsl-compiler/svn/ spar

SSEPlus is a SIMD function library. It provides optimized emulation for newer SSE instructions. It also provides a rich set of high performance routines for common operations such as arithmetic, bitwise logic, and data packing and unpacking.

Sterobil is a project used to build a 3D model from photographic pictures, based on the principle of photogrammetry. This project was developped by ECE students, in collaboration with the C2RMF.

This is a fully STL-compliant C++ map/set/multimap/multiset implementation for g++ using an AVL tree instead of a Red-Black tree (that is present in current libstdc++).

STLshm provides an C++ STL Allocator implementation for creating and using STL containers (and any other allocator aware types) in shared memory regions. It supports multiple shared region implementations.

SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.

Software experimental para realização de pequenas eleições ( menos de 3.456.000 votos por dia) através de votação por sms. utilizando a tecnologia GSM através de celulares ou modens GSM. Pode ser utilizado também para pesquisas sobre a opnião pública, promoções realizadas pela mídia etc. Velocidade média de recepção de votos: 40 sms/s Velocidade média de envio da confirmação do voto: 1 sms/s.

The first parallel Smith-Waterman algorithm exploiting Intel Xeon Phi clusters to accelerate the alignment of long DNA sequences. This algorithm is written in C++ (with a set of SIMD intrinsic extensions), OpenMP and MPI. The performance evaluation revealed that our algorithm achieves very stable performance, and yields a performance of up to 30.1 GCUPS on a single Xeon Phi and up to 111.4 GCUPS on four Xeon Phis sharing a host.

SWARD (System for Weapon Allocation Research and Development) is a testbed for benchmarking weapon allocation algorithms against each other. It is intended for researchers within operations research, information fusion, and related areas.

Schborg is off.

A java tool for anytime and interactive sequence mining. Aims at providing users with a way of analyzing her activity traces and extract activity schemes from them.

A dictionary based compressor, that is is different from Lempel Ziv encoding that it doesn't use match lengths and does not need perfect matches.

ScienceNET is a open source library written in C# which aims to provide a self contained clean .NET framework for neural networks, genetic algorithms, optimization, image processing and for other domains of a computational science.

This project an efficient method of solving a scrabble board.

Use this class to create combinations of sub-arrays of arrays and ArrayLists. A handy utility for creating and testing purposes..