Free CAD Software for Windows 2000

Apriori is a program to find association rules and frequent item sets (also closed and maximal) with the Apriori algorithm (Agrawal et al. 1993), which carries out a breadth first search on the subset lattice and determines the support of item sets by...

Ultra AutoCAD Tool is an ultra-fast utility program for AutoCAD drawing files. Features include: extract data from drawing files (CSV,XML,HTML) and import to a database or Excel workbook, create DXFs from DWGs, find and replace text, find and replace...

dvisvgm (64-bit) is a simple and command line-based tool specially designed for TeX / LaTeX users. It converts DVI files to the XML-based scalable vector graphics format SVG. SVG files can be displayed with Adobe's SVG browser plug-in or the Java-based...

dvisvgm (32-bit) is a simple and command line-based tool specially designed for TeX / LaTeX users. It converts DVI files to the XML-based scalable vector graphics format SVG. SVG files can be displayed with Adobe's SVG browser plug-in or the Java-based...

Sequoia is a program to find frequent sequences with unique occurrences of items and weight averaging. That is, an item may occur only once in each transaction (and thus also in each found frequent subsequence). The subsequences may contain gaps, that is,...

A very easy to use application to design and plan OO scale or OO/HO gauge card models. It can be used immediately without any learning curve. Simply drag lines and snap them to a grid. Measurements are shown in real size and clip art is included. Plans...

IsTa is a program to find closed frequent item sets by intersecting transactions (Intersecting Transactions), which is based on the insight that an item set is closed if it is the intersection of all transactions that contain it. Such an approach can be...

FPgrowth is a program to find frequent item sets (also closed and maximal) with the fpgrowth algorithm (frequent pattern growth, Han et al 2000), which represents the transaction database as a prefix tree which is enhanced with pointers that organize the...

SaM is a program to find frequent item sets (also closed and maximal) with a split and merge algorithm (Split and Merge), which combines a depth-first traversal of the subset lattice with a horizontal transaction representation. The main strength of this...

JIM is a program to find Jaccard item sets with an extension of the Eclat algorithm. In analogy to frequent item set mining, where one tries to find item sets the support of which exceeds a user-specified threshold (minimum support) in a database of...