cs224

## 2018-05-02-gpy-gpflow-differences.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                cs224
                / 2018-05-02-gpy-gpflow-differences.ipynb
            
            
              Created
              May 2, 2018 11:31
            
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## 2018-03-22-gpy-gpflow-differences.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                cs224
                / 2018-03-22-gpy-gpflow-differences.ipynb
            
            
              Created
              March 22, 2018 16:05
            
              
                gpy delivers results that differ from gpflow
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## hausarbeit_stein.ipynb

      
              1 file
            
          
              0 forks
            
          
              1 comment
            
          
              0 stars
            
          
                cs224
                / hausarbeit_stein.ipynb
            
            
              Created
              December 9, 2017 09:15
            
              
                using sympy for numeric calculations with arbitrary precision
              
          
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## 00_pymc3_mixture_experiments_shifted_gamma.py

import numpy as np, pandas as pd, matplotlib.pyplot as plt, seaborn as sns
import scipy.stats as stats
from theano import tensor as tt
import pymc3 as pm
from pymc3.distributions.dist_math import bound, logpow, gammaln
from pymc3.distributions.distribution import draw_values, generate_samples

SEED = 5132290 # from random.org
np.random.seed(SEED)

## pyjags_rain_sprinkler_grass_simple_bayesian_network.py

import math
import pyjags
import numpy as np
import pandas as pd

np.random.seed(0)
np.set_printoptions(precision=3)

def pyjags_trace():

## CoIterator.java
package control.structures.continuations.quasarFiberChannelSameThread;

import java.io.Serializable;
import java.util.Iterator;
import java.util.NoSuchElementException;

import co.paralleluniverse.fibers.SuspendExecution;
import co.paralleluniverse.strands.Strand.State;
import co.paralleluniverse.strands.SuspendableCallable;

## BasicXADataSourceUsageTest.java
package xaresource;

import static org.hamcrest.CoreMatchers.is;
import static org.junit.Assert.assertThat;
import static org.junit.Assert.fail;

import java.io.File;
import java.io.FileInputStream;
import java.io.IOException;
import java.nio.charset.StandardCharsets;

## incanter-join.clj
(ns experiment.incanter
  (:require [incanter.core :as i]))


(def join-dataset-1 (i/dataset [:id :vehicle-type]
                               [[1 "car"]
                                [2 "motor-bike"]
                                [3 "train"]]))
;;;(i/view join-dataset-1)
(def join-dataset-2 (i/dataset [:id :number-wheels]

## disjoint-sets-of-a-collection-of-sets.clj
;;; The solution relies on the following implementation of the partitions function:
;;; https://gist.github.com/ray1729/5830608

(defn partition-combination-sets [partition]
  (let [partition (vec partition)
        c (count partition)]
    (for [i (range 1 (inc c))
          combination (combinatorics/combinations (range c) i)]
      ;; the following (map partition combination) may be a bit confusing, because it does use the vector
      ;; defined above as a function and has nothing to do with the standard partition function of the clojure core language.

## gist:4570937
(defn datomic-group-fds-by-fd-id [fd-v & {:keys [id-fn] :or {id-fn :hash}}]
  (q '[:find ?fd-id (into [] ?fd)
       :in $fd-v
       :where
       [$fd-v ?fd ?fd-id]
       ]
      (maps->rel fd-v [id-fn])))

(defn datomic-get-redundant-files [grouped-fds-by-fd-id & {:keys [id-fn] :or {id-fn :hash}}]
  (q '[:find ?fd-v-g

	import numpy as np, pandas as pd, matplotlib.pyplot as plt, seaborn as sns
	import scipy.stats as stats
	from theano import tensor as tt
	import pymc3 as pm
	from pymc3.distributions.dist_math import bound, logpow, gammaln
	from pymc3.distributions.distribution import draw_values, generate_samples

	SEED = 5132290 # from random.org
	np.random.seed(SEED)

	import math
	import pyjags
	import numpy as np
	import pandas as pd

	np.random.seed(0)
	np.set_printoptions(precision=3)

	def pyjags_trace():
	package control.structures.continuations.quasarFiberChannelSameThread;

	import java.io.Serializable;
	import java.util.Iterator;
	import java.util.NoSuchElementException;

	import co.paralleluniverse.fibers.SuspendExecution;
	import co.paralleluniverse.strands.Strand.State;
	import co.paralleluniverse.strands.SuspendableCallable;
	package xaresource;

	import static org.hamcrest.CoreMatchers.is;
	import static org.junit.Assert.assertThat;
	import static org.junit.Assert.fail;

	import java.io.File;
	import java.io.FileInputStream;
	import java.io.IOException;
	import java.nio.charset.StandardCharsets;
	(ns experiment.incanter
	(:require [incanter.core :as i]))


	(def join-dataset-1 (i/dataset [:id :vehicle-type]
	[[1 "car"]
	[2 "motor-bike"]
	[3 "train"]]))
	;;;(i/view join-dataset-1)
	(def join-dataset-2 (i/dataset [:id :number-wheels]
	;;; The solution relies on the following implementation of the partitions function:
	;;; https://gist.github.com/ray1729/5830608

	(defn partition-combination-sets [partition]
	(let [partition (vec partition)
	c (count partition)]
	(for [i (range 1 (inc c))
	combination (combinatorics/combinations (range c) i)]
	;; the following (map partition combination) may be a bit confusing, because it does use the vector
	;; defined above as a function and has nothing to do with the standard partition function of the clojure core language.
	(defn datomic-group-fds-by-fd-id [fd-v & {:keys [id-fn] :or {id-fn :hash}}]
	(q '[:find ?fd-id (into [] ?fd)
	:in $fd-v
	:where
	[$fd-v ?fd ?fd-id]
	]
	(maps->rel fd-v [id-fn])))

	(defn datomic-get-redundant-files [grouped-fds-by-fd-id & {:keys [id-fn] :or {id-fn :hash}}]
	(q '[:find ?fd-v-g