Software Map

db4o is an object database for Java and all .NET environments. Its features include ACID transactions, automatic class schema recognition, query-by-example, a S.O.D.A. object querying API, native queries, LINQ support on .NET, callback methods, memory files, cascade-on-delete, multi-threaded access, and Java Webstart and servlet support.

The FAAC project includes the AAC encoder FAAC and decoder FAAD2. It supports several MPEG-4 object types (LC, Main, LTP, HE AAC, PS) and file formats (ADTS AAC, raw AAC, MP4), multichannel and gapless en/decoding as well as MP4 metadata tags. The codecs are compatible with standard-compliant audio applications using one or more of these profiles.

Speex is a patent-free compression format designed especially for speech. It is specialized for voice communications at low bit-rates in the 2-45 kbps range. Possible applications include Voice over IP (VoIP), Internet audio streaming, audio books, and archiving of speech data (e.g. voice mail).

Erebus is a 2D real-time role-playing game with three quests and random dungeons. It is a classic point-n-click style RPG, with dungeons to explore, enemies to fight, NPCs to talk to, sub-quests to complete, scenery to interact with, weapons, treasure, and other items to find.

pjsip is a multimedia communication library based on the SIP protocol. It is integrated with a rich media and a NAT traversal library supporting the ICE protocol. It is very portable and has a small footprint for embedded use.

Gigalomania is a 2D real time strategy game that is a clone of Mega-Lo-Mania. The gameplay consists of researching and developing new technology with which to conquer your enemies, from rocks and sticks to nuclear weapons and spaceships. You can advance through ten different ages, from the stone age to the future. There are 28 different maps to play through. The game is still under development, but is entirely playable in its current state.

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.