hamlet ghosthamlet

G-WAN is a new free web server. They seem to be very proud of it, or at least just want to make a lot of money. Well anyway, in almost every sentence they write, they claim that they are 20% cooler than anything else. It feels a bit arrogant. I have to admit, I don't know a lot about web servers, so I can't speak to how good they are.

However, then I saw their Captcha example. I also don't know much about machine learning algorithms, OCR, and stuff like that, but I do know how to read pixels. I also know how to compare values with python :P

They say the following about their Captcha:

One of my favorite past times is to look at the notebooks of famous scientists. Da Vinci's notebook is well known, but there plenty others. Worshipping Da Vinci like no other, I bought a Think/Create/Record journal, used it mostly to keep jot down random thoughts and take notes. This was great in the beginning, but the conformity of lines drove me nuts. Only moleskines made blank notebooks, so I had to buy one.

At the same time I started a freelance project. The project itself is irrelevant, but suffice to say it was very complex and spanned several months. It seemed like a perfect opportunity to use the moleskine. Looking back, all my entries fell under few categories:

Todo
Question
Thought
Bug
Feature

	"use strict";

	// Uses jQuery and Q.

	var API_KEY = "whatever";

	function getFlickrResponseAsync(method, responseProperty, params) {
	var deferred = Q.defer();

	$.ajax("http://www.flickr.com/services/rest/", {

	#!/bin/sh
	#
	#
	# From: [email protected] ([email protected])
	# Subject: bournebasic
	# Newsgroups: comp.sources.misc
	# Date: 1987-08-18 18:54:12 PST
	#
	# Here's a useful BASIC interpreter written in Bourne shell.
	# There's no manual but this demo shows the most salient features:

	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

	(use '[clojure.core.match :only [match]])

	(defn evaluate [env [sym x y]]
	(match [sym]
	['Number] x
	['Add] (+ (evaluate env x) (evaluate env y))
	['Multiply] (* (evaluate env x) (evaluate env y))
	['Variable] (env x)))

	(def environment {"a" 3, "b" 4, "c" 5})

	;; based on core.logic 0.8-alpha2 or core.logic master branch

	(ns sudoku
	(:refer-clojure :exclude [==])
	(:use clojure.core.logic))

	(defn get-square [rows x y]
	(for [x (range x (+ x 3))
	y (range y (+ y 3))]
	(get-in rows [x y])))

	;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Ant sim ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
	; Copyright (c) Rich Hickey. All rights reserved.
	; The use and distribution terms for this software are covered by the
	; Common Public License 1.0 (http://opensource.org/licenses/cpl.php)
	; which can be found in the file CPL.TXT at the root of this distribution.
	; By using this software in any fashion, you are agreeing to be bound by
	; the terms of this license.
	; You must not remove this notice, or any other, from this software.

	; Note: This code cannot run for very long on clojure 1.3 because

	#!perl

	# This calculator contains TWO DSL's.
	# The first one is for the calculator itself.
	# The calculator's grammar is written in OP2.
	# OP2 is the second DSL, and its code is the
	# second half of this file.

	use 5.010;
	use strict;