Open Source Algorithms - Page 41

This program finds words for a given number. The words are taken from a dictionary file. Improved with groovy memoization: http://www.solutionsiq.com/resources/agileiq-blog/bid/72880/Programming-with-Groovy-Trampoline-and-Memoize 1. You may download code: git clone git://git.code.sf.net/p/numberencoding/code numberencoding-code 2. Build: mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true 3. Run: java -jar target/numberencoding-1.0-fat.jar

In this Project,you can find a Phone book is implemented in an AVL Tree, you add new contacts, delete, and save the list to a text file Please check the project files here: https://sourceforge.net/projects/phonebookavl/files/

A collection of phonetic algorithms such as metaphone or soundex for use in Python.

Phonetix.Net is a C# class-library of phonetic algorithms, implementing Soundex, Metaphone and DoubleMetaphone, with adapters for Lucene.Net. It is a port of the Java-based Phonetix library.

PHP/MySQL implementation of the Active Record pattern. This project is highly focused on simplicity of usage, high compatibility (from php4/mysql3 up to php5/mysql5.1) and code cleaness.

Physhun is a Java framework for building and executing finite state machines in J2SE and J2EE environments. State models are defined as collections of Spring beans, and do not use proprietary modeling languages. The framework is simple and flexible.

PixLab is a peculiar raster-based graphic editor giving one more additional drawing aspect to an artist. Not only traditional elements of painting, such as color and shape, but also artist's brush dynamics is fixed and displayed.

Es un editor de código ligero y fácil de usar, diseñado específicamente para la programación en Python. Su interfaz intuitiva permite a los usuarios, tanto principiantes como experimentados, escribir, editar y ejecutar código de manera eficiente.

Plantra-Trajectory Planning is a software to rebuild surfaces from cloud points, featuring shaded 3D visualization and path planning for robotics paths. It uses Voronoi diagram, Cyrus-Beck clipping, Delaunay triangulation and B-Splines.

Example how to use my class TPluginObject in C++Builder5 projects. Call *.bat, *.exe, *.vbs, *.hta, *.dll as plugins from application events or main menu. Create data base "PluginSampleDB" in MS SQL Server 2005 and Imort ActiveX : ScriptControl

Implementation of Point Symmetry-based Automatic Clustering Approach Using Differential Evolution Using bug fixed KD tree nearest neighbor search from https://github.com/CristianDallos/kmeansclustering. (It is also modified to search for multiple nearest points instead only for one.) Used those academic works for algorithm implementation: http://cs.cug.edu.cn/teacherweb/gwy/Publication/ISICA-09.pdf http://www.isical.ac.in/~sanghami/ieeetkde_cameraready.pdf http://www.softcomputing.net/smca-paper1.pdf 1. You may download code: git clone git://git.code.sf.net/p/pointsymmetryclustering/code pointsymmetryclustering-code 2. Build: mvn clean install assembly:assembly -DskipTests -Dmaven.test.skip=true -DdownloadSources=true -Dcheckstyle.skip=true 3. Run: java -jar target/point-symmetry-clustering-1.0-fat.jar

PopED (Population Experimental Design) is a software tool for computing optimal experimental designs. The software has been developed with an emphasis on drug trials based on population models (non-linear mixed effects models).

PortugolViana é uma ferramenta open-source para edição/execução algorítmica. PortugolViana permite a edição de algoritmos em português (do Brasil e de Portugal) e a sua execução e monitorização.

The PowerCiph Data Encryption Algorithm is a versatile, yet simplistic, encryption algorithm/protocol. The ultimate goal of the algorithm is simplicity, compactness, and a lack of prerequisites.

This is a module that computes prayer times, sunrise, sunset and midnight.

Pre-projetos_MLCM - É um conjunto de Programas e códigos fonte dos mesmos, com finalidade educacionais para a área de TI. Sendo eles programas simples que foram desenvolvidos para a aquisição de nota no curso de BCC. Os programas em si, estão ainda em desenvolvimento sendo disponibilizado uma prévia dos progressivos resultados, não se tendo uma data de finalização do projeto definida. Fica a disposição os códigos deles sobre a licença GPL para que estudantes e interessados possam fazer uso e estudo dos mesmos.

Persistence management for evolving code. Precinct provides a layer between the code-evolving application and the XML fragment persister/loader.

A library that does preform precise floating point operations designed for industrial / banking solutions.

Program by: Ravi Sharma (rvisharma) Prime-Number-Finder-using-Sieve-of-Eratosthenes =============================================== Finds Prime Numbers using Sieve of Eratosthenes Algorithm This Program gives you the prime number upto N Integers, Sieve of Eratosthenes Algorithm is used to determine the Prime Number To find the Prime Number, in the console Shell call the prime_finder(N) function, prime number will be given upto N integer. At first you will be prompted with an input, after that you can call it using function prime_finder(n) example call: >>>prime_finder(10) #output [2,3,5,7] (Int) -> (list)

This project considers the problem of calculating primes as a sorting problem. It includes the most efficient tree-based sorting algorithm that is possible and shows that finding a new prime can be done by sorting the differences between the previous primes in the right way. Unfortunately it has turned out that going this way is even more slowly than trying to find primes by brute force. So it can only be used as a test with heavy load for the sorting algorithm, which can be used for sorting any kind of data. And as already mentioned, it's just the most efficient tree-based sorting algorithm that you can get. But furthermore this way of finding primes interestingly leaves a hard nut to crack for mathematicians: In very rare cases it finds numbers that are not primes. For all primes below one million this phenomenon arises in exactly two cases: 31213 which is 7 * 7 * 7 * 7 * 13 336141 which is 3 * 3 * 13 * 13 * 13 * 17 Who can explain, why?

ProViz is a program visualization framework for Java. It is built as a plugin to the Eclipse IDE. (We are getting close to publishing resources and making this project distributable. Stay tuned!) A video demo: http://www.youtube.com/watch?v=BsoK1n-OM

PAK is a collection of library code to handle the overhead of coding things like read-write locks, reflective multithreaded programming and simple file io. This is a java library collection, please see my API below...

A whole lot of source code related to programming Linux systems with C

The project CIF now created with new philosophy of JPM (Joint Project Module) with SDK style. Now simply include CIF.h and use all of functions, macros and classes. BTS (Basic Text Support) Library Used in TOM (Text Object Module). TOM for now with CAnsiString , CAnsiStringLite And Text namespace. CAnsiString created with more functionality then typical string and text classes. EVS (Enhanced Visual Support) provide COpenFileDialog And CSaveFileDialog. JCM (Joint Core Module) used as base in project. Properly support for a class available TPT (Template Properly Type) and VTM (Value Type Macro). BTS,EVS,JCM,TOM,TPT,VTM are parts of project CIF. CIF5SDK used in project Bytes Counter. Project Core Information Foundation (CIF) is created by Muhammad Arshad Latti.

Schedule Tool is a utility for predicting the duration of projects from a series estimated task times. This tool converts the estimates to probabilities of success, and convolves successive tasks to give an estimated date of completion.