| 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.

C-ORM: docs, API.

Last 100 entries

Discover new movies on demand in our online cinema; Tasting; Credit Card Processing for Cat Soft LLC; Apple + Kiwi Jam; Hit Me; Increase Efficiency with GPS Vehicle Tracking for Cat Soft LLC; Sudoku - CSP + Chaos; Recycling Electronics In Santiago; Vector Displays in OpenGL; Call Center Services for Cat Soft LLC; And Anti-Aliased; OpenGL - Render via Intermediate Texture; And Garmin Connect; Using Garmin Forerunner 230 With Linux; Payroll Service Quotes for Cat Soft LLC; (Beating Dead Horse) StackOverflow; Current State of Justice in China; Now Is Cat Soft LLC's Chance To Save Up To 32% On Mail; Axiom of Determinacy; Ewww; Fee Chaos Book; Course on Differential Geometry; Increase Efficiency with GPS Vehicle Tracking for Cat Soft LLC; Okay, but...; Sparse Matrices, Deep Learning; Sounds Bad; Applebaum Rape; Tomato Chutney v4; Have to add...; Culturally Liberal and Nothing More; Weird Finite / Infinite Result; Your diamond is a beaten up mess; Maths Books; Good Bike Route from Providencia / Las Condes to Panul\; Iain Pears (Author of Complex Plots); Plum Jam; Excellent; More Recently; For a moment I forgot StackOverflow sucked; A Few Weeks On...; Chilean Book Recommendations; How To Write Shared Libraries; Jenny Erpenbeck (Author); Dijkstra, Coins, Tables; Python libraries error on OpenSuse; Deserving Trump; And Smugness; McCloskey Economics Trilogy; cmocka - Mocks for C; Concept Creep (Americans); Futhark - OpenCL Language; Moved / Gone; Fan and USB issues; Burgers in Santiago; The Origin of Icosahedral Symmetry in Viruses; autoenum on PyPI; Jars Explains; Tomato Chutney v3; REST; US Elections and Gender: 24 Point Swing; PPPoE on OpenSuse Leap 42.1; SuperMicro X10SDV-TLN4F/F with Opensuse Leap 42.1; Big Data AI Could Be Very Bad Indeed....; Cornering; Postcapitalism (Paul Mason); Black Science Fiction; Git is not a CDN; Mining of Massive Data Sets; Rachel Kaadzi Ghansah; How great republics meet their end; Raspberry, Strawberry and Banana Jam; Interesting Dead Areas of Math; Later Taste; For Sale; Death By Bean; It's Good!; Tomato Chutney v2; Time ATAC MX 2 Pedals - First Impressions; Online Chilean Crafts; Intellectual Variety; Taste + Texture; Time Invariance and Gauge Symmetry; Jodorowsky; Tomato Chutney; Analysis of Support for Trump; Indian SF; TP-Link TL-WR841N DNS TCP Bug; TP-Link TL-WR841N as Wireless Bridge; Sending Email On Time; Maybe run a command; Sterile Neutrinos; Strawberry and Banana Jam; The Best Of All Possible Worlds; Kenzaburo Oe: The Changeling; Peach Jam; Taste Test; Strawberry and Raspberry Jam; flac to mp3 on OpenSuse 42.1; Also, Sebald; Kenzaburo Oe Interview; Otake (Kitani Minoru) move Black 121

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

Uniform Fences Don't Give Uniform Data

From: andrew cooke <andrew@...>

Date: Thu, 29 Mar 2012 10:10:39 -0300

from random import random
from itertools import chain
from collections import Counter

def split(k):
    fences = list(sorted(chain([0], [random() for i in range(k-1)], [1])))
    return [j - i for i,j in zip(fences, fences[1:])]

def bin(n, data):
    return Counter(int(x * n) for x in chain(*data))

def plot(bins, n, w):
    m = max(bins.values())
    for b in sorted(bins):
        print '%4.2f %s' % (b / float(n), '*' * int(bins[b] * w / m))

k = 4
n = 50
print split(k)
b = bin(n, (split(k) for i in range(n*1000/k)))
print b
plot(b, n, 70)


0.00 **********************************************************************
0.02 ******************************************************************
0.04 ******************************************************************
0.06 ***********************************************************
0.08 ************************************************************
0.10 ********************************************************
0.12 ****************************************************
0.14 *************************************************
0.16 ************************************************
0.18 *********************************************
0.20 ********************************************
0.22 *******************************************
0.24 **************************************
0.26 **************************************
0.28 **********************************
0.30 *********************************
0.32 ******************************
0.34 *****************************
0.36 ***************************
0.38 ***************************
0.40 *************************
0.42 *********************
0.44 *********************
0.46 *******************
0.48 *****************
0.50 *****************
0.52 ***************
0.54 **************
0.56 *************
0.58 ***********
0.60 **********
0.62 *********
0.64 ********
0.66 ********
0.68 *******
0.70 ******
0.72 *****
0.74 ****
0.76 ***
0.78 ***
0.80 **
0.82 **
0.84 *
0.86 
0.88 
0.90 
0.92 
0.94 
0.96 

Andrew

N-1 Dimensional Planes

From: andrew cooke <andrew@...>

Date: Thu, 29 Mar 2012 11:32:13 -0300

Hmmm.  So the post above came from misunderstanding what someone meant by
"uniform".

"Choose N numbers, X[i], that sum to S (sum(X) = S), that are uniformly
distributed" - which doesn't mean that each is indiviudally uniform, but that
the X[i], when repeatedly selected, uniformly fill an N-1 dimensional plane.

(It's not clear to me that fences do that either, but the plot above doesn't
disprove it)

Andrew

Comment on this post