Library of solvers for work in Science, Engineering & Education
1) Portable library of solvers for work in Science, Engineering & Education. 2) Only Windows port is available. 3) Library Contents: High Precision Computation, Numerical Calculus, Complex Analysis, Geometry, Linear Algebra, Special Functions, Differential Equations, Transformations, Optimization & Interpolation, Distributions, ... (1,312 functions in v17.07 package) 4) Special: Knowledge of any programming language is not required
This library allows you to generate a random number
This library allows you to generate a random number in the specified range from 0 to n, without using the built-in function Math.random (), and gets a random number from the processing time of polymorphic mathematical calculations, which depends on the current physical parameters of the CPU, RAM, and t .P. The resulting sequence corresponds to a discrete uniform distribution and is close to natural random sequences in terms of statistical randomness tests (LFSR, Approximate Entropy, DIEHARD Test).
Free Pascal IDE
Turbo Pascal IDE. Pascal XE is an IDE for Pascal programming, an alternative to TPW 1.5 (Borland Turbo Pascal for Windows 1.5) and Borland Turbo Pascal 7 for Windows 64-bit (x64) and 32-bit (x86). Pascal XE is a comprehensive and easy to use IDE for Pascal Coding and programming. Pascal XE uses the powerful Delphi compiler 15.0 freely distributed with Delphi 7 personal edition (https://delphi.developpez.com/telecharger-gratuit/delphi7-perso/).
finds the sortest path on the square board. GUI is implemented in Qt.
The program demonstrates the usage of the A* algorithm to find the shortest path. It searches the shortest path between source piece and target piece on the rectangular board. On the board the obstacles (wall) can be constructed. In addition to the algorithm, the GUI is provided. The GUI is written in Qt. Using the GUI, one can construct and move interactively the obstacles on the board. For every modification of the board, the shortest path is calculated automatically. Some statistics related to A* algorithm are presented as well. This project is related to my other projects located at sourceforge as well: https://sourceforge.net/projects/a-star/ https://sourceforge.net/projects/shortest-path-graph-a-star/
Finds bad examples for the local search Path Partitioning algorithm
Path Partitioner constructs random graph partitions and solves the linear (or integer) programming problems that assign weights to the edges such that the performance ratio of the local search algorithm for the Path Partitioning problem is minimized. See http://www.tau.ac.il/~ohadschn/Thesis/Partitioning.pdf. Requirements: Microsoft Automatic Graph Layout http://research.microsoft.com/en-us/projects/msagl/ Gurobi Optimizer http://www.gurobi.com/ Permutations, Combinations, and Variations using C# Generics http://www.codeproject.com/Articles/26050/Permutations-Combinations-and-Variations-using-C-G
combinational logic functions minimization
QMC Logic Minimizer is a versatile application for fast simplifying truth and reduce lines tables. This program offers a comfortable user interface for generating and minimizing of the combinational logic functions. It is unique for its possibility of minimizing several functions at the same time. This program is intended for practical digital devices constructors as well as formal scholars and academics. Features: - You can minimize up to 16 input variables and up to 16 output variables. - You can also reduce the number of table rows. - It allows you to name the input and output variables. - The table can be exported to HTML file and then you can use it in e.g. MS Word. - This program provides a comfortable interface, you can change fonts and colors. - It works on MS Windows, GNU/Linux, Mac OS.
Qt-based FFT implementation
A Qt library for Fast Fourier Transform (FFT) of real samples. Based on the FFTReal library.
software educativo de aplicacion de metaheuristicas sobre problemas de grafos, TSP problema del agente viajero, ruta mas corta, arbol de expansion minima, etc.
A dynamic, unlimited terrain demo
**Source code available in 'files' area** This C#/XNA program demonstrates a quadtree terrain splitting algorithm which can be used to render very large-scale worlds. As you move around the terrain, the level of detail will increase/decrease based on camera distance. The scene is built using deterministic noise which can be modified by changing the parameters in the code. There is also a water plane which adds a bit of variety to the landscape. You can explore the world using the mouse and keyboard. When the program starts, you must press C to attach the mouse to the camera. You can then use the WASD keys to fly around. If you press the Space key, the camera will follow the contours of the terrain as you move.
Geoelectrical data inversion using Neuro Fuzzy technique
Geoelectrical resistivity data is used for estimating the subsurface features of earth. It is very difficult to estimate the depth and true resistivity analytically, therefore many mathematical models approximates the result. The approximation relies on many parameters as the heterogenous model of earth is difficult to map. Conventional interpretation algorithm mostly uses the forward modelling technique which is limited for different lithologies. Here we presented ResinvANFIS v1.0 software platform to invert any type (A, Q, K, H or any mixed data types) of resistivity data having AB/2 and apparent resistivity data as input. This kind of generalised platform has not been done elsewhere to invert data directly.
RHash is a console utility for computing and verifying hash sums of files. It supports CRC32, MD4, MD5, SHA1, SHA256, SHA512, SHA3, Tiger, TTH, Torrent BTIH, AICH, ED2K, GOST R 34.11-94, RIPEMD-160, HAS-160, EDON-R 256/512, WHIRLPOOL and SNEFRU hash sums.
SMART (Shape Matching Algorithm Research Tool) enables you to implement 2D and 3D shape matching algorithms as plugins. Plugins can either be implemented in Java or as native plugins, i.e. in C/C++.
SMSD is a Java based software library for calculating MCS.
SMSD is a Java based software library for calculating Maximum Common Subgraph (MCS) between small molecules. This will help us to find similarity/distance between two molecules. MCS is also used for screening drug like compounds by hitting molecules, which share common subgraph (substructure).
STXXL is an implementation of the C++ standard template library STL for external memory (out-of-core) computations, containers, and algorithms that can process huge volumes of data that only fit on disks.
SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.
Encrypt your message with various algorithms.
Sandcrypt will encrypt your text / messages with various algorithms so othe people can't read it and keep your messages secure. Now only available MD5 Algorithm. More will be announced on the next major updates.
High performance image processing library in C++
The Simd Library is a free open source image processing library, designed for C and C++ programmers. It provides many useful high performance algorithms for image processing such as: pixel format conversion, image scaling and filtration, extraction of statistic information from images, motion detection, object detection (HAAR and LBP classifier cascades) and classification, neural network. The algorithms are optimized with using of different SIMD CPU extensions. In particular the library supports following CPU extensions: SSE, SSE2, SSE3, SSSE3, SSE4.1, SSE4.2, AVX, AVX2 and AVX-512 for x86/x64, VMX(Altivec) and VSX(Power7) for PowerPC, NEON for ARM. The Simd Library has C API and also contains useful C++ classes and functions to facilitate access to C API. The library supports dynamic and static linking, 32-bit and 64-bit Windows, Android and Linux, MSVS, G++ and Clang compilers, MSVS project and CMake build systems.
Software to solve Linear Programming problems applying the Revised Simplex Algorithm (2-Phase Method) and performing a Sensitivity Analysis too.
This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.
TCache is high performance key/value storage component. It can be easily plugged into any existing high-performance, distributed memory object caching systems such as MemcacheD or Dynamo, speeding up dynamic web applications by reducing database load
Generate and solve Travelling Salesman Problem tasks
TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.
The target of this project is to build easy, reliable, flexible and universal Java Configuration Tool.
An exploration utility to view, render and record TMC-patterns
This utility is designed for comfortable and rich control over Turing-McCabe-patterns. It offers realtime exploration using several input parameters, storing and restoring settings, recording videos and taking snapshots of steps as well as rendering patterns in HD.
Never-repeating talking clock (text)
A result of a challenge, this is a "talking clock" app that uses text to tell time, make clever remarks, dispense trivia and, generally, taking the dull of hour:minute. Designed as a result of a one-hour challenge (later extended to 24 hours), this project demonstrates several techniques for non-repeating text, based on grammar splitting, formatting, and log tracing. It comes with an "AI" demo for grammar generation, and a UberCleverClock app that combines base text for trivia, formatting, and grammar generation all-in-one.
"UltraQueue" is a library (DLL) project, written in C++. This library is intended to be used for very fast temporary data storage, aquired by any possible source (File, Serial Port, ...). Users can create multiple queues of differrent sizes & types