Thank you very much for your replies. I will definitely take a look at
core.matrix. I really hate the fact that I had to use Java arrays to make
it fast. I'll take a look at transducers as well.
Kind regards,
Jose.
On Monday, December 22, 2014 7:09:27 PM UTC-5, Christopher Small wrote:
>
> I'
over several optimizations,
please contact me.
Kind regards,
Jose.
On Sunday, December 21, 2014 3:38:35 AM UTC-5, Jose M. Perez Sanchez wrote:
>
>
> Hi everyone:
>
> Sorry that it has taken so long. I've just released the software in
> GitHub under the EPL. It can be
Hi everyone:
Sorry that it has taken so long. I've just released the software in GitHub
under the EPL. It can be found at:
https://github.com/iosephus/gema
Kind regards,
Jose.
--
You received this message because you are subscribed to the Google
Groups "Clojure" group.
To post to this grou
Will take a look at the bigml/sampling library...
On Tuesday, June 3, 2014 7:52:06 PM UTC-4, Jose M. Perez Sanchez wrote:
>
>
> Thank you very much. I'm using the Colt random number generator directly.
> I've managed to reduce computing time by orders of magnitude using
Thank you very much. I'm using the Colt random number generator directly.
I've managed to reduce computing time by orders of magnitude using type
hints and java arrays in some critical parts. I haven't had the time to
write a report on this for the list, since have been busy with other
project
Yes, the step extract function encodes the total number of steps and any
intermediate steps whose values are to be saved.
I did the following changes to the code:
1 - Store results locally in the threads and return them when the thread
function exits, instead of using global vector. This does n
Hi Andy, cej38, kovas:
Thanks for the replies. I plan to release the whole code soon (waiting for
institutional authorization).
I do use lazyness both within the move function to select the allowed
random displacements and when iterating the move function to generate the
trajectory. Lazy struc
Hi Andy:
Yes, this breaks embarrassing parallelism indeed. When the calculations are
done for real this isn't a problem though, because these conj operations to
the global list would happen sporadically (in average once every couple of
seconds or so) so the probability of a thread waiting for
Hi Andy:
Thanks a lot for your reply. I'll do more careful testing in the very near
future and there is surely a lot to optimize in my code. I must say I did
expect computing speed reduction coming from an already optimized codebase
with the perfomance critical parts written in C, and there is
Hello everyone:
This is my first post here. I'm a researcher writing a numerical simulation
software in Clojure. Actually, I'm porting an app a coworker and I wrote in
C/Python (called GEMA) to Clojure: The app has been in use for a while at
our group, but became very difficult to maintain due
10 matches
Mail list logo
