tomrockdsouza

/**
 * @main-author Tomrock D'souza, St. Francis Institute Of Technology, University of Mumbai, 2017
 * Email: [email protected] 
 * No reproduction in whole or part without maintaining this notice
 * and imposing this condition on any subsequent users.
 * Example: 
 * Enter number of Factories: 3
 * Enter number of Exporters: 2
 * Cost for Factory0 and Exporter0 = 8
 * Cost for Factory1 and Exporter0 = 6

tomrockdsouza

/**
 * This Program Only Works in DOS-BOX on Turbo C++ Compiler
 * To Get DOS-BOX emulator with Turbo C : https://www.google.com/search?q=turbo+C
 *
 * @author Tomrock D'souza, St. Francis Institute Of Technology, University of Mumbai, 2017
 * Email: [email protected]
 * No reproduction in whole or part without maintaining this notice
 */
#include<stdio.h>
#include<conio.h>

tomrockdsouza

/** The class encapsulates an implementation of the Kmeans algorithm for Linear Dataset
 *
 * First	argument is for Number of Elements
 * Second	argument is for Start of Randomizer
 * Third	argument is for End of Randomizer
 * Fourth	argument is for Number of Clusters
 *
 * Usage with the command line :
 * >java Kmeans 7 10 20 3
 * This Means 7 tupples of data will be created

tomrockdsouza

/** The class encapsulates an implementation of the Kmeans algorithm for 2D Dataset
 *
 * First	argument is for Number of Elements
 * Second	argument is for Start of Randomizer
 * Third	argument is for End of Randomizer
 * Fourth	argument is for Number of Clusters
 *
 * Usage with the command line :
 * >java Kmean2D 7 10 20 3
 * This Means 7 tupples of data will be created

tomrockdsouza

/** The class encapsulates an implementation of the Naive-Bayes algorithm
 *
 * First argument is for Outlook
 * Sunny=2 Overcast=1 Rain=0
 *
 * Second argument is for Temperature
 * Hot=2 Mild=1 Cool=0
 *
 * Third argument is for Humidity
 * High=1 Normal=0

tomrockdsouza

/** 
 * The class encapsulates an implementation of the Asynchornous Mulithreaded Odd-EvenTransposition
 * @contributor Tomrock D'souza, St. Francis Institute Of Technology, University of Mumbai, 2017
 * Part of This code is Taken from :  www.roseindia.net/java/beginners/arrayexamples/OddEvenTranspositionSort.shtml
 * No reproduction in whole or part without maintaining this notice
 * and imposing this condition on any subsequent users.
 */
class EvenOddTrans extends Thread {
	private int j;
	public static final int array[] = {12,9,4,99,120,1,3,10,13};

tomrockdsouza

import java.io.*;
import java.util.*;

/** The class encapsulates an implementation of the Apriori algorithm
 * to compute frequent itemsets.
 *
 * Added Association Rules By Tomrock D'souza : https://gist.github.com/ENGINEER-RC/34bdc63161befad19ce33564a473fc58
 *
 * Datasets contains integers (>=0) separated by spaces, one transaction by line, e.g.
 * 1 2 5 

tomrockdsouza

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
  int random_number(int min_num, int max_num) {
    int result = 0, low_num = 0, hi_num = 0;
    if (min_num < max_num) {
      low_num = min_num;
      hi_num = max_num + 1; // include max_num in output
    } else {
      low_num = max_num + 1; // include max_num in output