1,863 reputation
619
bio website
location Espoo, Finland
age 37
visits member for 1 year, 11 months
seen 7 hours ago


Sep
24
awarded  Autobiographer
Sep
23
comment solving nonlinear equation
The first bullet in this answer probably applies: mathematica.stackexchange.com/a/54935/3056
Sep
23
comment transparency in image used for texture?
Interestingly, the original code works just fine in my case under Mma 10.0.1.
Sep
23
comment Coloring problem in plot3D with transparent texture
Try PlotStyle -> Directive[Texture[Rasterize[mp1, Background -> None]]]. Texture doesn't understand MatrixPlot directly. Alternatively, you can use Raster directly from matrix with correct parameters inside Texture.
Sep
16
comment Dataset in Mathematica 10.0.1
@RunnyKine WRI advertises it in their public revision history ( wolfram.com/mathematica/quick-revision-history.html ), but I haven't seen a mail announcement, nor upgrade availability in the user portal. Then again, the revision history page update can't be too many hours old...
Sep
11
comment Hardware required to perform large symbolic calculations
@DanielLichtblau Haha! I missed that little "and" word. :) Surely amount of RAM matters, as long as it's smaller than the working set. When it's more than that, not so much.
Sep
11
comment Hardware required to perform large symbolic calculations
@DanielLichtblau But is "RAM speed" bandwidth, or latency? This is a hunch, but I'd assume typical symbolic workloads are more likely to be latency-limited (unless very specific performance primitives or large arrays are processed), while technical numerical computations are more likely to be bandwidth-limited. Although bandwidth of typical SDRAM solutions increases fast, decrease of latency is almost nonexistent. Both workloads benefit from more modern microarchitectures and larger caches, but it may well be that for specific workloads, increase in SDRAM bandwidth provides zero benefit.
Sep
7
comment How to make a cleaner copy out of a blurry text image before OCR?
It does have parameters which you can adjust, though.
Sep
7
comment How to make a cleaner copy out of a blurry text image before OCR?
If you are using v10, it LocalAdaptiveBinarize may also be worth a check.
Sep
7
revised Binary decision diagrams (BDD)
added 128 characters in body
Sep
7
comment Binary decision diagrams (BDD)
@SjoerdC.deVries Ah, you are correct. BooleanConvert builds trees, not graphs. Building an optimal one like in Wikipedia is beyond reach of this code (whose point is mostly to create graphs where obvious exits are handled first).
Sep
7
answered Binary decision diagrams (BDD)
Sep
7
comment Binary decision diagrams (BDD)
Please look at BooleanConvert with "BDT" (Boolean decision tree) and "IF" (If and constants) forms.
Sep
3
comment Is there a relatively quick way to solve my integer-valued equation?
@Dr.WolfgangHintze Actually I was surprised that IntegerPartitions had all the necessary ingredients to support this solution, and that it can perform specified partitioning at some meaningful (time and space) efficiency. Increasing amax, yes, that wouldn't bode well for partitioning an integer around 7*10^40. :)
Sep
2
answered Is there a relatively quick way to solve my integer-valued equation?
Sep
2
comment Use Mathematica to calculate the area enclosed between two curves
Regarding all solutions using NSolve, numeric intermediate solutions and getting numeric area: Solve works fine, and produces a Root object. All values in this problem can be maintained in abstract, precise form - either Root, or converted to radicals using ToRadicals. And of course, FullSimplify often cleans up overly complicated radicals.
Aug
27
revised Efficient processing of Special Ordered Sets with LinearProgramming
deleted 9 characters in body
Aug
27
revised Efficient processing of Special Ordered Sets with LinearProgramming
Fix to resemble a real SOS example...
Aug
27
revised Efficient processing of Special Ordered Sets with LinearProgramming
added 3 characters in body
Aug
27
asked Efficient processing of Special Ordered Sets with LinearProgramming