Open Source C# Algorithms - Page 4

Multicore SWARM (Software and Algorithms for Running on Multicore Processors) is an open source library for developing efficient and portable implementations that make use of multi-core processors. David A. Bader (Georgia Tech) began SWARM in 1994.

A program that can learn from midi examples, and create new music from that.

NOD-MP stands for not another data-mining project. It is educational and scientific software to utilize data mining clustering algorithms through a user-friendly interface.

.Net Implementation of the BIDI algorithm, as described in http://www.unicode.org/reports/tr9/

Software library for performing Optical Character Recognition (OCR) targeting the .NET platform. It's ported from the JavaOCR project.

The NSketch library provides implementations of most common sketch-based algorithms (histograms, quantile, frequent items, bloom filter ...). The library is written in C# for .Net.

In this project we develop a software, that uses evolutionary algorithm to evolve a solution, that can drive a car on an arbitrari path.

This is a SDK which can nest/layout the part/geometry/polygon on the material or sheet intelligently, you can get the best utilization of the materials, this SDK also support read/write DXF/DWG files and part-in-part nesting. New nesting lagorithm is implenmented, more good to support true shape part or material.

This project aims to implement several network fault diagnosis algorithms.

A mapping application for OpenStreetMap that renders OSM or MapQuest tiles and does basic routing from a built-in database. The main focus of this project is the development of a high-performance routing engine that can handle a variety of routing and vehicle constraints on demand without additional pre-processing of the road network. An additional goal is the development of a class library centered around a built-in, object-oriented database used for processing and storing OSM map data such that external dependencies (e.g. external database servers) are minimized.

OW.NET -- 1-Wire API port from Java (and J#) to C#. Use the Dallas 1-Wire and iButton chips with standard C# using a serial adapter (also CF.net) or the TMEX drivers on the Windows platform. No J# distribution installation required.

Online Signature Verification technology requires primarily a digitizing tablet and a special pen connected to the USB port of a computer. An individual can sign on the digitizing tablet using the special pen regardless of his signature size and position. The signature is characterized as pen-strokes consisting x-y coordinates and pressure with the data being stored in a signature database. Dynamic time warping (DTW) and quadratic discriminant analysis (QDA) is used to get results where the system accepts 2% of forged signatures and rejects 5% of true signatures

OpenYPDatePicker is a webcontrol for Asp.Net Ajax-based and written in C Sharp to provide a calendar culture based with capablity to connect to a database to retrieve informations like a sheduler.

*** this project has moved to codeplex: http://osmsharp.codeplex.com/ ***

PANDA is a comprehensive and flexib tool for quantitative proteomics data analysis, which is developed based on our solid foundations in quantitative proteomics for years. Several novelties have been implemented in it. First, we implement the advantage algorithms of LFQuant (Proteomics 2012, 12, (23-24), 3475-84) and SILVER (Bioinformatics 2014, 30, (4), 586-7) into PANDA. Second, we consider the state-of-art concept of quantification reliability in this quantitative workflow. On the levels of spectra, peptides and proteins, PANDA works out a few quantitative filters and new scores for quantification confidence. Third, PANDA is designed for processing proteomics big data in parallel.

Program was created for optimized packing of two dimensional rectangular elements at orthogonal table with main purpose of printing cutting sheets that can be used for cutting material at production in wood and panel furniture manufacturing. It is developed upon authors several years of experience at woodworking, and actual carpenters needs when such software is in question. In spite its look it is fully functional peace of software , with all necessary elements needed for generating cutting sheets. GUI is simple and it consists of fields for entering table and element dimensions on the right. Packing, optimization, cutting and cleaning table edges section bottom left and statistic section bottom right. Upper left are table description field and cut sheet drawing at the center. Right click at the cut sheet drawing and there are printing options. NOTICE : This program was not created for sellers of chipboard and other board materials. All the best, Author

The project is composed of two layers. The first layer is an artificial intelligence engine, partwriter, that writes music based on some heuristic. The second layer is the layer that defines the heuristic. The definition of this heuristic defines the type of music that partwriter will create. Currently (December 2012), the deepest layer is more or less complete. The author is now writing second layers of interest, namely species counterpoint heuristics according to Fux's Gradus Ad Parnassum.

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

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.

The PvtTable transforms a simple SQL consult into CrossTables not normalized. You can vary relationships between severals lines and columns more: http://en.wikipedia.org/wiki/Crosstab framework compatibility code 1.1Framework used 1.4

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).

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.

Provisio.Collections brings STL like iterator-based containers to the .Net world (especially C#). It offers fundamental sequential (vector/list/deque) and associative (tree/skiplist) containers that can be filled, traversed and modified using iterators.

An attempt to discover new kinds of Fractals by generalizing Pythagoras's Theorem into higher dimensions and negative numbers. Pythagoras Theorem when a < 0.0 and b >= 0.0 : c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * 1.0 c^2 = a^2 + b^2 * (((a*a + b*b)^0.5 - b)^2.0/(b - (a*a + b*b)^0.5)^2.0) * (-1.0 / -1.0) c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) Pythagoras's Theorem with negative numbers : For a < 0 and b >= 0 : c^2 = a^2 + b^2 * (((((a*a + b*b)^0.5)*i - b*i)^2.0)/(b*i - (((a*a + b*b)^0.5)^2.0)*i)) for a >= 0 and b < 0 : c^2 = b^2 + a^2 * (((((a*a + b*b)^0.5)*i - a*i)^2.0)/(a*i - (((a*a + b*b)^0.5)^2.0)*i)) for a < 0 and b < 0 : c^2 = a^2 + b^2 for a >= 0 and b >= 0 : c^2 = a^2 + b^2 There is Pythagoras's Theorem on Complex Plane numbers.