Extended Euclidean Algorithm Gcd

Contains two functions. The one function computes the greatest common divisor (gcd) of two polynomials a(x) and b(x) over GF(2^m). The other function performs the extended Euclidean algorithm where two polynomials u(x) and v(x) is calculated in addition to the gcd of a(x) and b(x) such that gcd =...

This is the extended euclidean algorithm implemented in haskell. It will put every single step of the algorithm in a file and show the actual result and everything in between.

A Java package that provides several computations related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed.


Platforms: Windows, Mac, Linux

Math::Numbers is a Perl module that contains methods for mathematical approaches of concepts of the number theory. SYNOPSIS use Math::Numbers; my $a = 123; my $b = 34; my $numbers = Math::Numbers->new($a, $b [, ...]); print "They are coprimes (relatively primes)!n" if...


Platforms: *nix

Extended compact genetic algorithm (ECGA) is an algorithm that can solve hard problemsin the binary domain. ECGA is reliable and accurate because of the capability ofdetecting building blocks, but certain difficulties are encountered when we directly applyECGA to problems in the integer domain....


Platforms: Matlab

EDFT (Extended Discrete Fourier Transform) algorithm produces N-point DFT of sequence X where N is greater than the length of input data. Unlike the Fast Fourier Transform (FFT), where unknown readings outside of X are zero-padded, the EDFT algorithm for calculation of the DFT using only...


Platforms: Matlab

A new metaheuristic optimization algorithm, called Cuckoo Search (CS), is fully implemented, and the vectorized version is given here. This code demonstrates how CS works for unconstrained optimization, which can easily be extended to solve various global optimization problems efficiently.


Platforms: Matlab

Algorithm::TravelingSalesman::BitonicTour is a Perl module to solve the euclidean traveling-salesman problem with bitonic tours. SYNOPSIS use Algorithm::TravelingSalesman::BitonicTour; my $bt = Algorithm::TravelingSalesman::BitonicTour->new; $bt->add_point($x1,$y1); $bt->add_point($x2,$y2);...


Platforms: *nix

QT clustering algorithm as described in:Heyer, L. J., Kruglyak, S., Yooseph, S. (1999). Exploring expression data: Identification and analysis of coexpressed genes. Genome Research 9,...


Platforms: Matlab

Write Extended Stored Procedures for Microsoft SQL Server with ease: Supported control over input/output procedure parameters. Supported returning of arbitrary number of recordsets. Parameters and Fields can be accessed by using the familiar properties: AsInteger, AsDateTime,...


Platforms: Windows

Write Extended Stored Procedures for Microsoft SQL Server with ease: Supported control over input/output procedure parameters. Supported returning of arbitrary number of recordsets. Parameters and Fields can be accessed by using methods such as SetInt(), GetDateTime(), SetMoney(), etc.


Platforms: Windows

The Warecase eXtended Task Monitor (XTM) is a powerful auxiliary tool designed for simplifying the environment of the software developer. XTM is an extended task monitoring and troubleshooting tool for Microsoft Windows 2000 OS and later versions of Windows. XTM can give fast solutions for sudden...


Platforms: Windows

Algorithm::Dependency is a base class for implementing various dependency trees. SYNOPSIS use Algorithm::Dependency; use Algorithm::Dependency::Source::File; # Load the data from a simple text file my $data_source = Algorithm::Dependency::Source::File->new( foo.txt ); # Create the...


Platforms: *nix

Algorithm::Knapsack is a brute-force algorithm for the knapsack problem. SYNOPSIS use Algorithm::Knapsack; my $knapsack = Algorithm::Knapsack->new( capacity => $capacity, weights => @weights, ); $knapsack->compute(); foreach my $solution ($knapsack->solutions()) { foreach my $index...


Platforms: *nix

Algorithm::DiffOld is a Perl module to compute `intelligent differences between two files / lists but use the old (<=0.59) interface. NOTE This has been provided as part of the Algorithm::Diff package by Ned Konz. This particular module is ONLY for people who HAVE to have the old interface,...


Platforms: *nix

Algorithm::Loops is a Perl module with looping constructs: NestedLoops, MapCar*, Filter, and NextPermute*. SYNOPSYS use Algorithm::Loops qw( Filter MapCar MapCarU MapCarE MapCarMin NextPermute NextPermuteNum NestedLoops ); my @copy= Filter {tr/A-Z.,"()/a-z/d} @list; my $string= Filter...


Platforms: *nix

Algorithm::Diff::Apply is a Perl module to apply one or more Algorithm::Diff diffs. SYNOPSIS ## Single-diff form: use Algorithm::Diff::Apply qw{apply_diff}; my @ary = ...; my @diff = ...; # some call to Algorithm::Diff::diff() my @changed_ary = apply_diff(@ary, @diff); my $changed_ary =...


Platforms: *nix

Parallel Genetic Algorithm Library (or PGAL for short) is a C++ toolkit for simply, efficiently, and swiftly producing genetic algorithm code that works across multiple processors. This is useful not only for those with multi-processor computers, but also for distributed and cluster computing...


Platforms: *nix

Algorithm::BinPack is a Perl module that can efficiently pack items into bins. SYNOPSIS Algorithm::BinPack efficiently packs items into bins. The bins are given a maximum size, and items are packed in with as little empty space as possible. An example use would be backing up files to CD,...


Platforms: *nix

Crossfire-Extended is an extended media for the Free/OpenSource MMUD/RPG Crossfire. Crossfire-Extended is a successor project/media-fork to the RPG crossfire. It contains all the maps, features and objects of crossfire but adds 50% to the world and aims at a higher rate of media creation....


Platforms: *nix