amyjko

I've deprecated this Gist and migrated the CER FAQ to my faculty webpage:

https://github.com/amyjko/faculty/blob/master/components/cer.js

Feel free to submit pull requests on that file to make additions or corrections.

DanTup

// Only tested in Chrome...
// Must browse to "Your Comments" (or "Your Likes") page of activity feed, then pre-load the year you want to delete
// and as many comments as possible (scroll down, they load lazily).
//
// I ACCEPT ABSOLUTELY NO RESPONSIBILITY FOR THIS DOING BAD STUFF. THE NEXT FACEBOOK DEPLOYMENT
// COULD WELL BREAK THIS, OR MAKE IT DO THINGS YOU DO NOT EXPECT. USE IT AS A STARTING POINT ONLY!
//
// It will start failing once it gets to the end, just reload the page and kick it off again.

var rows = document.querySelectorAll('#year_2012 .pam._5shk');

jerith

-----------------------------------------------------------------------------
-- This script creates a new terminal window.
-- 
-- If you disable "When switching to an application, switch to a space with
-- open windows" in the Spaces preferences, the new terminal window will
-- appear on the current workspace.
-- 
-- Terminal.app creates a new window on startup, so we need to check if it's
-- already running and not create an extra window in that case.
-----------------------------------------------------------------------------

tonicebrian

# =============
# Introduction
# =============
# I've been doing some data mining lately and specially looking into `Gradient
# Boosting Trees <http://en.wikipedia.org/wiki/Gradient_boosting>`_ since it is
# claimed that this is one of the techniques with best performance out of the
# box.  In order to have a better understanding of the technique I've reproduced
# the example of section *10.14.1 California Housing* in the book `The Elements of Statistical Learning <http://www-stat.stanford.edu/~tibs/ElemStatLearn/>`_.
# Each point of this dataset represents the house value of a property with some
# attributes of that house. You can get the data and the description of those

paulirish

Open Conference Expectations

This document lays out some baseline expectations between conference speakers and conference presenters. The general goal is to maximize the value the conference provides to its attendees and community and to let speakers know what they might reasonably expect from a conference.

We believe that all speakers should reasonably expect these things, not just speakers who are known to draw large crowds, because no one is a rockstar but more people should have the chance to be one. We believe that conferences are better -- and, dare we say, more diverse -- when the people speaking are not just the people who can afford to get themselves there, either because their company paid or they foot the bill themselves. Basically, this isn't a rock show rider, it's some ideas that should help get the voices of lesser known folks heard.

These expectations should serve as a starting point for discussion between speaker and organizer. They are not a list of demands; they are a list of rea

jboner

Latency Comparison Numbers (~2012)
----------------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

lg0

<!-- copy this to YOUR_THEME.tmTheme-->
  <dict>
	    <key>name</key>
	    <string>diff: deleted</string>
	    <key>scope</key>
	    <string>markup.deleted</string>
	    <key>settings</key>
	    <dict>
	        <key>background</key>
	        <string>#EAE3CA</string>

panicsteve

Dear soon-to-be-former user,

We've got some fantastic news!  Well, it's great news for us anyway.  You, on 
the other hand, are fucked.

We've just been acquired by:

[ ] Facebook
[ ] Google
[ ] Twitter

akidee

require('benchmarks.js/index');

Array.prototype.clone = function () {

	return this.slice(0);
};

/**
 * Original Levenshtein implementation by Andrea Giammarchi
 * See http://webreflection.blogspot.com/2009/02/levenshtein-algorithm-revisited-25.html

mgax

#!/usr/bin/env python
""" Serve WSGI requests via inetd / launchd """

import sys
import socket
from StringIO import StringIO
from wsgiref.simple_server import WSGIServer, make_server

class InetdWSGIServer(WSGIServer):
    """