KaHIP - Karlsruhe High Quality Partitioning - is a family of graph partitioning programs that tackle the balanced graph partitioning problem. It focuses on solution quality and implements flow-based methods, more-localized local searches, and several parallel and sequential meta-heuristics.
Global Paths Matching is an implementation of the global paths graph matching algorithm proposed by Maue and Sanders in "Engineering Algorithms for Approximate Weighted Matching" (WEA'07). Given a graph G=(V,E), a matching M is a set of edges without common vertices, i.e. the graph G=(V,M) has a degree of at most one. The algorithm scans the edges in order of decreasing weight (or rating), constructing a collection of paths and even length cycles. These paths initially contain no edges. While scanning the edges, the set is extended by successively adding applicable edges, which are those connecting two endpoints of different paths or two endpoints of an odd length path. Optimal solutions/matchings are computed for each path and cycle using dynamic programming.
Racket (formerly PLT Scheme) is a programming language suitable for implementation tasks ranging from scripting to application development, including GUIs, Web services, etc. It includes the DrRacket programming environment, a virtual machine with a just-in-time compiler, tools for creating stand-alone executables, the Racket Web server, extensive libraries, documentation for both beginners and experts, and more. It supports the creation of new programming languages through a rich, expressive syntax system. Example languages include Typed Racket, ACL2, FrTime, and Lazy Racket.
Kelvin is a units converter intended for scientists, teachers, and students who need a reliable tool for fast conversion. Some categories included are: acceleration, area, frequency, atomic physics, density, electrical capacitance, electromagnetic radiation, energy/work, flow, force, fuel consumption, illumination, length, luminance, luminous flux, magnetomotive force, mass, power, prefixes and suffixes, pressure and stress, specific heat, speed/velocity, temperature, thermal resistance, time, torque, viscosity (dynamic), viscosity (kinematic), volume, and dry/liquid capacity.
FLENS is short for Flexible Library for Efficient Numerical Solutions. This C++ can be used as a builing block for the implementation of other (higher-level) numerical libraries or numerical applications. It is a C++ library (requires a C++11 conform compiler). Easy install, as FLENS is headers only. It gives you Matrix/vector types for dense linear algebra; a generic (i.e. templated) implementation of BLAS; and a generic reimplementation of LAPACK. If high performance BLAS libraries like ATLAS, GotoBLAS, etc. are available, you simply can link against them and boost performance.
GRALE is a set of tools - a library and a number of accompanying applications - to study gravitational lenses. Gravitational lenses are astronomical objects so massive that their gravitational pull even deflects light rays. This can cause multiple copies of the same background object to be visible, like a cosmic mirage. The locations and shapes of these copies can provide information about the mass distribution of the gravitational lens, which GRALE can help recover using a genetic algorithm-based method. Apart from these so-called lens inversions, it's also possible to simulate gravitational lenses.
GraphInsight is visualization software that lets you explore graph data through high quality interactive representations. Data exploration and knowledge extraction from graphs is of great interest nowadays: knowledge is disseminated in social networks, and services are powered by cloud computing platforms. Data miners deal with graphs every day. Humans are extremely good at identifying patterns and outliers. Interacting visually with your data can give you better intuition and higher confidence in what you are looking for.