I hereby claim:
- I am adamwespiser on github.
- I am adamwespiser (https://keybase.io/adamwespiser) on keybase.
- I have a public key ASDvVfiszzMDEZN4nTBPDJakWg9yqyuwpGloZCblP3xQigo
To claim this, I am signing this object:
#!/usr/bin/env stack | |
{- stack script | |
--compile | |
--copy-bins | |
--resolver lts-14.17 | |
--install-ghc | |
--package turtle | |
--package text | |
--package foldl | |
--package async |
#!/bin/sh -e | |
alias firefox=/Applications/Firefox.app/Contents/MacOS/firefox | |
DIR="${XDG_CACHE_HOME:-$HOME/.cache}" | |
mkdir -p -- "$DIR" | |
TEMP="$(mktemp -d -- "$DIR/firefox-XXXXXX")" | |
trap "rm -rf -- '$TEMP'" INT TERM EXIT | |
firefox -profile "$TEMP" -no-remote "$@" |
#https://stats.stackexchange.com/questions/29044/plotting-confidence-intervals-for-the-predicted-probabilities-from-a-logistic-re | |
library(tidyverse) | |
library(magrittr) | |
set.seed(1234) | |
# create fake data on gambling. Does prob win depend on bid size? | |
mydat <- data.frame( |
# execute the following code to create a theme_publish object | |
# for example, ggplot(mtcars,aes(mpg,hp,size=wt))+geom_point()+theme_publish() | |
# note: for discrete colored data, use gray scale: | |
# > palette(gray(0:3 / 3)) | |
# > greys <- palette() | |
Objective: A comparison of performance between Free Monad and mtl transformers | |
```Haskell | |
Free f a = { unFree :: f (Free f a) } | |
``` | |
http://softwareengineering.stackexchange.com/questions/242795/what-is-the-free-monad-interpreter-pattern | |
# construction of free monad via individual functions | |
http://www.atamo.com/articles/free-monads-wont-detox-your-colon/ |
library(rstan) | |
library(dplyr) | |
options(mc.cores = parallel::detectCores()) | |
rstan_options(auto_write = TRUE) | |
seed_sim = 1234 | |
set.seed(seed_sim) | |
# set up data | |
N = 4000 |
#!/bin/bash | |
echo "current dir" | |
ls ./ | |
echo | |
echo "Root directory" | |
ls / |
I hereby claim:
To claim this, I am signing this object:
(ns bwt.lib) | |
(defn pTest [ys] | |
(sort-by #(second %) (map vector (range) ys))) | |
(defn p [ys] | |
(map second (sort-by #(first %) | |
(map list ys (range))))) | |
(defn recon[s index] | |
(let [l (vec (map first (sort-by #(second %) (map conj (bwt.lib/pTest s)(range))))) |