Blog

  • The decision of #julialang to start arrays from 1 is dubious. As the main purpose I’m using it for is to do some discrete recursive math, a ton of things are states that are either 0 or non-zero integer.
    […]
    Update: Oh boy, did I miss some things. …

    Posted , Author

  • I cannot do but drool at the eleganceof this julialang code, once you get the hang of how to do things (i.e. thinking the other way round).

    Here’s a short snippet that produces Wolfram’s one-dimensional cellular automatons. Sheer elegance.

    Posted , Author

  • This isn’t the fastest mandelbrot set algorithm, but by far the coolest I’ve yet written. Creating a discrete 2d space containing complex floats and mapping the function on it. Unfortunately I did not find a builtin way to obtain that space from ranges. The complex numbers seem to create problems. But I’m only starting :)

    Posted , Author

  • Today, most users will probably use hardware-loadbalancers. However, the rising use of virtual server farms does make software-loadbalancing convenient.

    Some sites disallow the use of hardware-loadbalancers in serverfarm-installations (once traffic passes the outter rim of the installations, it may not leave it again within the same request). Thus, more sophisticated balancing will have to be done within the serverfarm …

    Posted , Author

← Older Newer →