A program to find frequent molecular substructures and discriminative fragments in a database of molecule descriptions. The algorithm is based on the Eclat algorithm for frequent item set mining.
A program to demonstrate the optimization process of particle swarm optimization. A two-dimensional objective function is visualized by level of grey: the lighter the color, the higher the function value. The particles are shown as red circles, their trajectory as red lines.
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the ...
Programs to induce a naive possibilistic classifier (a possibilistic analog of the naive Bayes classifier) and to classify new data with an induced naive possibilistic classifier.
Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part.
Computes the hafnian of a nonnegative integer matrix. Notes: Copy hafnian.c to main.c, in the same directory as Rothberg s code (see above). You can download the .tar directory with the code weighted-match.tar here. Then "make" the codes (this codes are in C, not C++). The program is then run by the ...
Example of a digital data transmission implementing GMSK modulation
This Simulink model simulates as an example the transmission and reception of random digital data modulated with GMSK. The purpose of this model is to illustrate how part of the GSM transmission and reception works. It also measures ...
