Great news! New Science Site launched: Free Science Videos and Lectures Another great news! My Programming Site launched: Good coders code, great reuse More great news! I started my own company: Browserling - Cross-browser testing. Here is a list of video lectures in computer science I had collected over the years. This list is only two-thirds of all links I have in my bookmarks, I will go through

(algorithm) Definition: Compare, and swap if necessary, pairs of elements in parallel. Subsets are sorted then merged. Also known as Batcher sort. Generalization (I am a kind of ...) oblivious algorithm. Note: This takes O((log n)2/2) stages (or steps) with n/2 comparators at each stage. This sorts increasingly larger intermingled subsets, somewhat like Shell sort, and merges subsets, like merge s

List of Examples 1. Esoteric languages 2. Various syntax for iteration 3. An example of tokens 4. Simple grammar 5. Simple arithmetic expression 6. Parse tree of A*(B+C) 7. An example of ambiguous grammar 8. Dangling else 9. Fortran has no reserved word 10. Namespace in C++ 11. Importing a module in Python 12. TinyBASIC 13. Variable declaration in Java 14. Anonymous function in JavaScript 15. Anon

How to Design Programs The First Edition is still available!

23:48 04/04/07 これ考えたヤツは天才だと思う。 六法 譲ってもらった。まだ本棚を買っていないので、 入手量に気をつけないとすぐに部屋に書物の山が形成されてしまいそう…。 そういえばSBには、３年前に暗号化関係の本を貸すと宣言して それっきりになっていたような気がするっていうか忘れてたすみません。 大名廃絶録 20:47 04/04/06 Windowsに付属してくるスパイダソリティアというゲームがありまして。 暇つぶしに遊び始めてしまって、気がついたらあっという間に一時間も過ぎていた、 なんて経験をされた人も少なくないと思います。 さてそんなスパイダソリティアの「初級」、 100発100中で解けてつまならいとお考えの方に新しい遊び方を提案いたしましょう。 まずはゲームスタート。 オーケイ、スタートだ。そして そしてまず全部配る。さあ解いてみよう！ 難易度 上級と同程度以上には

The real explanation for all the dead IPC facilities in old AT&T Unixes was politics. The Unix Support Group was headed by a low-level manager, while some projects that used Unix were headed by vice presidents. They had ways to make irresistible requests, and would not brook the objection that most IPC mechanisms are interchangeable. The System V IPC facilities are message-passing facilities based

For the Linux distribution codenamed Heisenbug, see Fedora Linux. In computer programming jargon, a heisenbug is a software bug that seems to disappear or alter its behavior when one attempts to study it.[1] The term is a pun on the name of Werner Heisenberg, the physicist who first asserted the observer effect of quantum mechanics, which states that the act of observing a system inevitably alters

The Problem of in-situ sorting with minimal auxiliary space in minimal time. Introduction In "Mathematical Analysis of Algorithms", (Information Processing '71, North Holland Publ.'72) Donald Knuth remarked "... that research on computional complexity is an interesting way to sharpen our tools for more routine problems we face from day to day." With respect to the sorting problem, Knuth points out

"Give him some of the biscuit which famous Rhodes has sent you." —Marcus Valerius Martialis 1   Motivation I was looking for a small and unstrict xml parser. Boost.Spirit and Boost.Xpressive showed a lot of functionality but made big executables. On the other hand, YARD written by Christopher Diggins was simple, small and fast. In time, I found that YARD and Boost.Range could be binded. It was nam

このドメインは お名前.com から取得されました。 お名前.com は GMOインターネットグループ(株) が運営する国内シェアNo.1のドメイン登録サービスです。 ※表示価格は、全て税込です。 ※サービス品質維持のため、一時的に対象となる料金へ一定割合の「サービス維持調整費」を加算させていただきます。 ※1 「国内シェア」は、ICANN(インターネットのドメイン名などの資源を管理する非営利団体)の公表数値をもとに集計。gTLDが集計の対象。 日本のドメイン登録業者(レジストラ)（「ICANNがレジストラとして認定した企業」一覧（InterNIC提供）内に「Japan」の記載があるもの）を対象。 レジストラ「GMO Internet Group, Inc. d/b/a Onamae.com」のシェア値を集計。 2023年10月時点の調査。

The first installment of this series was an overview of memory barriers, why they are needed in SMP kernels and how the Linux kernel handles them [August 2005]. This installment gives an overview of how several of the more popular CPUs—Alpha, AMD64, IA64, PA-RISC, POWER, SPARC, x86 and zSeries, otherwise known as IBM mainframe—implement memory barriers. Table 1 is reproduced here from the first in

Since the 2.0 kernel release, Linux has supported a large number of SMP systems based on a variety of CPUs. Linux has done an excellent job of abstracting differences among these CPUs, even in kernel code. This article is an overview of one important difference: how CPUs allow memory accesses to be reordered in SMP systems. Memory accesses are among the slowest of a CPU's operations, due to the fa