Wolfram Mathematica

7:21 AM

@bill s Excuse me.Have you ever digged WarpingCorrespondence after your this question

Q: How to understand this series function with Option?

7:37 AM

Well,I post a question for it just.

For completing this answer,I'm digging function WarpingCorrespondence with GeneralUtilities`PrintDefinitions.I found a piece code like SameQ[ optionValues = System`Utilities`GetOptionValues[TimeWarpingMethod, Part[Options @ TimeWarpingMethod, All, 1], ...

undocumented

xzczd

8:07 AM

@MichaelE2 Yes?: mathematica.stackexchange.com/questions/40927/…

3 hours later…

10:59 AM

Could I read the .mx file?

such as C:\Program Files\Wolfram Research\Mathematica\11.1en\SystemFiles\Kernel\SystemResources\Windows\ImageProc‌essing\FilteringDiffusion.mx

Kuba

@yode you can Get it but it does not take a standard evaluation path, it is a binary representation of definitions which are directly added to the kernel, whatever that means. So you can't e.g. Block the SetDelayed to trace it.

@Kuba Is there any method can import it as a text?

If I open it with notepad.exe,it is like this

Since the Mathematica can read binary file.

Kuba

11:23 AM

@yode I don't know.

11:42 AM

Does anybody see a problem with
memInUse = MemoryInUse[];
maxMemoryUsed = MaxMemoryUsed[f];
memoryConsumption = maxMemoryUsed - memInUse
for measuring the memory consumption of function f?

I'm having trouble finding an MWE, but what I have observed is that maxMemoryUsed - memInUse is sometimes negative. I don't understand how it is possible, it makes me doubt this entire way of measuring memory consumption.

11:57 AM

MaxMemoryUsed will "not typically account for stack space", and MemoryInUse counts only stack space? So they are complementary, is that it? Does all memory consumed by variables etc. count as stack space?

A: How to find out the (current) free memory on the system?

12:17 PM

Maybe this can help a little

Well,for the efficiency I will give a new version: Last[ReadList["!wmic OS get FreePhysicalMemory"]] PS:I just test it in my windows 10.You can check it in your environment.

@yode I want to know how much memory is being consumed while executing a function. For example, if I run LinearSolve then it may consume a lot of memory while it is running. But if I measure the memory consumption before I run it or after I have run it, that won't show up. That's why I need MaxMemoryUsed.

12:36 PM

If MaxMemoryUsed does not account for stack space does that mean that it doesn't measure memory consumption even by variables which are local to the function? It's hard to understand what MaxMemoryUsed does if it doesn't measure stack space. (For me at least, I'm not an expert in memory issues.)

@C.E. Try this Internal`FullMemoryInUse[]

@yode I don't know what it does, but doesn't it sound like a version of MemoryInUse? Which measures something differently than MaxMemoryUsed. Again, I need to be able to apply it to a function so that it will tell me how much memory the function is consuming. If the FullMemoryInUse doesn't take a function as an argument, then it's probably not useful.

It can accept a argument as my test

It's seem we can use Internal`FullMemoryInUse[expr] - Internal`FullMemoryInUse[]

1:01 PM

@yode You may be on to something. I need to try it out more to convince myself of what it is doing, but it's definitely interesting.

1:27 PM

@C.E. And actually I think MaxMemoryUsed[expr] is your after, we don't need subtract that MemoryInUse as the documentation of MaxMemoryUsed

@yode yes, I'm starting to agree with that.

although I'm afraid that it doesn't count variables that I've stored, so that more memory is being consumed than MaxMemoryUsed registers.

halirutan

@VitaliyKaurov Do you see that the markdown engine on the WC is buggy? Underlining a header does not work. Look here and see how it is rendered on the site

In the preview when I edit my post, however, it is indeed rendered as a headline. Very mysterious.

I changed it now into # header style which seems to work.

Jacob Akkerboom

1:56 PM

@C.E. See also the last section "Considerations about MaxMemoryUsed" in my answer here, which shows that MaxMemoryUsed does not track LibraryLink functions fully. The memory that is missed there by MaxMemoryUsed is heap allocated (by malloc). I guess LibraryLink functions may be an edge case you are not very interested in, but maybe this may help you understand what MaxMemoryUsed tracks.

@JacobAkkerboom ok, thanks.

Q: How to get a pair with smallest total distance from one list in high-efficiency method

2:47 PM

Do anybody can help to check SparseArray`AllPairsShortestPath can solve my this qeustion or not?

This is similar to this post, but actually more complicated. I have two lists in that question, and I want to get a pair. But in here, I want to get a pair from one list (even points). Given these 20 points: SeedRandom[1] pts = RandomInteger[20, {20, 2}] {{5,0},{7,0},{2,3},{0,0},{16,14},{3,...

performance-tuning graphs-and-networks

As the funciton name, I think it is what I want,but I'm confusion its result..

Question on binning data: If I have a paired list, e.g. {{1,y1},{2,y2},{5,y3},{7,y4}}, and I want to bin the list according to criteria in the "x" component of each list, e.g. for values <=2 I get a list {y1,y2}... and so forth.
Basically I have a list population vs data, and I want to bin according to population. But i don't want to count the data points (because i want to create a box whiskers plot).
I was thinking of using TakeWhile[], but is there a more efficient way?

Michael Hale

3:03 PM

@e3labs Like this? GroupBy[{{1, y1}, {2, y2}, {5, y3}, {7, y4}}, First@# <= 2 & -> Last]

RandomReal[10, 1000] // Map[{#, #^2 + RandomReal@#} &] //
   GroupBy[Round@*First -> Last] // KeySort // BoxWhiskerChart

@MichaelHale I want to specify the bin values myself, i.e. {<=2, 2>value<=5...etc}
This gives me a good start. Let me try a few things to get there... THANKS

Michael Hale

For varying size bins you can use something like GroupBy[SelectFirst[{1, 3, 8, 9, 15},
Function[bin, First@# < bin]] & -> Last] in the middle

@MichaelHale Yess, something like that. Thank you

Michael Hale

Sure thing