Andrew Cooke | Contents | Latest | RSS | 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

Choochoo Training Diary

Last 100 entries

Surprise Paradox; [Books] Good Author List; [Computing] Efficient queries with grouping in Postgres; [Computing] Automatic Wake (Linux); [Computing] AWS CDK Aspects in Go; [Bike] Adidas Gravel Shoes; [Computing, Horror] Biological Chips; [Books] Weird Lit Recs; [Covid] Extended SIR Models; [Art] York-based Printmaker; [Physics] Quantum Transitions are not Instantaneous; [Computing] AI and Drum Machines; [Computing] Probabilities, Stopping Times, Martingales; bpftrace Intro Article; [Computing] Starlab Systems - Linux Laptops; [Computing] Extended Berkeley Packet Filter; [Green] Mainspring Linear Generator; Better Approach; Rummikub Solver; Chilean Poetry; Felicitations - Empowerment Grant; [Bike] Fixing Spyre Brakes (That Need Constant Adjustment); [Computing, Music] Raspberry Pi Media (Audio) Streamer; [Computing] Amazing Hack To Embed DSL In Python; [Bike] Ruta Del Condor (El Alfalfal); [Bike] Estimating Power On Climbs; [Computing] Applying Azure B2C Authentication To Function Apps; [Bike] Gearing On The Back Of An Envelope; [Computing] Okular and Postscript in OpenSuse; There's a fix!; [Computing] Fail2Ban on OpenSuse Leap 15.3 (NFTables); [Cycling, Computing] Power Calculation and Brakes; [Hardware, Computing] Amazing Pockit Computer; Bullying; How I Am - 3 Years Post Accident, 8+ Years With MS; [USA Politics] In America's Uncivil War Republicans Are The Aggressors; [Programming] Selenium and Python; Better Walking Data; [Bike] How Fast Before Walking More Efficient Than Cycling?; [COVID] Coronavirus And Cycling; [Programming] Docker on OpenSuse; Cadence v Speed; [Bike] Gearing For Real Cyclists; [Programming] React plotting - visx; [Programming] React Leaflet; AliExpress Independent Sellers; Applebaum - Twilight of Democracy; [Politics] Back + US Elections; [Programming,Exercise] Simple Timer Script; [News] 2019: The year revolt went global; [Politics] The world's most-surveilled cities; [Bike] Hope Freehub; [Restaurant] Mama Chau's (Chinese, Providencia); [Politics] Brexit Podcast; [Diary] Pneumonia; [Politics] Britain's Reichstag Fire moment; install cairo; [Programming] GCC Sanitizer Flags; [GPU, Programming] Per-Thread Program Counters; My Bike Accident - Looking Back One Year; [Python] Geographic heights are incredibly easy!; [Cooking] Cookie Recipe; Efficient, Simple, Directed Maximisation of Noisy Function; And for argparse; Bash Completion in Python; [Computing] Configuring Github Jekyll Locally; [Maths, Link] The Napkin Project; You can Masquerade in Firewalld; [Bike] Servicing Budget (Spring) Forks; [Crypto] CIA Internet Comms Failure; [Python] Cute Rate Limiting API; [Causality] Judea Pearl Lecture; [Security, Computing] Chinese Hardware Hack Of Supermicro Boards; SQLAlchemy Joined Table Inheritance and Delete Cascade; [Translation] The Club; [Computing] Super Potato Bruh; [Computing] Extending Jupyter; Further HRM Details; [Computing, Bike] Activities in ch2; [Books, Link] Modern Japanese Lit; What ended up there; [Link, Book] Logic Book; Update - Garmin Express / Connect; Garmin Forerunner 35 v 230; [Link, Politics, Internet] Government Trolls; [Link, Politics] Why identity politics benefits the right more than the left; SSH Forwarding; A Specification For Repeating Events; A Fight for the Soul of Science; [Science, Book, Link] Lost In Math; OpenSuse Leap 15 Network Fixes; Update; [Book] Galileo's Middle Finger; [Bike] Chinese Carbon Rims; [Bike] Servicing Shimano XT Front Hub HB-M8010; [Bike] Aliexpress Cycling Tops; [Computing] Change to ssh handling of multiple identities?; [Bike] Endura Hummvee Lite II; [Computing] Marble Based Logic; [Link, Politics] Sanity Check For Nuclear Launch; [Link, Science] Entropy and Life

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

Uniformly Random, Correlated Numbers in Matlab/Octave

From: andrew cooke <andrew@...>

Date: Sat, 23 Jul 2011 11:27:19 -0400

Someone just asked me how to implement the work at
http://acooke.org/random.pdf in Matlab.  Here's the code for Octave, which is
very similar:


n = 1000;  # the number of points
t = 0.1; # the 't' parameter from the paper

sq2 = sqrt(2);

# first, generate points in the u,v coordinates as in figure 4.
# u goes from 0 to sq2, v from -t*sq2 to t*sq2
uv = rand(n,2) * [sq2,0;0,2*t*sq2] - repmat([0,t*sq2],n,1);
# now rotate that by 45 degrees to xy
xy = uv * [1/sq2,1/sq2;-1/sq2,1/sq2];
# finally, "fold in" points outside the unit square
for i = 1:n
  #printf("%d x %f y %f\n", i, xy(i,1), xy(i,2));
  if (xy(i,1) < 0) xy(i,1) = -xy(i,1); endif
  if (xy(i,2) < 0) xy(i,2) = -xy(i,2); endif
  if (xy(i,1) > 1) xy(i,1) = 2-xy(i,1); endif
  if (xy(i,2) > 1) xy(i,2) = 2-xy(i,2); endif
endfor;

#xy
plot(xy(:,1),xy(:,2),'*')


If anyone with more experience than me know of a better way of folding the
points (ie without the explicit "for" loop), please let me know!

Andrew

Avoiding For Loops

From: Jonathan Dursi <ljdursi@...>

Date: Sat, 23 Jul 2011 12:26:57 -0400

I think this is pretty easily done with the vector-friendly min & max 
operations:

function xy = randminmax(n)
     t = 0.1; # the 't' parameter from the paper

     sq2 = sqrt(2);

     # first, generate points in the u,v coordinates as in figure 4.
     # u goes from 0 to sq2, v from -t*sq2 to t*sq2
     uv = rand(n,2) * [sq2,0;0,2*t*sq2] - repmat([0,t*sq2],n,1);
     # now rotate that by 45 degrees to xy
     xy = uv * [1/sq2,1/sq2;-1/sq2,1/sq2];

     # finally, "fold in" points outside the unit square
     xy = max(xy,-xy);
     xy = min(xy,2-xy);
endfunction


t1=now(); xy=randfor(100000); t2=now(); t2-t1
ans =  1.8261e-05
t1=now(); xy2=randminmax(100000); t2=now(); t2-t1
ans =  1.4284e-07

-- 
Jonathan Dursi | SciNet, Compute/Calcul Canada

Re: Avoiding For Loops

From: andrew cooke <andrew@...>

Date: Sat, 23 Jul 2011 13:50:57 -0400

Thanks!  I was looking for something like a map - never ocurred to me to look
for specific functions.  I'll forward that to the person who asked.

(And even when I read your suggestion, before I looked at the code, I couldn't
see how the upper bound would work.  I'm clearly not getting the matrix-based
approach at all... guess I better practice!)

Andrew

Comment on this post