OSI-Approved Open Source (34)
- GNU General Public License version 3.0 (10)
- BSD License (8)
- GNU General Public License version 2.0 (7)
- Apache License V2.0 (3)
- GNU Library or Lesser General Public License version 2.0 (3)
- GNU Library or Lesser General Public License version 3.0 (3)
- Boost Software License (2)
- Eclipse Public License (1)
- Fair License (1)
- Microsoft Public License (1)
- W3C License (1)
- Public Domain (4)
- Creative Commons Attribution License (1)
- Linux (39)
- Windows (38)
- Grouping and Descriptive Categories (22)
- Android (19)
- Modern (6)
- BSD (5)
- Emulation and API Compatibility (2)
parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.1 weekly downloads
Sample code, algos, what you got?1 weekly downloads
Passwords generator for IAD devices, using 3 keys and a index. The result is a fixed lenght of alphabetic characters. The algorithm works with other 3 big fixed prime numbers. These 3 numbers define a family of passwords. Finally, it provides a guaranteed functional string to use in all variety of devices without rejects.
Jmathtools: math java stuff designed to be easily used, modified and extended. Initially designed to help porting of matlab software to java. 2D/3D plot, linear algebra, basic statistics. Groovy wrapper providing syntax close to Matlab/Scilab.
Java-based calculator engine
An implementation of "k-Way Merging" as described in "Fundamentals of Data Structures" by Horowitz/Sahni. NOTE: This project has been moved to http://code.google.com/p/kway/
Implementation of Kruskal and Prim algorithms for the MinimumSpanningTree find. The software has a GUI realized via FLTK C++ lib. A rich documentation is associated to the project.
PeerSec Networks MatrixSSL™ is an embedded SSL - TLS library under 50KB, designed for small footprint applications and devices. SSL is used to secure proprietary applications as well as common Internet protocols such as HTTP, SIP, H.323 and EAP-TLS
We propose a novel algorithm for computing the number of ordered integer partitions with upper bounds. This problem's task is to compute the number of distributions of z balls into n urns with constrained capacities.
The aim of this framework is to create a kind of API that is similar to Java.
A completely different and powerful approach to research and analyze vulnerabilities, resulting in permutations, and which can be applied to both offensive and defensive approach (oriented to programming).
Given a sequential input connection, we tackle skyline computation of the read data by means of using a spatial tree structure for indexing fine-grained feature vectors and concurrency whenever possible.
AStro inFER - a rule miner and executer
In a web development world dominated by fully bloated frameworks and object-oriented code, an alternative has arrived: phunctions. Simple, smart and sexy PHP functions released in the Public Domain that make common programming tasks a breeze.