bishboria

These links no longer work. Springer have pulled the free plug.

Graduate texts in mathematics

duplicates = multiple editions

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen

bitemyapp

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

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

pozorvlak

Here's where I understand the state of the art to be:

• In this INRIA tech report, Shapiro, Preguiça, Baquero and Zawirski (SPBZ) prove, amongst other things, that a sufficient condition for CRDTs to achieve eventual consistency on networks which may reorder and duplicate packets (which I'll call flaky networks, henceforth) is that
  1. the underlying datatype forms a semilattice,
  2. messages are full states,
  3. incoming messages are combined with the node's current state using the least-upper-bound operation in the semilattice.
• It's possible to relax condition 2 and still achieve eventual consistency over flaky networks by fragmenting the state into independent parts and transmitting updates to each part separately. For instance, in the G-Set CRDT (an add-only bitset) one can transmit only the index of the element to be added.
• In [these slides from a talk at Dagstuhl](http://www.dagstuhl.de/mat/Files/13/13081/13081.BaqueroCarlos.Sl

pbailis

Context: I was asked for a list of interesting reading relating to "distributed databases, behavior under partitions and failures, failure detection." Here's what I came up with in about an hour.

For textbooks, "Introduction to Reliable and Secure Distributed Programming" is a superb introduction to distributed computing from a formal perspective; it's really not about "programming" or "engineering" but about distributed system fundamentals like consensus, distributed registers, and broadcast. Used in Berkeley's Distributed Computing course (and HT to @lalithsuresh) Book Site

Notes from courses like Lorenzo Alvisi's Distributed Computing class can be great.

There are a bunch of classics on causality, [Paxos](ht

sreeix

I am sure you have heard about memcached. It is a classic key value store. Maintaining a O(1) execution time for most operations.

What We'd like you to implement is memcached in ruby(or the language of your choice)

I normally start memcached this memcached -m 1280 -vv (Actually I use -t 6, but ignore it for now)

Where -m is the amount of memory to allocate and -vv is the verbosity of the logs.

sreeix

• [Ciju] (https://gist.github.com/4664768)
• Sreekanth
• Dinesh
• Anantha
• Sreehari
• Pavana
• Rahul

dmytro

#!/bin/bash
# ssh-multi
# D.Kovalov
# Based on http://linuxpixies.blogspot.jp/2011/06/tmux-copy-mode-and-how-to-control.html

# a script to ssh multiple servers over multiple tmux panes


starttmux() {
    if [ -z "$HOSTS" ]; then

adammw

Node.js for Raspberry Pi

Pre-built binaries

Recent releases have been pre-built using cross-compilers and this script and are downloadable below.

If you have found these packages useful, give me a shout out on twitter: @adammw

erikh

#!/usr/bin/env sh

##
# This is script with usefull tips taken from:
#   https://github.com/mathiasbynens/dotfiles/blob/master/.osx
#
# install it:
#   curl -sL https://raw.github.com/gist/2108403/hack.sh | sh
#

sreeix

ssh-rsa AAAAB3NzaC1yc2EAAAADAQABAAABAQDZIQY04o7NdG4QmJ3uMSYWV06fYDYIDhqyGGswItkzC52Zf5FirAblJO6ypgGjPN/Ivo69sZPR5NMxwNV9RhUw9f4NEuYc2vZuhXUXdgZhWBXGtI9FykkStpG9VBp/8ZF1GUQmxcDqoLYT3P1vLMkUU5f54C6OakHtOp3WvqeZmQLwfuBy6szRVQQaxj4+ySZw/T4p/lVe5ODhQWytxbFXxQiaiZ2VHMKCpV7zhECfmTCmK/pINJVIU1d77inuuU6RUJrRtjh0Msdx3Qez7vE6FCQK7iBYJPpGFj9fqTqablWglom4dDc/bDznjHg+7RaTPjugL+NceZD0S03HLAg1 v@gadaffi.local