The Intel Software Development Emulator is a functional emulator for new and upcoming instruction set extensions. The emulator is based on the Pin dynamic binary instrumentation system (and XED). It emulates the new instructions in the SSE4, AES, PCLMULQDQ, and RTM, BMI1, and BMI2 Intel AVX, AVX2, and AVX512 instruction set extensions. This allows developers to gain familiarity with Intel's upcoming instruction set extensions.
Cobra is a general purpose programming language with a clean, high-level syntax. It provides language level features for quality, including first class unit tests and Eiffel-style contracts. It supports both static and dynamic binding. Cobra is a compiled language with good run-time performance, but also provides some scripting conveniences such as a pound-bang line (#!) and one step compile-and-run. Cobra runs on Linux, Mac, Windows, and anywhere else that Novell Mono or MS .NET exist, including handhelds.
gjrand is a programmer's library for pseudo-random numbers. It includes random number generator testing code and is intended for simulation, games, and "Monte-Carlo" algorithms. It produces pseudo-random numbers of the types: uniform integers, uniform reals, normally distributed reals, binomial, Poisson, integer permutation, chi-squared distribution, "Student" T distribution, and spherical distribution.
cipra is a simple, TAP-compatible Unit Testing Framework for C++. It's written in 100% standard C++11 and is only a couple of header files, making it easy to include in your C++11 project. TAP, the Test Anything Protocol, is a standard output format for software unit test frameworks which was originally designed for Perl, but can serve other languages. It has a rich number of tools ("harnesses") which parse TAP-formatted output and do useful things with it. TAP, however, is equally human-readable. The name cipra (pronounced /ˈʃi.pɾaː/ "SHEE-prah") comes from the lojban phrase "lo cipra", which means "the test". It is properly written with an initial minuscule "c", even when at the start of a sentence.
TSPSG is intended to generate and solve "travelling salesman problem" (TSP) tasks. It uses the Branch and Bound method for solving. Its input is a number of cities and a matrix of city-to-city travel costs. The matrix can be populated with random values in a given range (which is useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving, and a solving graph. The task can be saved in an internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using the Branch and Bound method to solve a particular task.
DOMjudge is an automated judgement system to run programming contests. It provides a mechanism to submit problem solutions and interfaces for teams, the jury, and the general public. It is lightweight, and depends on standard software to do its task. It has a Web interface for portability and simplicity. It is scalable, so distributed judging is easy. There is a modular system for plugging in languages and compilers. It features rejudging, clarifications, and detailed submission/judging info.