timwee

const std = @import("std");
const assert = std.debug.assert;

/// An intrusive heap implementation backed by a pairing heap[1] implementation.
///
/// Why? Intrusive data structures require the element type to hold the metadata
/// required for the structure, rather than an additional container structure.
/// There are numerous pros/cons that are documented well by Boost[2]. For Zig,
/// I think the primary benefits are making data structures allocation free
/// (rather, shifting allocation up to the consumer which can choose how they

timwee

timwee

"""A simple implementation of a greedy transition-based parser. Released under BSD license."""
from os import path
import os
import sys
from collections import defaultdict
import random
import time
import pickle

SHIFT = 0; RIGHT = 1; LEFT = 2;

timwee

オンライン広告関連の文献

概要

オンライン広告まわりの研究へのポインタをいくつか。 以下のものから辿っていけばある程度は見つかるはず。

学会・ワークショップ

オンライン広告に関する論文は、国際学会では、ウェブ系・データマイニング系のWWW, WSDM, KDDや、情報検索系のSIGIR, CIKMあたりに出てくる印象。 後は、機械学習系のICMLやNIPSでもたまに出る。

timwee

Write a program that does what it’s supposed to do
Write idiomatic code
Debug a program that you wrote
Debug a program someone else wrote
Debug the interaction between a system you wrote and one you didn’t
File a good bug report
Modify a program you didn’t write
Test a program you wrote
Test a program you didn’t write
Learn a new programming language

timwee

;; vector of arrays version
(import '(javax.swing JFrame JPanel) 
        '(java.awt Color Graphics2D))

(defn neighbours-count [[above current below] i w]
  (let [j (mod (inc i) w)
        k (mod (dec i) w)
        s #(if (= (aget #^objects %1 (int %2)) :on) 1 0)]
    (+ (+ (+ (s above j) (s above i))
         (+ (s above k) (s current j)))