U++ is a C++ cross-platform rapid application development suite focused on programmers' productivity without sacrificing runtime performance. Based on strictly deterministic design, it provides a viable alternative to garbage-collected platforms, even for business logic oriented problems.
Resara Server is an Active Directory compatible open source server for small businesses designed around Samba 4. It is designed to be simple and easy to use. Setup only takes a few minutes. The management console lets you manage users, share files, work with storage, and configure DHCP and DNS.
SILC Runtime Toolkit (SRT) provides useful utility functions for application programmers. SRT can be used as the main runtime in any application. It provides an application main loop, hash tables, lists, atomic operations, threads, locks, queues, a file descriptor stream, a socket stream, network routines, a finite state machine, a memory pool, a random number generator, buffers, regular expressions, and many other features. It natively supports Unix/Linux, Windows, Mac OS X, and Symbian OS platforms.
SEMS is a media and application server for SIP based VoIP services. It shows good performance doing basic services like announcements and conference for combination with external application servers. Thanks to its easy-to-use and flexible application development framework and back-to-back user agent support, application logic and media serving can be combined in the same process. Basic applications like announcement, pre-call announcement, RBT, conference, voicemail, mailbox, and lots of example applications are available. Scripting can be done in Python and a simple state machine description language. Support All commonly used free codecs (including g711, gsm, iLBC, speex, adpcm, and l16) are supported. Other features include wideband, ZRTP encryption, a SIP registrar client, an XMLRPC server/client, and a DIAMETER client.
Algorithm Study provides tools and resources to augment the traditional study of algorithms. It includes implementations of common and less-common algorithms in a variety of languages and visualization tools to help in gaining a deeper understanding of the algorithms. The algorithm implementations are each accompanied by a discussion of the asymptotic ("big O") run time and memory limits of the algorithm. Some implementations include discussion of how the algorithm or data structure is commonly used and comparisons with similar algorithms or data structures. All implementations have test cases that exercise their functionality. The visualization tool, Algorithm Visualizer, displays what happens as various algorithms do their work.
Funky is a tiny, embeddable programming language with almost unlimited extending capabilities. It presents itself as a single class that contains the entire interpreter. Two versions of this class exist: Funky::Funky, a floating-point version, and Funky::Groovy, an integer version. You can install your own functions in the language as long as your functions take a vector of the built-in type of the interpreter and return an instance of that built-in type (or a vector of those). Funky is a functional programming language. As such, it treats everything as functions, and those functions handle only one type: double in the case of Funky::Funky, or int in the case of Funky::Groovy.