outro56

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Data.SqlClient;
using System.Reflection.Emit;
using System.Collections.Concurrent;
using System.Data;
using System.Reflection;

outro56

1. *General Background and Overview*
  * [Probabilistic Data Structures for Web Analytics and Data Mining](http://highlyscalable.wordpress.com/2012/05/01/probabilistic-structures-web-analytics-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](http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.9846)
  * [Philippe Flajolet’s contribution to streaming algorithms](https://speakerdeck.com/timonk/philippe-flajolets-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](http://www.vldb.org/conf/2002/S10P03.pdf) 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

outro56

#!/usr/bin/env bash

echo "Provisioning virtual machine..."

sudo apt-get update

sudo apt-get install -y python-software properties
sudo apt-get install -y software-properties-common
sudo add-apt-repository -y ppa:webupd8team/java

outro56

# always list in long format
alias ls='ls -la --color'
alias clear=cls

# set dynamic prompt and window/tab title
PS1='\[\e]0;${PWD##*/}\a\]\n'  # set window title
#PS1="$PS1"'\u@\h '            # user@host<space>
PS1="$PS1"'\[\033[32m\]'       # change color
PS1="$PS1"'\w'                 # current working directory
if test -z "$WINELOADERNOEXEC"

outro56

//Find the top X frequent numbers in a stream 
// http://www.cs.berkeley.edu/~satishr/cs270/sp11/rough-notes/Streaming-two.pdf

// Returns the top numbers k and their frequencies in the set
// Complexity:
//    space = O(k)
//    time = O(N)
map<int, int> getFreq(k, Set) {
    A = map<int, int>
    for (k : getTop(k, Set) {

outro56

--===================================================
--=  Niklas Frykholm 
-- basically if user tries to create global variable
-- the system will not let them!!
-- call GLOBAL_lock(_G)
--
--===================================================
function GLOBAL_lock(t)
  local mt = getmetatable(t) or {}
  mt.__newindex = lock_new_index

outro56

progrium/bashstyle

Bash is the JavaScript of systems programming. Although in some cases it's better to use a systems language like C or Go, Bash is an ideal systems language for smaller POSIX-oriented or command line tasks. Here's three quick reasons why:

• It's everywhere. Like JavaScript for the web, Bash is already there ready for systems programming.
• It's neutral. Unlike Ruby, Python, JavaScript, or PHP, Bash offends equally across all communities. ;)
• It's made to be glue. Write complex parts in C or Go (or whatever!), and glue them together with Bash.

This document is how I write Bash and how I'd like collaborators to write Bash with me in my open source projects. It's based on a lot of experience and time collecting best practices. Most of them come from these two articles, but here integrated, slightly modified, and focusing on the most bang for buck items. Plus some ne

outro56

Contents

• Articles
• Algorithms
• Coding
• Guides
• Language-specific
  • JavaScript
• Python

outro56

1. Check if a number is even or odd 
An integer number N is even if its least significant bit is 0 otherwise it is odd

N AND 1

2. Divide by 2
Given an integer number N you can divide it by 2 by shifting all the bits to the right with one position.

N >> 1 

outro56

// Copied from
// http://stackoverflow.com/questions/7956167/how-can-i-quickly-read-bytes-from-a-memory-mapped-file-in-net

public static MemoryMapppedIOExtensions
{
    public unsafe byte[] ReadBytesFast(this MemoryMappedViewAccessor view, int offset, int num)
    {
        try 
        {
            byte[] arr = new byte[num];