simulation

I'm having a bit of trouble figuring out how to reduce memory usage and GC time in a simulation running in the State monad. Presently I have to run the compiled code with +RTS -K100M to avoid stack space overflow, and the GC stats are pretty hideous (see below). Here are relevant snippets of the code. Complete, working (GHC 7.4.1) code can be found at http://hpaste.org/68527 . -- Lone algebraic data type holding the simulation configuration. data SimConfig = SimConfig { numDimensions :: !Int -- strict , numWalkers :: !Int -- strict , simArray :: IntMap [Double] -- strict spine , logP :: Seq

Yesterday I came across Craig Reynolds' Boids , and subsequently figured that I'd give implementing a simple 2D version in Java a go. I've put together a fairly basic setup based closely on Conrad Parker's notes . However, I'm getting some rather bizarre (in my opinion) behaviour. Currently, my boids move reasonably quickly into a rough grid or lattice, and proceed to twitch on the spot. By that I mean they move around a little and rotate very frequently. Currently, I have implemented: Alignment Cohesion Separation Velocity limiting Initially, my boids are randomly distributed across the

I wanted a very simple spring system written in numpy. The system would be defined as a simple network of knots , linked by links . I'm not interested in evaluating the system over time, but instead I want to go from an initial state, change a variable (usually move a knot to a new position) and solve the system until it reaches a stable state (last applied force is below a given threshold). The knots have no mass, there's no gravity, the forces are all derived from each link's current lengths/init lengths. And the only "special" variable is that each knot can bet set as "anchored" (doesn't

The problem is simple, There is some given 1D lines on a plane. We need to find the total size of space having at least one line. Let me discuss this with an example image- This may a case . Or This may be a case or anything like this. I know it is a basic problem of Sweep Line Algorithm . But there is no proper document in the internet for it to understand properly. The one best I have is a blog of Top Coder and that is here . But it is not clear how to implement it or how may be the simulation. If I want, we can do it in O(n^2) with 2 loops, but I can't realize how would be the procedure. Or

I am writing a physics engine/simulator which incorporates 3D space flight, planetary/stellar gravitation, ship thrust and relativistic effects. So far, it is going very well, however, one thing that I need help with is the math of the collision detection algorithm. The iterative simulation of movement that I am using is basically as follows: (Note: 3D Vectors are ALL CAPS.) For each obj obj.ACC = Sum(all acceleration influences) obj.POS = obj.POS + (obj.VEL * dT) + (obj.ACC * dT^2)/2 (*EQ.2*) obj.VEL = obj.VEL + (obj.ACC * dT) Next Where: obj.ACC is the acceleration vector of the object obj