Andrew Dona-Couch -- GitHub drop ICE couchand

These were selected from the 43,472 possible FIFA pairings by comparing their bigrams (sequences of pairs of letters) to the frequencies observed in Google Books N-grams dataset. The algorithm could probably be improved by weighting the middle pair greater (since that's the only degree of freedom), normalizing for letter frequency, increasing the analysis to trigrams or further, etc.

Code forthcoming.

This line chart is constructed from a TSV file storing the daily average temperatures of New York, San Francisco and Austin over the last year. The chart employs conventional margins and a number of D3 features:

d3.tsv - load and parse data
d3.time.format - parse dates
d3.time.scale - x-position encoding
d3.scale.linear - y-position encoding
d3.scale.category10, a d3.scale.ordinal - color encoding
d3.extent, d3.min and d3.max - compute domains
[d3.k

This gist demonstrates the inserting of link nodes to avoid node/link overlap.



This simple force-directed graph shows character co-occurence in *Les Misérables*. A physical simulation of charged particles and springs places related characters in closer proximity, while unrelated characters are farther apart. Layout algorithm inspired by [Tim Dwyer](http://www.csse.monash.edu.au/~tdwyer/) and [Thomas Jakobsen](http://web.archive.org/web/20080410171619/http://www.teknikus.dk/tj/gdc2001.htm). Data based on character coappearence in Victor Hugo's *Les Misérables*, compiled by [Donald Knuth](http://www-cs-faculty.stanford.edu/~uno/sgb.html).

	# Let's set up a quick and dirty test framework

	# a helper to define the tests
	expect = (expected, input) ->
	[expected, input]

	# an array equivalence test
	areSameArrays = (left, right) ->
	return no unless left.length is right.length
	for i of left

	<#@ template language="C#" #>
	<#@ assembly name="System.Core" #>
	<#@ import namespace="System.Linq" #>
	<#@ import namespace="System.Text" #>
	<#@ import namespace="System.Collections.Generic" #>
	<#

	var name = "Badge";
	var fields = new Dictionary<string, string>{
	{ "UserId", "string" },

	using System;
	using System.Collections.Generic;
	using System.Linq;
	using System.Text;
	using System.Threading.Tasks;
	using Jil;

	namespace JilDeserializeIssue
	{
	public enum SelectionAlgorithm : int

	# the little coffeescripter
	# http://weblog.bocoup.com/little-javascripter-revisited/

	Y = (le) ->
	((f) -> f f) (f) ->
	le (args...) ->
	f(f) args...

	factorial =
	Y (f) ->

	/** @jsx React.DOM */

	// d3 chart function
	// note that this is a higher-order function to
	// allowing passing in the component properties/state
	update = function(props) {
	updateCircle = function(me) {
	me
	.attr("r", function(d) { return d.r; })
	.attr("cx", function(d) { return 3 + d.r; })

	#!/bin/sh

	sed 's/\B\w*//g;s/\s//g' full_file.txt > acronym_file.txt