この記事は abicky.net の 日本語形態素解析の初歩 に移行しました
The ClojureWest conference has finished, and Aaron Bedra gave an important presentation titled clojure.web/with-security (video). If you develop web applications in Clojure, you must watch this video. Go watch it now. This post is a mixture of notes from Aaron's talk and some of my own thoughts. Aside: Apologies for the linkbaity title. Alternatives were either too long or hyperbolic. Hopefully th
Why this Haskell program runs considerably slower than its JavaScript equivalent? (Frustrated) OK, I've been considering moving to Haskell from JavaScript as my main language due to it being a much nicer overall. But I must admit I've been frustrated with its performance. I was not expecting Haste/Fay to be as fast as JavaScript, but to my surprise Haskell's binary itself was considerably slower t
name: inverse layout: true class: center, middle, inverse --- #NEW ##DIRECTIONS IN STRING INTERPOLATION --- #TASK --- layout: false # TASK Given the following bindings: ```haskell name :: String name = "Marvin" age :: Int age = 23 profession :: String profession = "λ-scientist" ``` Produce the following output: ``` Marvin is a 23-year-old λ-scientist! ``` --- template: inverse ## Should be easy, r
@marugorithmさんの文法圧縮の解説資料(http://research.preferred.jp/2014/03/nlp2014_grammar/)があまりにも有益すぎて感動したので、文法圧縮を使った完備辞書(簡潔ビットベクトル)を作った。 文法圧縮の部分は実装の簡単さからRe-Pairアルゴリズムを使った。 https://github.com/echizentm/GCFID 作ってみて感じたメリット・デメリットをメモしておく。 簡単に言うと、rank、selectがO(1)でないという欠点があるものの理解のしやすさ、実装のしやすさを考えると利点が大きいように感じた。 文法圧縮を用いて完備辞書を作るメリット ビット列が変換規則(X1 => X2, X3みたいなの)の集合で表現できるのでpopcountとかのややこしいビット演算が不要 ビット演算が不要なのでperl,python
If you’ve interacted with databases when programming, chances are you’ve heard about the “N+1 Selects Problem”, discussed in detail at Use the Index, Luke!. Roughly speaking, this problem is characterised by performing SELECT statements repeatedly inside a loop. For example, do userIds <- getAllUsers users <- for userIds $ \userId -> do getUserById userId doSomething users With the above approach,
When tuning Java Garbage Collector you have to be very careful, as you may result to a worst performance instead of a better one. The GC parameter “-XX:MaxTenuringThreshold” defines how many minor GC cycles an object can stay in the survivor spaces until it finally gets tenured to the old space. Until java version 1.5.0_05 the maximum value for this parameter was 31. But in all the newest versions
Computer History Museum Makes Historic MS-DOS and Word for Windows Source Code Available to the Public The Computer History Museum (CHM) announced today that it has, with permission from Microsoft Corporation, made available original source code for two historic programs: MS-DOS, the 1982 "Disk Operating System" for IBM-compatible personal computers, and Word for Windows, the 1990 Windows-based ve
Immutable Infrastructure Conference #1 : ATND 2014/03/25 Immutable Infrastructure Conference #1 #immutableinfra - Togetterまとめ 最近は最早バズワード化した感も充分ある『Immutable Infrastructure』。この長〜いフレーズを発音する際に途中発音を噛む人が後を絶たない今日この頃、皆様いかがお過ごしでしょうか。(発音に悩んでいる、何とか噛まないようにしたい!という方は以下のエントリを参考にしてみる事をお勧めします) [小ネタ]噛まずにImmutable Infrastructureと言うために | Developers.IO さて、本題です。こちらの『Immutable Infrastructure Conference #1』、発表と同時に参加応募者が殺
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く