dominictarr

April

08: Melbourne

17: Melbourne -> Frankfurt

head towards Budapest.

23: speaking at budapest node.js

24,25: speaking at craftconf.

dominictarr

Keybase proof

I hereby claim:

• I am dominictarr on github.
• I am dominic (https://keybase.io/dominic) on keybase.
• I have a public key whose fingerprint is 652D 910D EC2B B18C 1E7B 2A00 296B 4A96 FC30 81C4

To claim this, I am signing this object:

dominictarr

/*
Each table is put into it's own sublevel.
It's assumed that every table's primary key is ID.
and a foreign key is always {table}ID
If there isn't A table with that name, assume it's a self link.
(like ManagerID points back to the Employee table)
*/

//Automagically join two tables that have conventionally named fields.
// magic (nameOfLeftTable, nameOfRightTable)

dominictarr

//top level is types, key:values are the structure that object must have,
//and the types of the values.

//Link means the hash of an object of the named type.
//Plus and Star define sets. And are just like regular expression + and *
//you could also have ? (Maybe) but it's not necessary to describe git. 
{
  COMMIT: {

    //a cypherlink to a commit object

dominictarr

Bangkok, Thailand - "One Night in Bangkok", murry head. https://www.youtube.com/watch?v=P9mwELXPGbA

Cambodia - "Holiday in Cambodia", dead kennedys https://www.youtube.com/results?search_query=holiday+in+cambodia

Granada, Spain - "Granada", Frank Sinatra https://www.youtube.com/watch?v=A5X0DBWJOR8

Morocco - "Rock the Casbah", The Clash

dominictarr

The Chi Squared test is used when you want to decide if a dice is fair (random) or not, or for problems that fit that pattern. Sometimes we want to know that some event is equally likely, a the probability that a dice comes up 6 should be equal to the probability that it comes up 1. Some times we want to show the opposite, that two categories are actually different. Say, there are a series of races - is the winner of the most races actually better, or was it just a fluke?

Of course, we can roll a dice many, many times until we are sure it's fair, but it takes too long to have many races. So for the race need to calculate whether the random variables (the times that each participant won) are independent (random, fair) while only looking at a few examples. Depending on the number of participants, how many times do we need to race before we know that the winner is actually faster?

dominictarr

patterns in "social networks"

static sites

content is edited by a single/few author and accessed by urls. each site links to other sites they like, in a 'cool links' section. or via a web ring.

examples: geocities, tripod, just hosting a site yourself, etc

dominictarr

So you want to help with secure-scuttlebutt?

secure-scuttlebutt is a do-ocracy. that means ruled by doers. If you want to help, you need to figure out what you need to do and then do it. There are no managers. The best way to do this is probably to discuss with other contributors. for this use issues and irc (find us in #stackvm on irc)

Make a pull request, and once there is a consensus amongst the contributors a maintainer can merge. (A maintainer is just a role - they just merge patches and apply semver and then release. a maintainer does not have special powers, just special responsibilities. They do not cast a breaking vote,

dominictarr

TAP version 13
# compiling coffee with -c
not ok 1 should be equal
  ---
    file:   /home/dominic/c/browserify/test/coffee_bin.js
    line:   23
    column: 11
    stack:  
      - |
        getCaller (/home/dominic/c/browserify/node_modules/tap/lib/tap-assert.js:418:17)

dominictarr

ubuntu@ip-172-30-0-124|14:28|~ $ service megafunnel-view start
start: Rejected send message, 1 matched rules; type="method_call", sender=":1.12" (uid=1000 pid=5133 comm="start megafunnel-view ") interface="com.ubuntu.Upstart0_6.Job" member="Start" error name="(unset)" requested_reply="0" destination="com.ubuntu.Upstart" (uid=0 pid=1 comm="/sbin/init ")