coderanger

To use this snippet first replace the _default in the URL with your environment name if you are using somethign other than the global default. Next in the run list, replace ... with your cookbook names. Unlike other run lists, you cannot have roles here, and you don't use the 'recipe[foo]' syntax, just 'foo'.

bitemyapp

The Learning Haskell guide has been moved to a git repo to enable outside contribution

Find it here: https://github.com/bitemyapp/learnhaskell

selenamarie

Ideal Postgres environment

Documentation

• Documented replication topology
• Documented network topology
• Documented interface topology - including users, passwords, connection estimates, load balancers, connection proxies
• Documented procedure, schedule for failover and testing
• Documented procedure, schedule for disaster recovery and testing

deserat

The script:

var http = require('http')
var fs = require('fs')


http.createServer(function (req, res) {
  res.writeHead(200, {'Content-Type': 'text/plain'})
  res.end("hello world")
}).listen(3000);

debasishg

General Background and Overview

1. 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.
2. Models and Issues in Data Stream Systems
3. 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
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t

abhin4v

import qualified Data.PQueue.Prio.Min as PQ
import qualified Data.HashSet as Set
import qualified Data.HashMap.Strict as Map
import Data.Hashable (Hashable)
import Data.List (foldl')
import Data.Maybe (fromJust)

astarSearch :: (Eq a, Hashable a) => a -> (a -> Bool) -> (a -> [(a, Int)]) -> (a -> Int) -> Maybe (Int, [a])
astarSearch startNode isGoalNode nextNodeFn heuristic =
  astar (PQ.singleton (heuristic startNode) (startNode, 0))

deniszh

#!/usr/bin/env python

import os
import mmap
import struct
import signal
import optparse
import cql

try:

dctrwatson

[21174748.746874] INFO: task jsvc:9672 blocked for more than 120 seconds.
[21174748.749104] "echo 0 > /proc/sys/kernel/hung_task_timeout_secs" disables this message.
[21174748.751489] jsvc            D ffffffff81806240     0  9672   9639 0x00000000
[21174748.751497]  ffff8803436abe08 0000000000000082 ffff8800850bd000 ffffffffffffff98
[21174748.751516]  ffff8803436abfd8 ffff8803436abfd8 ffff8803436abfd8 00000000000137c0
[21174748.751534]  ffff88032bf39700 ffff8805fe535c00 ffff880622cf40c0 ffff8805fe535c00
[21174748.751553] Call Trace:
[21174748.751563]  [<ffffffff8165ba6f>] schedule+0x3f/0x60
[21174748.751573]  [<ffffffff8165d86d>] rwsem_down_failed_common+0xcd/0x170
[21174748.751583]  [<ffffffff8165d923>] rwsem_down_write_failed+0x13/0x20

panzi

#include <stdio.h>
#include <complex.h>
#define dc double complex
                                         dc
                                         Y(dc
                                           V,
                                      dc B,dc c){
                                        return
                               (cabs (V)<6)?(c?Y(V   *V+
                                 B,B,c-1):c):(2+c-4*cpow

al3xandru

## Day 1 - Track 1  ##

00:10:00 Pat Helland: Keystone - Between a ROC and a SOFT place
01:12:18 Lindsey Kuper: LVars: Lattice-based Data Structures for Deterministic Parallelism
02:11:54 Eric Redmond: Yokozuna!
04:10:50 Justin Shoffstall & Charlie Voiselle: The Seven-Layer Burrito; Troubleshooting a Distributed Database in Production
05:11:00 Peter Bailis: Bad as I wanna be - Coordination and Consistency in Distributed Databases
06:13:24 Joseph Blomstedt: Bringing Consistency to Riak (Part 2) 
07:16:22 Lightning talks (_nb_: you **must** see @tsantero!)