neomatrix369

Everything I Ever Learned About JVM Performance Tuning @Twitter- by Attila Szegedi

http://www.infoq.com/presentations/JVM-Performance-Tuning-twitter (video & slides)

9 Fallacies of Java Performance - by Ben Evans

http://www.infoq.com/articles/9_Fallacies_Java_Performance (video & slides)

Visualizing Java GC - by Ben Evans

http://www.infoq.com/presentations/Visualizing-Java-GC (video & slides)

Java Garbage Collection Distilled by Martin Thompson

ttezel

#A Collection of NLP notes

##N-grams

###Calculating unigram probabilities:

P( w_i ) = count ( w_i ) ) / count ( total number of words )

In english..

crtr0

// set-up a connection between the client and the server
var socket = io.connect();

// let's assume that the client page, once rendered, knows what room it wants to join
var room = "abc123";

socket.on('connect', function() {
   // Connected, let's sign-up for to receive messages for this room
   socket.emit('room', room);
});

timcowlishaw

package uk.ac.ucl.cs.GI15.timNancyKawal {
  class Trie[V](key: Option[Char]) {

    def this() {
      this(None);
    }

    import scala.collection.Seq
    import scala.collection.immutable.TreeMap
    import scala.collection.immutable.WrappedString

gvx

from itertools import product

def score(self, other):
	first = len([speg for speg, opeg in zip(self, other) if speg == opeg])
	return first, sum([min(self.count(j), other.count(j)) for j in 'ABCDEF']) - first

possible = [''.join(p) for p in product('ABCDEF', repeat=4)]
results = [(right, wrong) for right in range(5) for wrong in range(5 - right) if not (right == 3 and wrong == 1)]

def solve(scorefun):