Notices by Brandon Hall (bthall@bikeshed.party), page 13

@bthall if i'm not mistaken, this already exists. for example, if you're in a julia shell, you can type

?≥

and you get this:
```
help?> ≥
"≥" can be typed by \ge<tab>
search: ≥

>=(x, y)
≥(x,y)

Greater-than-or-equals comparison operator. Falls back to y <= x.

Examples
≡≡≡≡≡≡≡≡≡≡

julia> 'a' >= 'b'
false

julia> 7 ≥ 7 ≥ 3
true

julia> "abc" ≥ "abc"
true

julia> 5 >= 3
true
```

For people here familiar with #textmining or #graphtheory, have you heard of methods that bring together the two approaches?

For analyzing my wiki's contents I could analyze the explicit linkages between articles with graph theory and the implicit linkages with text mining, but I wonder about how much better it'd be to analyze both graphs. I think that #LDA in textmining creates a graph representation anyway, so it may just require tools for integrating two related graphs.

A weekend in the middle of nothing it's what I need after moving to one of the busiest cities in Italy

It turns out that cats are even weirder than we thought

http://flip.it/5NdwJ6