From 925087356b853e2099c1b60d8b757d7aa02121a9 Mon Sep 17 00:00:00 2001
From: Chris Dyer <cdyer@cab.ark.cs.cmu.edu>
Date: Tue, 2 Oct 2012 00:19:43 -0400
Subject: cdec cleanup, remove bayesian stuff, parsing stuff

---
 gi/posterior-regularisation/prjava/src/arr/F.java | 99 -----------------------
 1 file changed, 99 deletions(-)
 delete mode 100644 gi/posterior-regularisation/prjava/src/arr/F.java

(limited to 'gi/posterior-regularisation/prjava/src/arr/F.java')

diff --git a/gi/posterior-regularisation/prjava/src/arr/F.java b/gi/posterior-regularisation/prjava/src/arr/F.java
deleted file mode 100644
index be0a6ed6..00000000
--- a/gi/posterior-regularisation/prjava/src/arr/F.java
+++ /dev/null
@@ -1,99 +0,0 @@
-package arr;
-
-import java.util.Arrays;
-import java.util.Random;
-
-public class F {
-	public static Random rng = new Random();
-
-	public static void randomise(double probs[])
-	{
-		randomise(probs, true);
-	}
-
-	public static void randomise(double probs[], boolean normalise)
-	{
-		double z = 0;
-		for (int i = 0; i < probs.length; ++i)
-		{
-			probs[i] = 10 + rng.nextDouble();
-			if (normalise)
-				z += probs[i];
-		}
-
-		if (normalise)
-			for (int i = 0; i < probs.length; ++i)
-				probs[i] /= z;
-	}
-	
-	public static void uniform(double probs[])
-	{
-		for (int i = 0; i < probs.length; ++i)
-			probs[i] = 1.0 / probs.length;
-	}
-	
-	public static void l1normalize(double [] a){
-		double sum=0;
-		for(int i=0;i<a.length;i++){
-			sum+=a[i];
-		}
-		if(sum==0)
-			Arrays.fill(a, 1.0/a.length);
-		else
-		{
-			for(int i=0;i<a.length;i++){
-				a[i]/=sum;
-			}
-		}
-	}
-	
-	public  static void l1normalize(double [][] a){
-		double sum=0;
-		for(int i=0;i<a.length;i++){
-			for(int j=0;j<a[i].length;j++){
-				sum+=a[i][j];
-			}
-		}
-		if(sum==0){
-			return;
-		}
-		for(int i=0;i<a.length;i++){
-			for(int j=0;j<a[i].length;j++){
-				a[i][j]/=sum;
-			}
-		}
-	}
-	
-	public static double l1norm(double a[]){
-		// FIXME: this isn't the l1 norm for a < 0
-		double norm=0;
-		for(int i=0;i<a.length;i++){
-			norm += a[i];
-		}
-		return norm;
-	}
-	
-	public static double l2norm(double a[]){
-		double norm=0;
-		for(int i=0;i<a.length;i++){
-			norm += a[i]*a[i];
-		}
-		return Math.sqrt(norm);
-	}
-	
-	public static int argmax(double probs[])
-	{
-		double m = Double.NEGATIVE_INFINITY;
-		int mi = -1;
-		for (int i = 0; i < probs.length; ++i)
-		{
-			if (probs[i] > m)
-			{
-				m = probs[i];
-				mi = i;
-			}
-		}
-		return mi;
-	}
-	
-}
-- 
cgit v1.2.3