A new sight of developing. Thinking in human's concepts and orgnizations. Analysis behaves and effects before the actual building take place. Automatically using the proper algorithms and data model. Based on a large scale descriptive library.
A package of Rijndael, Twofish and Serpent encryption algorithms implemented in x86 assembly. Meant to learn basics of assembly, learn about the algorithms or to be used in a C program.
ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.
AVL Tree implementation in C++ template suited for static memory management.
simulated annealing optimization and importance-sampling
Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.
Algorism is a repository of implementation of all frequently used algorithms in C/C++
An Algorithm Library written in .Net 2.0 which includes common algorithms.
The goal: to provide implementations of as many algorithms (sorting, searching, ...) and data structures (lists, trees, ...) as possible, accompanied by discussion of big O run time and memory limits and references to sources of further study.
Alpaga - a library of fast and accurate mathematical functions, written in PowerPC assembly.
Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.
The goal of this project is to develop a collection of reliable, stable AppleScript handlers for use in AppleScript projects on Apple Macintosh computers.
Approximate Subgraph Matching Algorithm for Dependency Graphs
The subgraph matching problem (subgraph isomorphism) is NP-complete. Previously, we designed an exact subgraph matching (ESM) algorithm for dependency graphs using a backtracking approach (http://esmalgorithm.sourceforge.net). We further designed an approximate subgraph matching (ASM) algorithm that is capable of detecting approximate subgraph matching based on a subgraph distance. Assume that the graph G and the subgraph Gs have m and n vertices, and km and kn edges respectively, the total worst-case algorithm complexity is O(m^n * n(n-1)/2 * km * log m). This Java implementation implements our ASM algorithm. See README file: https://sourceforge.net/projects/asmalgorithm/files/ If you use our ASM implementation to support academic research, please cite the following paper: Haibin Liu, Lawrence Hunter, Vlado Keselj, and Karin Verspoor. Approximate Subgraph Matching-based Literature Mining for Biomedical Events and Relations. PLOS ONE, 8:4 e60954, 2013.
ARP handler inspection
ArpON (ARP handler inspection) is a Host-based solution that make the ARP standardized protocol secure in order to avoid the Man In The Middle (MITM) attack through the ARP spoofing, ARP cache poisoning or ARP poison routing attack.
The Asterisk Config PHP-Parser claims to be a simple but effective function writen in PHP non-OOP that is capable to parse any standard .conf Asterisk configuration file an drop the data into a multi-dimensional array.
Axiom is a computer algebra system. It consists of an interpreter, a compiler and a library of algorithms. Axiom is an excellent research platform as well as a useful tool for scientific programming.
Bachelor of Science (Informatik)
The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.
Ben(Zai)Ten is a graphical modeling environment for computational and systems biology. It supports the community exchange standards: SBML, SBRML, SED-ML as well as ontologies: MIRIAM, SBO, ChEBI, KEGG, GO
Modules for developing, configuring and running a computation based on function blocks entirely in Python. Function block based computation is a data, event and state driven approach to data processing.
Broccoli contains: -real and complex numbers,vectors,matrices,functions,polynomials -function minimizers,evolutionary algorithms,neural networks -pdfs,cdfs,max-likelihood,regression,DGPs,PRNGs,armax,garch,statistical estimation etc. -friendly JavaSwingGUI
BudgetedSVM: A C++ Toolbox for Large-scale, Non-linear Classification
We present BudgetedSVM, a C++ toolbox containing highly optimized implementations of three recently proposed algorithms for scalable training of Support Vector Machine (SVM) approximators: Adaptive Multi-hyperplane Machines (AMM), Budgeted Stochastic Gradient Descent (BSGD), and Low-rank Linearization SVM (LLSVM). BudgetedSVM trains models with accuracy comparable to LibSVM in time comparable to LibLinear, as it allows solving highly non-linear classification problems with millions of high-dimensional examples within minutes on a regular personal computer. We provide command-line and Matlab interfaces to BudgetedSVM, efficient API for handling large-scale, high-dimensional data sets, as well as detailed documentation to help developers use and further extend the toolbox.
Project contains engine to construct Fuzzy Reasoning System. Package might be used when Fuzzy Reasoning is appropriate e.g. in trading, control, modelling, human behavior simulation.
CRCLIB is a small library of CRC calculations which can be used in other programs. Because CRC check is often used by binary communication protocols, it is made as simple as it can be, built into library so that it could be used regardless of language of application code. Written in plain C, built as dll and static library, and also contains C/C++ import header, C# wrapper and .NET project for MS SQL Server assembly. Supports CRC16 (including MODBUS) and CRC32.
CSTL is a port of the C++ STL to C# 2.0 and .NET. The library utilizes C# generics, anonymous methods, and enumerable iterators, while alleviating some of C#'s deficiencies (no C++ templates, limited operator overloading, no C++ style iterators, etc).
This library contains functions to calculate hash values and checkdigits like Adler, MD5 and much more. Over 30 different hash codes, checkdigits and barcodes will be supported.
General purpose binary and multiway tree library for Max OS X Cocoa.