# Paxinum

less info
reputation
313
bio website people.su.se/~peal0658 location Sweden age 27 member for 2 years, 5 months seen 20 hours ago profile views 95

Graduate student in mathematics. Languages: Java, C, C++, Mathematica, Php, HTML, CSS, LaTeX.

Interests in computer science: Fractals, genetic algorithms and AI programming.

 Jun16 comment Smooth Peter de Jong attractor @Kuba: The implementation I have is written in Java, and is open-sourced here: sourceforge.net/projects/flamethyst Some images created can be found here: people.su.se/~peal0658/index.php?page=fractals Jun16 comment Smooth Peter de Jong attractor Google "Flame fractals". I create this type of fractals a lot; 10⁵ is not nearly enough iterations. You would like about 2000 iterations PER PIXEL in the final image to get a decent result. Jun14 comment Extract memoized results in the form of a rule Ah, yes, of course! I feel silly now. Jun10 comment State “i” goes to state “j” I would guess it means states accessible from either 1 or 4. May8 comment Mathematica sporadically crashes on open Because, that makes sense... sometimes, one wonders... Mar28 comment Creating sculptural forms using graphics primitives Thanks! Absolutely not, I was just a bit lazy to add it myself :) Mar16 comment Finding lags of time series with Do Oh, L[t_]:=t-k; should most definitely work. But dont use capital letters as variable names, these might already be used by Mathematica, in any case, it is bad practice. Mar16 comment Finding lags of time series with Do Oh, you want ListPlot[L/@Range[5,100]] Mar16 comment Finding lags of time series with Do Hm, ok, well, I am not entirely sure what info you got, and what is unknown... Mar5 comment Generating Gelfand-Tsetlin patterns @belisarius cf = Flatten[stuff,1] can be optimized to cf = Join@@(stuff). Mar5 comment Generating Gelfand-Tsetlin patterns @IstvánZachar Are there any performance issues with Return? I read that it is a bit quirky, and is more "procedural" than "functional", so is it something to avoid in general? Mar5 comment Generating Gelfand-Tsetlin patterns @IstvánZachar Oh, ok, is there a particular reason why one wish to avoid return? I am probalby just used to Java, so it feels easier to read in this manner. Mar5 comment Generating Gelfand-Tsetlin patterns Wow, this is very efficient! How does the algorithm work? I took the liberty of adding an extra check in findPaths; looks like some corner cases mess up your code otherwise. Mar1 comment Dot shading a.k.a. Stippling effect Ah, cool! I had some feeling I might have seen it somewhere, so yes, it is perhaps best to close this. Thanks! Feb25 comment Generating Gelfand-Tsetlin patterns I have some other functionality that I have coded that does not exist in Sage. Besides, I am not sure, but I don't think Sage supports skew patterns, only "regular" ones. Feb21 comment Finding connected components in an array Oh, I am looking forward to that post! Feb20 comment Finding connected components in an array Looks interesting, I will try it out tomorrow :). Good performance there! Feb16 comment Finding connected components in an array But, the arrays i am interested in, as in the example, all rows are weakly decreasing, and also the same holds for the two diagonals (in some directions)... this might affect which algorithm performs better... Feb16 comment Finding connected components in an array I added onepts = #[[3]] & /@ weirdNeighbors[array]; tiles = First[#[[4 ;;]]] & /@ weirdNeighbors[array]; tiles = Join @@ tiles; onepts = List /@ (Join @@ onepts); Join[onepts, tiles]; Feb16 comment Finding connected components in an array Notice that I modified the accepted answer a bit. Can you please also account for turning your output into the specified form? I tied your code, and it is slower on my machine, (but then, I added code for changing the output.)