Rob Story wrobstory

Papers

Benchmarking seems not to be a main focus of any specific academic field, although the problem has been addressed by many different groups in CS.

Some papers I found interesting:

Clojure Destructuring Tutorial and Cheat Sheet

(Related blog post)

Simply put, destructuring in Clojure is a way extract values from a datastructure and bind them to symbols, without having to explicitly traverse the datstructure. It allows for elegant and concise Clojure code.

Vectors and Sequences

General Background and Overview

Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
Models and Issues in Data Stream Systems
Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
[Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

	; it's a bit cumbersome to set up and there's the unfortunate need to ignore the tag
	; in the individual methods, but this allows you to leave the interpretation of open
	; variants, well, open for extension by multimethod.

	; dispatch off the first argument, which will be the tag
	(defmethod command-multi (fn [tag & data] tag))

	; the first argument to the method is still the tag
	(defmulti command-multi :print [_ val] (println val))
	(defmulti command-multi :read [_ fname] (slurp fname))

	Q: what book should i use to learn ML?

	A: use several, and find the one that speaks to you.

	the list below assumes you know a bit of math but
	are not very mathematical, and are interested in learning
	enough to be practical. that is, it is not at the
	mathematical level of MIJ's alleged list
	(cf. https://news.ycombinator.com/item?id=1055389 )

	(comment ; Fun with transducers, v2

	;; Still haven't found a brief + approachable overview of Clojure 1.7's new
	;; transducers in the particular way I would have preferred myself - so here goes:

	;;;; Definitions
	;; Looking at the `reduce` docstring, we can define a 'reducing-fn' as:
	(fn reducing-fn ([]) ([accumulation next-input])) -> new-accumulation
	;; (The `[]` arity is actually optional; it's only used when calling
	;; `reduce` w/o an init-accumulator).

	#!/bin/sh

	hash brew &> /dev/null
	if [ $? -eq 1 ]; then
	echo 'Installing Homebrew ...'
	ruby -e "$(curl -fsSL https://raw.github.com/Homebrew/homebrew/go/install)"
	fi

	# Ensure Homebrew formulae are updated
	brew update

	# (ubuntu)
	# add to end of .bashrc :
	export PS1="\$(__git_ps1) "$PS1

	# gives e.g. (when in a repo):
	(master) user@host:~$

	# more info: http://stackoverflow.com/questions/15883416/adding-git-branch-on-the-bash-command-prompt