CSS Import Resolver resolves the @import url(...); statements in input CSS files (by replacing the @import statement with the actual content of the linked CSS) and creates a huge CSS output (written to STDOUT by default). Including the combined CSS in your Web pages will improve the performance of a site by avoiding additional HTTP roundtrips.
Traffic Squeezer is a Linux kernel based WAN network traffic accelerator from Doublefish Solutions. It uses methods such as traffic compression, traffic PDU coalescing, protocol specific acceleration (such as TCP acceleration mechanisms), and quality of service. Traffic Squeezer also contains custom L7filters (application protocol filters), DPI (Deep Packet Engines) and so on to control and administrate your traffic. With Traffic Squeezer, you can optimize MPLS,ISDN, leased links, Satellite Networks, and Marine Internet, and even build your own custom WAN Appliance with Traffic Squeezer. A GUI is now supported via Doublefish Solution Aquarium. Aquarium is a Web-GUI that also supports Traffic Squeezer, Squid, and other open source solutions.
EO is a template-based, ANSI-C++ evolutionary computation library that helps you to write your own stochastic optimization algorithms quickly. Evolutionary algorithms form a family of algorithms inspired by the theory of evolution, and solve various problems. They evolve a set of solutions to a given problem in order to produce the best results. These are stochastic algorithms because they iteratively use random processes. The vast majority of these methods are used to solve optimization problems, and may be also called "metaheuristics". They are also ranked among computational intelligence methods, a domain close to artificial intelligence. With the help of EO, you can easily design evolutionary algorithms that will find solutions to virtually all kind of hard optimization problems, from continuous to combinatorial ones.
HOPSPACK solves derivative-free optimization problems in a C++ software framework. The framework enables parallel operation using MPI (for distributed machine architectures) and multithreading (for single machines with multiple processors or cores). Optimization problems can be very general: functions can be noisy, nonsmooth, and nonconvex, linear and nonlinear constraints are supported, and variables may be continuous or integer-valued.
Orc is a library and set of tools for compiling and executing very simple programs that operate on arrays of data. The "language" is a generic assembly language that represents many of the features available in SIMD architectures, including saturated addition and subtraction, and many arithmetic operations.
ulatencyd is a scriptable daemon which constantly optimizes the Linux kernel for best user experience. The default configuration tries reduce the latency for a typical desktop system and protects the system from malicious processes and groups. With a different configuration, all other types of systems can be adjusted as well.
ca-ga is a toy artificial life simulation that uses genetic algorithms on large cellular automata. It uses simple but easily extended DNA that is 8k long by default, though you can take the size out to anything you have time to evolve. It sits under each cell of a 128x128 board and orders operations to transfer energy in the hopes of achieving a kill and breed. The simulation features a mutating fitness function, emergent sex, and a proof of concept real world fitness function. After enough generations, the cells or genes could achieve collectivism and organismhood, coordinating the values of the hotspots that determine board temperature in order to maintain a desired equilibrium. But maybe not. If you work in a fitness function, an optimizing problem solver results.
JCGO (pronounced as "j-c-go") translates (converts) programs written in Java into platform-independent C code that can be compiled (by third-party tools) into highly-optimized native code for the target platform. JCGO is a powerful solution that enables your desktop, server-side, embedded, mobile, and wireless Java applications to take full advantage of the underlying hardware. In addition, JCGO makes your programs, when compiled to native code, as hard to reverse engineer as if they were written in C/C++. The JCGO translator uses some optimization algorithms that allow, together with optimizations performed by a C compiler, the resulting executable code to reach better performance compared with the traditional Java implementations (based on the Just-In-Time technology). The produced executable does not contain nor require a Java Virtual Machine to execute, so its resource requirements are smaller than that required by a typical Java VM. This also simplifies the process of deployment and distribution of an application.