| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next


Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

C-ORM: docs, API.

Last 100 entries

China Gamifies Real Life; Can't Help Thinking It's Thoughtcrime; Mefi Quotes; Spray Painting Bike Frame; Weeks 10 + 11; Change: No Longer Possible To Merge Metadata; Books on Old Age; Health Tree Maps; MRA - Men's Rights Activists; Writing Good C++14; Risk Assessment - Fukushima; The Future of Advertising and Surveillance; Travelling With Betaferon; I think I know what I dislike so much about Metafilter; Weeks 8 + 9; More; Pastamore - Bad Italian in Vitacura; History Books; Iraq + The (UK) Governing Elite; Answering Some Hard Questions; Pinochet: The Dictator's Shadow; An Outsider's Guide To Julia Packages; Nobody gives a shit; Lepton Decay Irregularity; An Easier Way; Julia's BinDeps (aka How To Install Cairo); Good Example Of Good Police Work (And Anonymity Being Hard); Best Santiago Burgers; Also; Michael Emmerich (Vibrator Translator) Interview (Japanese Books); Clarice Lispector (Brazillian Writer); Books On Evolution; Looks like Ara (Modular Phone) is dead; Index - Translations From Chile; More Emotion in Chilean Wines; Week 7; Aeon Magazine (Science-ish); QM, Deutsch, Constructor Theory; Interesting Talk Transcripts; Interesting Suggestion Of Election Fraud; "Hard" Books; Articles or Papers on depolarizing the US; Textbook for "QM as complex probabilities"; SFO Get Libor Trader (14 years); Why Are There Still So Many Jobs?; Navier Stokes Incomplete; More on Benford; FBI Claimed Vandalism; Architectural Tessellation; Also: Go, Blake's 7; Delusions of Gender (book); Crypto AG DID work with NSA / GCHQ; UNUMS (Universal Number Format); MOOCs (Massive Open Online Courses); Interesting Looking Game; Euler's Theorem for Polynomials; Weeks 3-6; Reddit Comment; Differential Cryptanalysis For Dummies; Japanese Graphic Design; Books To Be Re-Read; And Today I Learned Bugs Need Clear Examples; Factoring a 67 bit prime in your head; Islamic Geometric Art; Useful Julia Backtraces from Tasks; Nothing, however, is lost with less discomfort than that which, when lost, cannot be missed; Article on Didion; Cost of Living by City; British Slavery; Derrida on Metaphor; African SciFi; Traits in Julia; Alternative Japanese Lit; Pulic Key as Address (Snow); Why Information Grows; The Blindness Of The Chilean Elite; Some Victoriagate Links; This Is Why I Left StackOverflow; New TLS Implementation; Maths for Physicists; How I Am 8; 1000 Word Philosophy; Cyberpunk Reading List; Detailed Discussion of Message Dispatch in ParserCombinator Library for Julia; FizzBuzz in Julia w Dependent Types; kokko - Design Shop in Osaka; Summary of Greece, Currently; LLVM and GPUs; See Also; Schoolgirl Groyps (Maths); Japanese Lit; Another Example - Modular Arithmetic; Music from United; Python 2 and 3 compatible alternative.; Read Agatha Christie for the Plot; A Constructive Look at TempleOS; Music Thread w Many Recommendations; Fixed Version; A Useful Julia Macro To Define Equality And Hash; k3b cdrom access, OpenSuse 13.1; Week 2

© 2006-2015 Andrew Cooke (site) / post authors (content).

Efficient Entropy Estimates for Sequences of Large Values with OpenCL

From: andrew cooke <andrew@...>

Date: Sat, 8 Oct 2011 21:43:34 -0300

I need to estimate the entropy of sequences of large numbers in OpenCL.

The basic idea is to find how often each number occurs and then use the
Shannon (p ln(p)) formula.  But doing that naively in OpenCL is hard - the
numbers are too large to use a simple array (where we increment array[n] each
time we find value n).

(By "large number" I mean that they are represented as an arbitrary number of
32 bit ints).

The sequence length is much shorter than the maximum number and although the
numbers are large certain values are likely to repeat often.  So one approach
is to generate a lookup-table that associates each number with an index and
then historgam the indices.  But I cannot see how to do that efficiently or
easily in OpenCL.

The best idea I have had so far is to use modular arithmetic.  For example,
take the numbers modulo 2^8 and then increment a 255 entry array.  But modulo
2^n simply discards bits past n and the numbers are actually "bit patterns",
so I don't want to do that.  So it seems better to work modul some prime value
(or perhaps several).

Thanks to the magic of modular arithmetic it seems to be relatively easy to
convert large (multi-int32) numbers to their modulo:

   a0 + 2^32 (a1 + 2^32 (a2 + ...))
     = (a0 % n) + (2^32 % n) * ((a1 % n) + (2^32 % n) * ((a2 % n) + ...))

and if I use a prime less than 2^16 (I am thinking a value like 17 might be
enough!) then I can do the above in 32 bit ints without any problems.

I hope that makes sense.  Anyone have any better ideas?  I don't need entropy
exactly - all I want is a number that indicates "how statistically random"
some sequence is in a way that is reasonably smooth and sensitive (since it
will be used as a fitness measure in a GA).  And no, I don't really have any
clues about what a good statistical measure would be, but it would be nice if
it could reject a simple counter (which entropy cannot, so there is certainly
room for improvement).

(Background - the values are the binary state of a system that generates
"rhythms"; the system is deterministic it and tends "naturally" to generate
simple repeating patterns - the aim is to evolve away from that).


Radix Sorting

From: andrew cooke <andrew@...>

Date: Sat, 8 Oct 2011 22:22:44 -0300

I just remembered - radix sorting is probably the "right" way to do this.

See for example http://www.moderngpu.com/sort/algo.html


Comment on this post