Data reduction and imaging for select astronomical cameras
CRUSH is a pioneering reduction and imaging suite for many astronomical cameras operating at far-infrared, submillimeter and millimeter wavelengths, such as SHARC-2, SCUBA-2, LABOCA, GISMO, or SOFIA/HAWC+ (to name a few).
CloudI is an open-source private cloud computing framework for efficient, scalable, and stable soft-realtime event processing.
minimal benchmark code for Counting Set Bits (ones) in an Integer
I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than the simpel LUT solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) PS: see result.txt in Code to see various runs with different compilers and compiler switches
encapsulates secure crypto algorithms for easy use
This library exposes security functionality to the programmer, such as random number generation, hashing, salted hashing, message authentication code, symmetric encryption, asymmetric encryption, hybrid encryption, digital signature and in-memory protection. The library is accompanied by a sophisticated reference implementation, that demonstrates how to make use of the CryptoLibrary.
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, ... (2,125 functions in v18.05 package) 4) Special: Knowledge of any programming language is not required
MhcFS2 - engineering calculator. (math expression calculator, scientific calculator, numerical, integral,integration, derivative, root, matrix, differencial, differentiation, equation, LSE,ODE )
Makes magic squares.
These programs make magic squares and rectangles using "Constraint-Based Local Search". (For non-square rectangles, input the order as two numbers.) There are 3 similar programs: CompleteSquare, CompleteSquareSteps, and MagicSquares. Given an input square with some cell values between 1 and NxN specified, (and other cell values 0), CompleteSquare attempts to complete a magic square by placing the remaining values. The square type can be input as semimagic, magic, or associative. For successful solutions, CompleteSquareSteps shows the steps of the search. The number exchanges at each step and the intermediate squares are written to files. MagicSquares does not require an input file. MagicSquares (only) also supports concentric and pandiagonal. (Pandiagonal succeeds only for small orders.) See: http://budshaw.ca/Download.html#complete http://budshaw.ca/Download.html#magics http://budshaw.ca/addenda/downloadNotes.html#completenotes
compoments suite for Delphi
Project description and support moved to : https://github.com/Zeus64/alcinoe However you can use the source you prefer, the SVN here or the GIT on github, both are synchronized (just that GIT don't support large file > 100 mo so some minor files used only as references are missing from GIT)
bincmp is intended as a cross-platform, tiny and fast binary comparer of two files. it is much faster than "fc /b", for example. bincmp2 is more powerful, but currently windows-only.
We developed a systematic algorithmic solution for quantitative drug sensitivity scoring (DSS), based on continuous modeling and integration of multiple dose-response relationships in high-throughput compound testing studies. License: The DSS R-package is made available under the terms of the GNU General Public License, which means that the source code is freely available for use within other software, but if you alter the code and distribute it, you must make the new source code freely available as well. This software is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY. In case you use the package in your work, we do appreciate a citation to a DSS publication. Citation: Yadav et al. (2014), Quantitative scoring of differential drug sensitivity for individually optimized anticancer therapies. Scientific Reports 4, 5193; DOI:10.1038/srep05193 Please visit the link below for details
Constraint Satisfaction Problem solving library for Java
Easy CSP is an open-source Java library designed for Object-based Constraint Satisfaction Problem solving. Object-based CSPs need not to have an int-based representation.
This is a method for identifying graphs using MD5 hashing. It can be used for graph equality comparisons and to facilitate graph isomorphism testing. The graphs can be labeled or unlabeled.
Linear constraint feasibility check and get program.
This program aims to check and gain a inner point from multiple set of linear constraints. This software works better in the case that range of variables are known and parameters are configured so. C++ and Eigen library needed, and to calculate more accurate, we may need mpfr++ library or, QD library. Freezed.
LASS : Library of Assembled Shared Source. Library of C++ code for scientific purposes.
Lascer liefert zu einer Menge binär klassifizierter Attribut-Vektoren eine Menge von Regeln zur Beschreibung der Klassen. Die Regeln können auch mathematische Funktionen enthalten, deren Art vorgegeben werden kann.
MLPACK is a C++ machine learning library with emphasis on scalability, speed, and ease-of-use. Its aim is to make machine learning possible for novice users by means of a simple, consistent API, while simultaneously exploiting C++ language features to provide maximum performance and flexibility for expert users. For more information, see http://mlpack.org
Axis Transformation Object Recognition
The utility for quickest manipulations with difficult data.
This is Java library for working with overlapping trees both as with plain memory and as with hierarchical structure, with quick access to any levels and branches of tree (<page><...><section><line><word>tooLongWordForCurrentLi</line></page><page><line>neAndSectionTwoPages</word></line></section><...></page> (incorrect in classic XML)). There supported the cross-references (from="@leftPanel#template" target="$template"); cursors;copying and removing of parts; functionality to index and search data; convenient factory of dynamic generation of values and parts of data; simple variables and any objects as values and as unnamed data for manipulating. Every object of this container is an child of any numbers of trees and has dynamic address. The utility is not demanding to resources, requires no extraneous libraries and can be deployed in a small memory. It can run on mobile devices. Do not use linear algorithms, the speed is only slightly dependent on the size of data.
pgapack, the parallel genetic algorithm library is a powerfull genetic algorithm library by D. Levine, Mathematics and Computer Science Division Argonne National Laboratory. The library is written in C. PGAPy wraps this library for use with Python.
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).
Self-orthogonal diagonal Latin squares.
Makes self-orthogonal diagonal Latin squares, SODLS, for all valid orders, (that is, not order 2, 3, or 6). Input is an order, (one number), or an order range, (two numbers separated by white space). Output files are in folder SODLS[_n]. Each file contains a SODLS followed by a magic square. The magic square, M, is made from the order N SODLS, Q, and its transpose, as: M[row][col] = N x Q[row][col] + Q[col][row] + 1 See http://budshaw.ca/SODLS.html http://budshaw.ca/addenda/SODLSmethods.html http://budshaw.ca/addenda/SODLSnotes.html http://budshaw.ca/Download.html#sodls
An algorithm library written in plain C.
A library that collect several algorithms and data structures.
TER implements the CCSDS Recommendation for Image Data Compression (CCSDS 122.0-B-1). TER also adds new features to the Recommendation. TER is designed and programmed with the aim to provide a good basis to test and develop the CCSDS Recommendation.