Software Simulation of Network Algorithmics for Analysis of Fastest Packet Classification and Lookup in Network Processors
Bauman Moscow State Technical University (Russia) offer the Project “Quantity – to – Quality (Q2Q)”, the main idea of which is to create an IP service for learning materials’ estimation
Abandoned version of qbc. DOES NOT WORK properly
Random Projection Trees is a recursive space partitioning datastructure which can automatically adapt to the underlying (linear or non-linear) structure in data. It has strong theoretical guarantees on rates of convergence and works well in practice.
A Fast MAC based 3D Free surface fuid solver. Capable also of simulating viscoelastic fluids.Includes also wave equation solver for simulating shallow water phenomena.
Entorno grafico para el reaver
ReaverSaver es una interfaz gráfica para el crackeo de redes wireless con WPS. Ademas permite salvar las sesiones desde LiveUSB
Let P be a 2D point expressed in a plane area defined by four 2D points A,B,C,D. The aim of our C++ class is to express the coordinates of P in order to match when A,B,C,D is rectified as a rectangle. A demo application shows the use of the C++ class.
Robot Warfare is a real-time strategy game that gives the user an opportunity to manage and program a team of battling robots that autonomously face opposing teams in a network-enabled environment.
Depending on a SICK lasescan and a created environment landscape a routing function will be implemented to give a robot a few waypoint to drive from a start point to a choosen destination.
An open-source multi converter for SA-MP mod
SA-MP Multi Converter is an open-source multiple converter for sa-mp mod. It can convert almost anything. The list of things it can convert are: Object (Not finished) Command (Not started) Vehicle (Not started) INI(Not started) Note: It's still on development!
SCS - Simple Contest System - is a system for makieing Programming contests in simple way.
SHOBHIT-Advance String Search is a pattern search Algorithm
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++.
Students project used to tagging images using neutral network SOM
An Embedded C++ Domain-Specific Language
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
Sistema de votação por sms
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.
Computer Science documenation project. This project intend to provide full documentation and academic information for studies. All course taken , all exams with solutions lots of examples and more.
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.
A simple program for comparing data sets with simple algorithms.
Replace the data in the data.db file with your own data using an sqlite3 manager. Tables are read as data set names, and the values are read as the data points of the data sets. Load the application, choose an algorithm, and the program will find the pairs that best match each other.
A GLib/GTK+ classical encryption analysis and reversal tool that brings together multiple techniques into a single program to aide in decryption.
Simple, small and fast dictionary lib on C
The library does quick search of dictionary words in arbitrary input strings. Known problems are known. :) See appropriate section in documentation. Also, only ASCII words and strings for now.
A Simple console-based Sudoku Solver.
SPLITNEURON is a completely new approach to large-scale, biologically plausible, neural-network simulation library based on data structures and methods directly coded into database and conceived to explicitly share load on multiple machines.
This project has moved to GitHub: https://github.com/pvaret/spyrit
Creates and operates a stepped state machine
Implements a stepped state machine, i.e. a state machine which executes a single state transition at a time. Because of this, no data, e.g. state data, can be stored between executions. Instead, any such data must be stored in persistent storage between executions. This permits operation of the state machine as a CGI program in a web server. A WSGI or fastCGI or other such web server is not required. Received symbols may be received from sources outside the state machine, or may be generated internally by the state functions.