ajdavis

PYTHON

sudo yum install glibc-static zlib-static

download python source to /virtualenvs/nodict/Python-2.7.6

Configure to accomplish 3 things: static -pg TODO: NEEDED, ALONG WITH --enable-profiling ?? prefix

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

alexcrichton

@foo = thread_local global i32 3

define i32 @main() {
    %1 = load i32* @foo
    ret i32 %1
}


// ./x86_64-apple-darwin/llvm/Release+Asserts/bin/llc foo.ll -filetype=obj
// gcc -o foo foo.o

dergachev

# taken from http://www.piware.de/2011/01/creating-an-https-server-in-python/
# generate server.xml with the following command:
#    openssl req -new -x509 -keyout server.pem -out server.pem -days 365 -nodes
# run as follows:
#    python simple-https-server.py
# then in your browser, visit:
#    https://localhost:4443

import BaseHTTPServer, SimpleHTTPServer
import ssl

makomweb

#include <iostream>
#include <map>
#include <algorithm>
#include <functional>
#include <memory>

using namespace std;

class EventArgs {
public:

jfreels

d3js: Create an HTML table using d3.js and JSON

datapixie

This is an animated variation of mbostock's normalized stacked barchart. When you click on a block, that block is sent to the bottom of the stack and the bars are reordered by decreasing height of that block. This allows you to compare any value in the stacks with a common baseline, eliminating a common criticism of stacked barcharts.

admsyn

 N = 1024 Accel: 0.05265 FFTW: 0.026213
 N = 2048 Accel: 0.042565 FFTW: 0.049334
 N = 4096 Accel: 0.049206 FFTW: 0.082782
 N = 8192 Accel: 0.118918 FFTW: 0.173506
 N = 16384 Accel: 0.200201 FFTW: 0.371488
 N = 32768 Accel: 0.356826 FFTW: 1.01589
 N = 65536 Accel: 0.844955 FFTW: 1.79316
 N = 131072 Accel: 1.95759 FFTW: 3.99565
 N = 262144 Accel: 4.34179 FFTW: 9.87287
 N = 524288 Accel: 9.31858 FFTW: 19.6675

mbostock

license: gpl-3.0
redirect: https://observablehq.com/@d3/margin-convention

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