The first, purely theoretical, article was written by Watson and Crick from the University of Cambridge. Immediately following this article were two data-rich papers by researchers from King’s College London: one by Maurice Wilkins and two colleagues, the other by Franklin and a PhD student, Ray Gosling. The model the Cambridge duo put forward did not simply describe the DNA molecule as a double h
Web のパフォーマンスの今 自分の持っている Web のパフォーマンスに関する知識を、一旦全部吐き出してまとめたいと思っていたので、それをやってみようと思う。 予定 この辺が頭にはある。 Metrics TCP TLS Rendering Prebrowsing Async/Defer Cache Priority HTTP2 QUIC とりえず、思いついた順に書いて後で整理する。 スタンス まずは知識のダンプを目的としたい。 デモとか実際の計測細かく作ると時間がかかるので、まず書くだけ書いて、やるとしても後でやる。 あといつも、自分で書き溜めて、見直して、書き直して、、、とやっていて気がつくと飽きて出さずに終わることが結構多いので、 今回はとにかく出して、追記や修正は後からがんがん更新していく感じにしたい。 更新履歴は Qiita で勝手に残るので、そこに任せる。 書いたものリスト こ
Faster builds with omake, part 3: Caches In this (last) part of the series we have a closer look at how OMake uses caches, and what could be improved in this field. Remember that we saw in total double speed for large OMake projects, and that we also could reduce the time for incremental builds. In particular for the latter, the effect of caching is important. This text is part 3/3 of a series abo
こんにちは。会員事業部ビジネス開発グループの高田です。 クックパッドは今年、株主優待制度として、プレミアムサービス一年間無料クーポンを贈呈しました。本エントリではクーポンコードを打ち間違えて、意図せず他の人のクーポンコードを使用するのを防ぐために工夫した話をご紹介します。 はじめに クーポンコードは入力のしやすさを優先して数字だけの文字列にしました。はじめは rand 関数を使って生成しようとしていたのですが、数字の打ち間違えや順序間違いで、意図せず誤使用してしまうのを防ぐためにチェックサムを加えるのがいい、と同僚から助言をもらいました。 いくつか調べて見たところ、Luhn アルゴリズムが上記を満たしていたので利用することにしました。 Luhn アルゴリズムの利用 Luhn アルゴリズムとは、誤り検出のためのチェックサム符号で、1 桁の間違いや隣接する数字の順序間違いを検出できるという特徴
A few weeks ago, we announced the first public beta of stack, a new build tool for Haskell. Since then we’ve seen a huge amount of work on stack: code contributions, feature requests, bug reports, and design discussions. In other words, the response we’ve had from the community has been amazing. Thank you for helping us push forward with improved Haskell tooling. Today we’re announcing a new miles
Kubernetesでの性能解析 ~なんとなく遅いからの脱却~(Kubernetes Meetup Tokyo #33 発表資料)NTT DATA Technology & Innovation
Dan Burton gave this talk at Bayhac 2015. In it he introduces Stack, a candidate replacement for Cabal. The tool provides an easy one line command to install Haskell packages. It also installs any missing tools onto the system (GHC, Cabal, and libraries like alex, happy and cpphs). By default it uses the curated Stackage long-term support databases to choose packages known to build and coexist tog
Clean Thesis is a clean, simple, and elegant LaTeX style for thesis documents. Download v0.4.0 See the Changelog. Looking for the latest development version? Clean Thesis is a LaTeX style for thesis documents, developed for my diplom thesis (Diplomarbeit). The style can be understood as my personal compromise — a typical clean looking scientific document combined and polished with minor beautifica
Feral Concurrency Control: An Empirical Investigation of Modern Application Integrity Peter Bailis, Alan Fekete†, Michael J. Franklin, Ali Ghodsi, Joseph M. Hellerstein, Ion Stoica UC Berkeley and †University of Sydney ABSTRACT The rise of data-intensive “Web 2.0” Internet services has led to a range of popular new programming frameworks that collectively embody the latest incarnation of the visio
In Rust, you quickly learn that vector and slice types are not iterable themselves. Depending on which tutorial or example you see first, you call .iter() or .into_iter(). If you do not realize both of these functions exist or that they do different things, you may find yourself fighting with the compiler to get your code to work. Let us take a journey through the world of iterators and figure out
Introduction:FuzzyFinder is a popular feature available in decent editors to open files. The idea is to start typing partial strings from the full path and the list of suggestions will be narrowed down to match the desired file. Examples: Vim (Ctrl-P) This is an extremely useful feature and it's quite easy to implement. Problem Statement:We have a collection of strings (filenames). We're trying to
Conversational modeling is an important task in natural language understanding and machine intelligence. Although previous approaches exist, they are often restricted to specific domains (e.g., booking an airline ticket) and require hand-crafted rules. In this paper, we present a simple approach for this task which uses the recently proposed sequence to sequence framework. Our model converses by p
Interactive code snippets not yet available for SoH 2.0, see our Status of of School of Haskell 2.0 blog post This article has been rewritten the 19/08/2015 Motivation (yours not mine)The distributed framework that I�m developing is a completely different way to consider distributed computing in the same sense that Transient is a different way to program in Haskell or in any other language. It is
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く