Recent Links for 09/21/2007

Friday, September 21, 2007

Newbie - converting csv files to arrays in NumPy
Great message thread on how to convert csv files to numpy arrays.
Cookbook/InputOutput - Numpy and Scipy
File processing examples using numpy, scipy, and matplotlib. How to read/write a numpy array from/to ascii/binary files.
Numpy Example List
Examples of Numpy functions such as fromfile(), hsplit(), recarray(), shuffle(), sort(), split(), sqrt(), std(), tofile(), unique(), var(), vsplit(), where(), zeros(), empty(), and many more.
Introducing Plists: An Erlang module for doing list operations in parallel
Could you spawn a trading system process for each stock of a given day's trading (a list)? What if you had 20,000 stocks for a given day? Can plists/erlang handle 20,000 processes without hitting memory constraints?

Labels: , , ,




 

Recent Links for 09/18/2007

Tuesday, September 18, 2007


Chapter 22. Struct and Array Modules
Overview of the python struct and array modules

Building Skills in Programming

Nice python tutorial.
Python Grimoire
Nice python cookbook.

Labels:




 

Recent Links for 09/17/2007

Monday, September 17, 2007

Labels: , , ,




 

Recent Links for 09/15/2007

Sunday, September 16, 2007

Links for 2007-09-15 [del.icio.us]

Posted: 16 Sep 2007 12:00 AM CDT

Labels: , , , ,




 

Recent Links 09/05/2007

Wednesday, September 05, 2007

Speed up R, Python, and MATLAB - Going Parallel

Labels: , ,




 

Recent Links 09/04/2007

Tuesday, September 04, 2007

World Beta - Engineering Targeted Returns and Risk: More On The Endowment Style Of Investing  Annotated

SourceForge.net: tkdiff

Google Mondrian: web-based code review and storage

Labels: ,




 

Recent Links 09/03/2007

Monday, September 03, 2007

ONLamp.com -- Numerical Python Basics

Programming in R

Finding Duplicate Elements in an Array :: Phil! Gregory  Annotated

Now, suppose that the array is of length n and only contains positive
integers less than n. We can be sure (by the pigeonhole principle)
that there is at least one duplicate.
    So, how do we find the beginning of the cycle? The easiest approach is to
    use Floyd's cycle-finding algorithm. It works roughly like this:
    Start at the beginning of the sequence. Keep track of two values (call
    them ai and aj). At
    each step of the algorithm, move ai one step
    along the sequence, but move aj two steps. Stop
    when ai = aj.

      Labels: ,




      This page is powered by Blogger. Isn't yours?