7-11

Author: DorgenJones

.classpath

@@ -0,0 +1,13 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<classpath>
+	<classpathentry kind="src" path="src"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/jdk1.8.0_45"/>
+	<classpathentry kind="lib" path="lib/jts-1.8.jar"/>
+	<classpathentry kind="lib" path="lib/macrofocus-common.jar"/>
+	<classpathentry kind="lib" path="lib/macrofocus-data.jar"/>
+	<classpathentry kind="lib" path="lib/poi-3.5-FINAL.jar"/>
+	<classpathentry kind="lib" path="lib/poi-ooxml-3.5-FINAL.jar"/>
+	<classpathentry kind="lib" path="lib/xom-1.2.10.jar"/>
+	<classpathentry kind="lib" path="lib/jxl.jar"/>
+	<classpathentry kind="output" path="bin"/>
+</classpath>

.project

@@ -0,0 +1,17 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>ProbabilisticCube</name>
+	<comment></comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.jdt.core.javabuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.jdt.core.javanature</nature>
+	</natures>
+</projectDescription>

.settings/org.eclipse.jdt.core.prefs

@@ -0,0 +1,11 @@
+eclipse.preferences.version=1
+org.eclipse.jdt.core.compiler.codegen.inlineJsrBytecode=enabled
+org.eclipse.jdt.core.compiler.codegen.targetPlatform=1.8
+org.eclipse.jdt.core.compiler.codegen.unusedLocal=preserve
+org.eclipse.jdt.core.compiler.compliance=1.8
+org.eclipse.jdt.core.compiler.debug.lineNumber=generate
+org.eclipse.jdt.core.compiler.debug.localVariable=generate
+org.eclipse.jdt.core.compiler.debug.sourceFile=generate
+org.eclipse.jdt.core.compiler.problem.assertIdentifier=error
+org.eclipse.jdt.core.compiler.problem.enumIdentifier=error
+org.eclipse.jdt.core.compiler.source=1.8

.~lock.test2.xls#

@@ -0,0 +1 @@
+,root,localhost.localdomain,11.07.2015 09:09,file:///root/.config/libreoffice/4;

bin/edu/pcube/convolution/Complex.class

@@ -0,0 +1,126 @@
+package edu.pcube.convolution;
+
+public class Complex {
+    private final double re;   // the real part
+    private final double im;   // the imaginary part
+
+    // create a new object with the given real and imaginary parts
+    public Complex(double real, double imag) {
+        re = real;
+        im = imag;
+    }
+
+    // return a string representation of the invoking Complex object
+    public String toString() {
+        if (im == 0) return re + "";
+        if (re == 0) return im + "i";
+        if (im <  0) return re + " - " + (-im) + "i";
+        return re + " + " + im + "i";
+    }
+
+    // return abs/modulus/magnitude and angle/phase/argument
+    public double abs()   { return Math.hypot(re, im); }  // Math.sqrt(re*re + im*im)
+    public double phase() { return Math.atan2(im, re); }  // between -pi and pi
+
+    // return a new Complex object whose value is (this + b)
+    public Complex plus(Complex b) {
+        Complex a = this;             // invoking object
+        double real = a.re + b.re;
+        double imag = a.im + b.im;
+        return new Complex(real, imag);
+    }
+
+    // return a new Complex object whose value is (this - b)
+    public Complex minus(Complex b) {
+        Complex a = this;
+        double real = a.re - b.re;
+        double imag = a.im - b.im;
+        return new Complex(real, imag);
+    }
+
+    // return a new Complex object whose value is (this * b)
+    public Complex times(Complex b) {
+        Complex a = this;
+        double real = a.re * b.re - a.im * b.im;
+        double imag = a.re * b.im + a.im * b.re;
+        return new Complex(real, imag);
+    }
+
+    // scalar multiplication
+    // return a new object whose value is (this * alpha)
+    public Complex times(double alpha) {
+        return new Complex(alpha * re, alpha * im);
+    }
+
+    // return a new Complex object whose value is the conjugate of this
+    public Complex conjugate() {  return new Complex(re, -im); }
+
+    // return a new Complex object whose value is the reciprocal of this
+    public Complex reciprocal() {
+        double scale = re*re + im*im;
+        return new Complex(re / scale, -im / scale);
+    }
+
+    // return the real or imaginary part
+    public double re() { return re; }
+    public double im() { return im; }
+
+    // return a / b
+    public Complex divides(Complex b) {
+        Complex a = this;
+        return a.times(b.reciprocal());
+    }
+
+    // return a new Complex object whose value is the complex exponential of this
+    public Complex exp() {
+        return new Complex(Math.exp(re) * Math.cos(im), Math.exp(re) * Math.sin(im));
+    }
+
+    // return a new Complex object whose value is the complex sine of this
+    public Complex sin() {
+        return new Complex(Math.sin(re) * Math.cosh(im), Math.cos(re) * Math.sinh(im));
+    }
+
+    // return a new Complex object whose value is the complex cosine of this
+    public Complex cos() {
+        return new Complex(Math.cos(re) * Math.cosh(im), -Math.sin(re) * Math.sinh(im));
+    }
+
+    // return a new Complex object whose value is the complex tangent of this
+    public Complex tan() {
+        return sin().divides(cos());
+    }
+    
+
+
+    // a static version of plus
+    public static Complex plus(Complex a, Complex b) {
+        double real = a.re + b.re;
+        double imag = a.im + b.im;
+        Complex sum = new Complex(real, imag);
+        return sum;
+    }
+
+
+
+    // sample client for testing
+    public static void main(String[] args) {
+        Complex a = new Complex(5.0, 6.0);
+        Complex b = new Complex(-3.0, 4.0);
+
+        System.out.println("a            = " + a);
+        System.out.println("b            = " + b);
+        System.out.println("Re(a)        = " + a.re());
+        System.out.println("Im(a)        = " + a.im());
+        System.out.println("b + a        = " + b.plus(a));
+        System.out.println("a - b        = " + a.minus(b));
+        System.out.println("a * b        = " + a.times(b));
+        System.out.println("b * a        = " + b.times(a));
+        System.out.println("a / b        = " + a.divides(b));
+        System.out.println("(a / b) * b  = " + a.divides(b).times(b));
+        System.out.println("conj(a)      = " + a.conjugate());
+        System.out.println("|a|          = " + a.abs());
+        System.out.println("tan(a)       = " + a.tan());
+    }
+
+}

bin/edu/pcube/convolution/FFT.class

@@ -0,0 +1,146 @@
+package edu.pcube.convolution;
+
+import java.util.Arrays;
+
+import com.sun.xml.internal.bind.v2.runtime.unmarshaller.XsiNilLoader.Array;
+
+
+public class FFT {
+
+	// compute the FFT of x[], assuming its length is a power of 2
+	public static Complex[] fft(Complex[] x) {
+		int N = x.length;
+
+		// base case
+		if (N == 1) return new Complex[] { x[0] };
+		
+		// radix 2 Cooley-Tukey FFT
+		if (N % 2 != 0) { throw new RuntimeException("N is not a power of 2"); }
+
+		// fft of even terms
+		Complex[] even = new Complex[N/2];
+		for (int k = 0; k < N/2; k++) {
+			even[k] = x[2*k];
+		}
+		Complex[] q = fft(even);
+
+		// fft of odd terms
+		Complex[] odd  = even;  // reuse the array
+		for (int k = 0; k < N/2; k++) {
+			odd[k] = x[2*k + 1];
+		}
+		Complex[] r = fft(odd);
+
+		// combine
+		Complex[] y = new Complex[N];
+		for (int k = 0; k < N/2; k++) {
+			double kth = -2 * k * Math.PI / N;
+			Complex wk = new Complex(Math.cos(kth), Math.sin(kth));
+			y[k]       = q[k].plus(wk.times(r[k]));
+			y[k + N/2] = q[k].minus(wk.times(r[k]));
+		}
+		return y;
+	}
+
+
+	// compute the inverse FFT of x[], assuming its length is a power of 2
+	public static Complex[] ifft(Complex[] x) {
+		int N = x.length;
+		Complex[] y = new Complex[N];
+
+		// take conjugate
+		for (int i = 0; i < N; i++) {
+			y[i] = x[i].conjugate();
+		}
+
+		// compute forward FFT
+		y = fft(y);
+
+		// take conjugate again
+		for (int i = 0; i < N; i++) {
+			y[i] = y[i].conjugate();
+		}
+
+		// divide by N
+		for (int i = 0; i < N; i++) {
+			y[i] = y[i].times(1.0 / N);
+		}
+
+		return y;
+
+	}
+
+	// compute the circular convolution of x and y
+	public static Complex[] cconvolve(Complex[] x, Complex[] y) {
+
+		// should probably pad x and y with 0s so that they have same length
+		// and are powers of 2
+		if (x.length != y.length) { throw new RuntimeException("Dimensions don't agree"); }
+
+		int N = x.length;
+
+		// compute FFT of each sequence
+		Complex[] a = fft(x);
+		Complex[] b = fft(y);
+
+		// point-wise multiply
+		Complex[] c = new Complex[N];
+		for (int i = 0; i < N; i++) {
+			c[i] = a[i].times(b[i]);
+		}
+
+		// compute inverse FFT
+		return ifft(c);
+	}
+
+	private static boolean is2Pow(int n) {
+		// TODO Auto-generated method stub
+		int result = ((n&(n-1))==0) ? (1) : (0);
+		if(result==1){
+			return true;
+		}else {
+			return false;
+		}
+	}
+
+
+	// compute the linear convolution of x and y
+	public static Complex[] convolve(Complex[] x, Complex[] y) {
+		Complex ZERO = new Complex(0, 0);
+
+		Complex[] a = new Complex[2*x.length];
+		for (int i = 0;        i <   x.length; i++) a[i] = x[i];
+		for (int i = x.length; i < 2*x.length; i++) a[i] = ZERO;
+
+		Complex[] b = new Complex[2*y.length];
+		for (int i = 0;        i <   y.length; i++) b[i] = y[i];
+		for (int i = y.length; i < 2*y.length; i++) b[i] = ZERO;
+
+		return cconvolve(a, b);
+	}
+
+	// display an array of Complex numbers to standard output
+	public static void show(Complex[] x, String title) {
+		System.out.println(title);
+		System.out.println("-------------------");
+		for (int i = 0; i < x.length; i++) {
+			System.out.println(x[i]);
+		}
+		System.out.println();
+	}
+
+	public static void main(String[] args) { 
+		int N = 3;
+
+		Complex[] x = new Complex[N];
+		Complex[] y = new Complex[N];
+		// original data
+		for (int i = 0; i < N; i++) {
+			x[i] = new Complex(1, 0);
+			y[i] = new Complex(1, 0);
+		}
+		Complex[] d = convolve(x, y);
+		show(d, "d = convolve(x, y)");
+
+	}
+}

bin/edu/pcube/cube/Cube.class

@@ -0,0 +1,39 @@
+package edu.pcube.cube;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import edu.pcube.datastore.InMemoryDataStore;
+
+
+/**
+ * Models a multidimensional dataset, where that data are aggregated across an arbitrary number of dimensions.
+ * It can also be seen as a lattice of cuboids.
+ */
+public class Cube {
+	
+	private final InMemoryDataStore inMemoryDataStore;
+	private Dimensions baseCellDimension;
+	private final Cuboid baseCuboid;
+	
+	private Map<Cuboid, Cuboid> child = new HashMap<Cuboid, Cuboid>();
+
+	public Cube(InMemoryDataStore inMemoryDataStore) {
+		this.inMemoryDataStore = inMemoryDataStore;
+		this.baseCellDimension=Dimensions.create(this.inMemoryDataStore.getBaseDimensions());
+		this.baseCuboid = new Cuboid(this, baseCellDimension);
+	}
+
+	public InMemoryDataStore getDataFrame() {
+		return inMemoryDataStore;
+	}
+
+	public Dimensions getBaseCellDimension() {
+		return baseCellDimension;
+	}
+
+	public Cuboid getBaseCuboid() {
+		return baseCuboid;
+	}
+
+}