'via Blog this'
MindCipher - 12 Identical BallsMindCipher - 12 Identical Balls: "You have 12 identical balls. One of them is slightly different in weight than the rest. You have three weighs of a balance scale to determine which ball is different and whether it is heavier or lighter.
bpostlethwaite/colormap · GitHubbpostlethwaite/colormap · GitHub: "Super simple just do,
colormap/example at master · bpostlethwaite/colormap · GitHubcolormap/example at master · bpostlethwaite/colormap · GitHub:
Caring for Your Introvert - Jonathan Rauch - The AtlanticCaring for Your Introvert - Jonathan Rauch - The Atlantic: " Our motto: "I'm okay, you're okay—in small doses.""
Caring for Your Introvert - Jonathan Rauch - The AtlanticCaring for Your Introvert - Jonathan Rauch - The Atlantic: "If you answered yes to these questions, chances are that you have an introvert on your hands—and that you aren't caring for him properly. Science has learned a good deal in recent years about the habits and requirements of introverts. It has even learned, by means of brain scans, that introverts process information differently from other people (I am not making this up). If you are behind the curve on this important matter, be reassured that you are not alone. Introverts may be common, but they are also among the most misunderstood and aggrieved groups in America, possibly the world."
Berlekamp–Massey algorithm - Wikipedia, the free encyclopediaBerlekamp–Massey algorithm - Wikipedia, the free encyclopedia: "The Berlekamp–Massey algorithm is an algorithm that will find the shortest linear feedback shift register (LFSR) for a given binary output sequence. The algorithm will also find the minimal polynomial of a linearly recurrent sequence in an arbitrary field."
Low-density parity-check code - Wikipedia, the free encyclopediaLow-density parity-check code - Wikipedia, the free encyclopedia: "In information theory, a low-density parity-check (LDPC) code is a linear error correcting code, a method of transmitting a message over a noisy transmission channel, and is constructed using a sparse bipartite graph. LDPC codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close (or even arbitrarily close on the BEC) to the theoretical maximum (the Shannon limit) for a symmetric memory-less channel. The noise threshold defines an upper bound for the channel noise, up to which the probability of lost information can be made as small as desired. Using iterative belief propagation techniques, LDPC codes can be decoded in time linear to their block length."
Reed–Solomon error correction - Wikipedia, the free encyclopediaReed–Solomon error correction - Wikipedia, the free encyclopedia: "In coding theory, Reed–Solomon (RS) codes are non-binary cyclic error-correcting codes invented by Irving S. Reed and Gustave Solomon. They described a systematic way of building codes that could detect and correct multiple random symbol errors. By adding t check symbols to the data, an RS code can detect any combination of up to t erroneous symbols, or correct up to ⌊t/2⌋ symbols. As an erasure code, it can correct up to t known erasures, or it can detect and correct combinations of errors and erasures. Furthermore, RS codes are suitable as multiple-burst bit-error correcting codes, since a sequence of b + 1 consecutive bit errors can affect at most two symbols of size b. The choice of t is up to the designer of the code, and may be selected within wide limits."
New HTML Parser: The long-awaited libxml2 based HTML parser code is live. It needs further work but already handles most markup better than the original parser.
Keep up with the latest Advogato features by reading the Advogato status blog.
If you're a C programmer with some spare time, take a look at the mod_virgule project page and help us with one of the tasks on the ToDo list!