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

C[omp]ute

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.

Last 100 entries

NYT Has More Details; Obvious Question; Advertising Low Cost Routes?; Similar Analysis Here; My Current Take On Surveillance Scandal; Last.fm is Hiring; How I Am 2; The back-wards compatibility fallacy; Wiggle The Mouse To Pass The Test; Python Enums on Crack, Part II; Multiple Monitors with Linux; What Is Happening In Turkey; A Simpler Enum; John Fogerty on IAmA; And You May Well Ask...; Progress on a Better Enum; I'm a MACHIIIIIIIIIIIIIIINE; Those little tab things on the side of jet engines; Re: Python's sad, unimaginative Enum; Some explanation; Printing binary trees sideways; About "Python's sad, unimaginative Enum"; Atoms in python; Some good feedback here; Frustration Understood; I agree with you #nt; What would be imaginative?; Re: Enum; this is fucking useless; Enum; Python's sad, unimaginative Enum; Possible Fix; Work, Exhaustion, Vacation; VirtualBox with Centos 6.3 to 6.4, client; Matasano - Programming Lessons Learned; PDF to HTML; Alternate Substitution; Why RSA Works; Trigger; Dreaming of Death; Example: Tracing; Using Coroutines In Protocol Simulations; Python 3.3 Only; Pure Python SHA1 and MD4 Implementations; Ubuntu on VirtualBox; Starting TOR as a service on OpenSuse 12.3; 1001 Albums; Using fail2ban on OpenSuse 12.3; PPPoE on OpenSuse 12.3; Good Article on Unified Physics; It's Police (Carabineros); Linux Software for Listening to and Exploring Music; Android is Pretty Bad; Lucky Number; 3D Printing for Casting; Cover Art for MPDroid; Who'd a thought the French were so bigoted?; PS Input Signal; Small Problem with Roksan K2 Amp; Roksan K2 Amp + ATC SCM7 Speakers; Do What Makes Sense; Re: Arguing About Tests, Still; Arguing About Tests, Still; Images; Good Article on NY Drummers; Related Bug Report; Getting Python 3.3 and Virtualenv Working in OpenSuse 12.3; How I Am; Awesome video about digital audio; The Difference Between Dimensional and Normalized Databases; The rise of the new Chinese bogeyman; Updated Syntax; Very First Steps to C-ORM; The Ideal User Interface For Music Exploration; Can The Republicans Be Saved?; Rate Limiting Calls to EchoNest; Mods to Cache; Comparing UYKFG and UYKFD/E/F; Someone Else is Concerned; EchoNest-based Playlist Generator for MPD; Example Voting Results; A Heavyweight Python Cache; Identifying Artists with EchoNest; Notes on Pregalex / Pregabalina / Lyrica; The Neil Cowley Trio; Drake - Make for Data; A Reliable Python Web Service; Useful Python Date/Time Library?; Need to Sleep, But this is Good; Command Line Set Difference; Little Details...; Linux Command Line Tricks; AutoTools Tutorial; Hangman Tactics; A Tor Proxy Embedded In A Web Page; Tree (Nested Dicts) in Python; Sleeping at Parties; I Know Someone Who Hurts Other People; Light and Tea; Description of the LCS35 Time Capsule Crypto-Puzzle; Re: I can relate to that ...

© 2006-2013 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).

Andrew

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

Andrew

Comment on this post