Search Results for "cpu benchmark linux"

* Fast GPU linear algebra library (matrix maths) for the C++ language, aiming towards a good balance between speed and ease of use * Provides high-level syntax and functionality deliberately similar to Matlab * Provides an API that is aiming to be compatible with Armadillo for easy transition between CPU and GPU linear algebra code * Useful for algorithm development directly in C++, or quick conversion of research code into production environments * Distributed under the permissive...

Opt4J is an open source Java-based framework for evolutionary computation. It contains a set of (multi-objective) optimization algorithms such as evolutionary algorithms (including SPEA2 and NSGA2), differential evolution, particle swarm optimization, and simulated annealing. The benchmarks that are included comprise ZDT, DTLZ, WFG, and the knapsack problem. The goal of Opt4J is to simplify the evolutionary optimization of user-defined problems as well as the implementation of arbitrary...

1/3 is not 0.33. Pi is not 3.14. Actually 1/3 is in interval [0.33, 0.34] and pi is in interval [3.14, 3.15]. During computation truncating error is accumulating. At end of computation it is needed to know real boundaries of result. The solution is given by interval arithmetic. Simply speaking, because 1/3 is in interval [0.33, 0.34] and 1/7 is in interval [0.14, 0.15], value 1/3 - 1/7 must be in [0.18, 0.2]. Computation can be arbitrary long and complex but interval arithmetic gives...

This is a parallelized algorithm performing a decomposition of the time-series data into a number of sinusoidal components, disentangling them from the white Gaussian noise. The algorithm analyses all suspicious frequencies, including the ones that look like an alias at a glance, but may become preferable later. After selection of the initial frequency candidates, the algorithm passes through all their possible combinations and estimates their multi-frequency statistical significance. In the...

A library encapsulating bilinear pairing computation and group computation in the cyclic groups G_1, G_2, G_T. The bilinear pairing is a bilinear, non-degenerate map between G_1 and G_2 to an element in G_T. The users can build complex pairing-based software by the Pairing library without much knowledge of elliptic curves or pairing or number theory. The library is smaller than 57 Kbytes, suitable for hand held devices. The size is only 3.7% of the size of the BPC...

Java Micro Benchmark - control tasks required to determine the comparative performance characteristics of the computer system on different platforms. Can be used to determine the effect of different software on the performance of a computer system.

JTransforms is the first, open source, multithreaded FFT library written in pure Java. Benchmark results show better performance than FFTW. The latest version is available at http://github.com/wendykierp/JTransforms.

Specter - Abstract Arithmetics Library (AAL) is a library coded in native C which is able to do operations with numbers of virtually unlimited length. Specter is targeting mainly cryptography and big integer maths though.

'atlc' is a CAD package used for analysing and desiging electrical transmission lines of arbitrary cross section. Also for the design of directonal couplers. Some parts are CPU intensive, so multiple CPUs are supported.

This program generates customizable hyper-surfaces (multi-dimensional input and output) and samples data from them to be used further as benchmark for response surface modeling tasks or optimization algorithms.

HRS Reconstruction System This program build 3D model of object from range images. Program use modified volume reconstruction method for creating a model. In this method I replace difficult calculations on CPU with simple rendering on video card.

This is an opensource project for the calculation of the mathematical constant Pi. If you are a mathematician or programer please contribute ideas or code for this project. Non professionals are also welcome to contribute.

OpenDiscreteDynamicProgrammingTemplate : founds optimal constrainted parameters of a discrete controls with second order optimization template replacing Hessian with directional derivatives and backpropagation for digital filter(as neural network)

Platform independend, multithreaded fractal generator. Fine control over thread/CPU usage; unlimited precision; smooth/random/function coloring; supports color map files (over 1600 available); many image file formats. For any Java 1.5+ (32/64 Bit) VM.

Distributed Java Fractal Generator. DJFractals can computes fractals in arbitrary precision using any CPU available from high performance multi-processors clusters of computers to grid of JavaCards and even at the same time.

sparse linear algebra library, with emphasis on preconditioned Krylov subspace methods for the solution of linear systems of equations