Eirik L. Vullum eiriklv

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

303 See Other

Location: https://github.com/wsargent/docker-cheat-sheet

Hi there!

The docker cheat sheet has moved to a Github project under https://github.com/wsargent/docker-cheat-sheet.

Please click on the link above to go to the cheat sheet.

Linux fun-o-matic

How to have some fun using the terminal.

Install cowsay [0] via : sudo apt-get install cowsay
Install fortune [1] via : sudo apt-get install fortune
Make sure you have Ruby installed via : ruby -v
Install the lolcat [2] via : gem gem install lolcat
Profit!

Generators vs Fibers

Both ES6 generators and node-fibers can be used to block a coroutine while waiting on some I/O without blocking the entire process. Both can do this for arbitrarily deep call stacks. The main difference between the capabilities of the two is how explicit the syntax is.

Generators - Safe, but Explicit

In code that uses ES6 generators:

var run = require('gen-run'); // https://github.com/creationix/gen-run

	var q = require('q')

	function generatorify(fn, context) {
	return function() {
	var deferred = q.defer(),
	callback = makeCallback(deferred),
	args = Array.prototype.slice.call(arguments).concat(callback);
	fn.apply(context, args);
	return deferred.promise;
	};


	<html>
	<head>
	<title>Test</title>
	<script src="http://code.jquery.com/jquery-1.9.1.js"></script>
	<script src="http://code.jquery.com/ui/1.10.3/jquery-ui.js"></script>
	<link rel="stylesheet" href="http://code.jquery.com/ui/1.10.3/themes/smoothness/jquery-ui.css" />
	<script src="http://fb.me/react-0.5.1.js"></script>
	<script src="http://fb.me/JSXTransformer-0.5.1.js"></script>
	</head>

	log = console.log.bind(console);

	maybe = v => {

	function * f () {
	if (v) yield v;
	}

	f.bind = f =>
	v ? f(v) : maybe();

	//Knapsack algorithm
	//==================
	// wikipedia: [Knapsack (0/1)](http://en.wikipedia.org/wiki/Knapsack_problem#0.2F1_Knapsack_Problem)
	// Given a set `[{weight:Number, benefit:Number}]` and a capacity,
	// find the maximum value possible while keeping the weight below
	// or equal to the capacity
	// params:
	// `capacity` : Number,
	// `items` : [{w:Number, b:Number}]
	// returns:

	var above = function(limit){
	return function(value){
	return value > limit;
	};
	};

	var isAbove10 = above(10);

	console.log(isAbove10(5)); // false
	console.log(isAbove10(8)); // false

	// mongoose v3.6.18
	//
	var mongoose = require('mongoose');
	mongoose.connect('localhost/mydb');

	var Schema = mongoose.Schema;

	var MasterSchema = new Schema({
	name: String,
	});