Max Pleaner MaxPleaner

General Background and Overview

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.
Models and Issues in Data Stream Systems
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
Approximate Frequency Counts over Data Streams 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=rep1&t

#Getting Started

##Webpage:

<html>
<head>
    <title>Testing with Ruby and Selenium WebDriver</title>
</head>
 
<body bgcolor="antiquewhite">

Backend Architectures

Twitter

ror, scala, jetty, erlang, thrift, mongrel, comet server, my-sql, memchached, varnish, kestrel(mq), starling, gizzard, cassandra, hadoop, vertica, munin, nagios, awstats

Introduce Gizzard of Twitter - 트위터의 새로운 분산 관리 라이브러리 Gizzard를 소개합니다.
The Architecture Twitter Uses to Deal with 150M Active Users, 300K QPS, a 22 MB/S Firehose, and Send Tweets in Under 5 Seconds
Scaling Twitter: Making Twitter 10000 Percent Faster

Frontend Development

Attention: the list was moved to

https://github.com/dypsilon/frontend-dev-bookmarks

This page is not maintained anymore, please update your bookmarks.

Each of these commands will run an ad hoc http static server in your current (or specified) directory, available at http://localhost:8000. Use this power wisely.

Discussion on reddit.

Python 2.x

$ python -m SimpleHTTPServer 8000

Originally published in June 2008

When hiring Ruby on Rails programmers, knowing the right questions to ask during an interview was a real challenge for me at first. In 30 minutes or less, it's difficult to get a solid read on a candidate's skill set without looking at code they've previously written. And in the corporate/enterprise world, I often don't have access to their previous work.

To ensure we hired competent ruby developers at my last job, I created a list of 15 ruby questions -- a ruby measuring stick if you will -- to select the cream of the crop that walked through our doors.

What to expect

Candidates will typically give you a range of responses based on their experience and personality. So it's up to you to decide the correctness of their answer.

	# -- immutable: string --

	require 'benchmark'

	class Request
	def initialize(first, last, city, state, country)
	@hash =
	{
	'first' => first,
	'last' => last,

	#simplest ruby program to read from arduino serial,
	#using the SerialPort gem
	#(http://rubygems.org/gems/serialport)

	require "serialport"
	require "pony"

	#params for serial port
	port_str = "/dev/tty.supershoesBT1-SPP" #may be different for you
	#port_str = "/dev/tty.usbmodemfd121" #may be different for you

	require 'rubygems'
	require 'bundler/setup'
	require 'aws-sdk'

	# NOTE: require ENV[...]
	# export AWS_ACCESS_KEY_ID='...'
	# export AWS_SECRET_ACCESS_KEY='...'
	# export AWS_REGION='ap-northeast-1'

	s3 = AWS::S3.new

	# Depth-first search (DFS) is an algorithm for traversing or
	# searching a tree, tree structure, or graph. One starts at
	# the root (selecting some node as the root in the graph case)
	# and explores as far as possible along each branch before backtracking.
	#
	# A graph can be represented by its adjacency matrix G,
	# where G[i][j] == 1 if there is an edge between
	# vertices i and j and 0 otherwise.
	#
	# Below Graph in diagram http://i.imgur.com/sV1UzUn.png