Open Source Algorithms - Page 35

Common Java data structure library used by multiple projects. See http://verdantium.blogspot.com/

MAIF is developed in Java 5 (especially Generics) and aims at building AI algorithms, by concentrating onto the mapping of real-world problems, while abstracting from their inner working. It can be extended with new algorithms and problem representations.

MicroGP (µGP, ugp) is a versatile optimizer able to outperform both human experts and conventional heuristics in finding the optimal solution of hard problems. It is an evolutionary algorithm since it mimics some principles of the Neo-Darwinian paradigm. ⚠️ A new version is available on https://github.com/squillero/microgp4

MicroThread is a minimal Borland/Turbo C multi-threading library for DOS programs. It consists of a pre-emptive scheduling kernel which dispatch threads on DOS INT 8, and has support for semaphores, critical sections and inter-thread messages.

The library for utilization of Minimal Quadtree format for storing very large sparse matrices. Please see the paper referenced below for the description of a problem. Corresponding papers: Tree-based Space Efficient Formats for Storing the Structure of Sparse Matrices (I. Šimeček, D. Langr, P. Tvrdík), In Scalable Computing: Practice and Experience, volume 15, 2014. Space Efficient Formats for Structure of Sparse Matrices Based on Tree Structures (I. Šimeček, Daniel Langr, Pavel Tvrdík), In Proceedings of 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013), 2013. Minimal Quadtree Format for Compression of Sparse Matrices Storage (I. Šimeček, D. Langr, P. Tvrdik), In 14th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'2012), 2012.

Mitandao is a multiplatform free and open source social network analyzer written in Java. It can be used as a stand-alone application as well as a library in your projects.

UNDERGRADUATE PROJECT UNDER DEVELOPMENT -- INSTABLE VERSION Android application that acts as GUI for embedded devices without user interface that are smart objects in a grid

A Pascal unit providing functions to format Brazilian Real (R$) currency.

Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for geeks/nerds/(or whatever you like to call yourself) like us. This game will be a perfect practice tool for programmers like us to find the best algorithm solutions and make the mouse intelligent. To get information on this game, visit the Mouse Run website at http://mouse-run.appspot.com If you have found bugs or have a request, please do write it in the reviews. Thanks!

To give users the full control over the running application. This means that an application is working according to its purpose but the control over the whole interface is taken from developer and given to users. While an application is running, users can move, resize, and tune all the screen objects through which the communication with an application is going. Set of files includes the book (both in DOC and PDF formats), a big demonstration project with all its files available (all the source files are in C#), and an additional description of many used classes. Book uses the examples from the demo project to explain everything in details. The examples are from many different areas. Examples from the first part of the book are aimed at the details of algorithm and its use with different objects; examples from the second part are mostly the real and very useful applications.

Moving target detection in 2D using Kalman Filter written in JS for demo purposes.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.

This is the program used in the following paper: Wenqing Lin, Xiaokui Xiao, and Gabriel Ghinita. Large-Scale Frequent Subgraph Mining in MapReduce. In Proceedings of the 30th IEEE International Conference on Data Engineering (ICDE), pages 844-855, 2014. Please cite the paper if you choose to use the program. If having any problems, please report to {wlin1 at ntu dot edu dot sg}.

Non backtacking NFA implementation of regular expressions for dot net.

This is a recursive C++ source code of the Fast Fourier Transform algorithm allowing parallelization. Also a performance test and its results on my computer are provided. The Performance test suggest to use 4 threads for parallelization. With this one can beat the implementation in "Numerical Recipes in C++" for large signals with more than 2^16 / 2^17 / 2^18 samples depending on the hardware and software.

A Java framework to create multi-threaded dispatching applications. It is a framework that realizes an application pattern that often appears while creating business applications.

This project aims at providing an implementation of some state-of-the-art techniques for summarizing multi-dimensional data. Multi-dimensional data summarization can effectively support query optimization algorithms and OLAP applications.

Machine learning toolkit for unsupervised and semi-supervised clustering that demonstrates excellent results on real-world data (see Bekkerman et al. ICML-2005 and ECML-2006).

Multifast provides you with efficient library and tool, to search and manipulate data streams on the fly. It can search for a huge number of strings and replace them in one pass. It contains a tidy and efficient implementation of the Aho-Corasick algorithm as a C library.

A simulation environment for 2D robots to interact and perform tasks in. Meant to be educational and demonstrate emergent behaviors. No download necessary! See demos on project website!

Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.

NEW OPTIMIZATION TECHNOLOGY & PLANNING EXPERIMENT. Technology is designed for multidimensional optimization practical problems with continuous object functions. Technology higher efficiency than traditional optimization methods.

libmgcd is a multigrid contact detection (MGCD) library.

Implementation of Multikey Quickselect and new Multikey Quicksort variants in Frias L, Roura, S. Multikey Quickselect. Technical report LSI-09-27-R, Universitat Politècnica de Catalunya, 2009. http://www.lsi.upc.edu/dept/techreps/techreps.html.

[ARCHIVAL] The central forum for the MWE community. Share your open-source data sets and MWE extraction tools, exchange ideas on evaluation strategies and further development of the tools, and discuss theoretical definitions and linguistic properties of MWEs.