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.

HEALPix is a set of scientific tools implementing the Hierarchical Equal Area isoLatitude Pixelation of the sphere. As suggested in the name, this pixelation produces a subdivision of a spherical surface in which every single pixel covers the same surface area. HEALPix provides various programs and libraries in C, C++, Fortran, GDL/IDL, Java, and Python which facilitate discretization, simulation, processing, analysis, and visualization of data on the sphere up to very high resolution. It is the state-of-the-art program used in astronomy and cosmology to deal with massive full-sky data sets.

Thinknowlogy is grammar-based software, designed to utilize the Natural Laws of Intelligence in grammar, in order to create intelligence through natural language in software. This is demonstrated by programming in natural language, reasoning in natural language and drawing conclusions (more detailed than scientific solutions), making assumptions (with self-adjusting level of uncertainty), asking questions (about gaps in the knowledge), and detecting conflicts in the knowledge. It builds semantics autonomously (with no vocabularies or words lists), detecting some cases of semantic ambiguity. It is multi-grammar, proving that Natural Laws of Intelligence are universal.

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.

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.

GHCN Processor is a command-line tool that reads temperature data from the Global Historical Climatic Network (GHCN) database and produces an annual or monthly temperature series in CSV format for an arbitrary set of stations. Stations are filtered based on a simple EL expression passed to the tool. For example, you can select only stations that are in the Northern Hemisphere, in hilly and rural locations. You can also select stations that started reporting in a given year, and so on. The tool supports more than one method of grid partitioning, station combination, and can use both the adjusted data and raw unadjusted data.

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.