« first day (127 days earlier)      last day (4366 days later) » 

1:24 AM
@belisarius that's a nice spiral but some of the related videos seem very strange. On the plus side, my pineal gland is now feeling very activated, my codons unlocked, and my chakras healed.
 
1:38 AM
@acl "ParallelOptions" -> "ParallelThreadNumber" -> 1 controls things in the kernel that have been manually threaded or maybe use OpenMP; the MKL threading is controlled using a separate option, MKLThreads. That should work but if you're left in any doubt, just set the processor affinity on the kernel to only give it one CPU. Then, when the first threaded function is called, the threading library should see the situation and figure out that it shouldn't spawn extra worker threads.
 
CHM
@MrWizard will do, sure.
 
2:19 AM
@OleksandrR I just wanted to show the spiral. I had no intention to mess up with your loins.
 
3:08 AM
Woo hoo! Got another convert from SO. Oddly, no-one suggested it to him on his previous question. Now we'll see if he posts something here.
 
 
1 hour later…
4:32 AM
@rcollyer excellent! We probably need to lurk there a bit more often and direct people here. I haven't really spent time at SO lately.
 
 
3 hours later…
7:19 AM
I went ahead and posted the ad on CSTheory. Those of you who have an account there can consider upvoting.
 
7:30 AM
@OleksandrR Does your aura match the curtains again?
 
7:50 AM
Here's the version of the ad posted on Math.SE. It needs 6 upvotes to be shown.
 
 
2 hours later…
acl
9:38 AM
@Szabolcs Yes, MKLThreads is the one I needed. thanks to both!
 
@acl You meant to ping @OleksandrR (thanks for the corrections Oleksandr!)
 
acl
@OleksandrR Yes, it was MKLThreads as both Szabolcs and you said
@Szabolcs no you (I saw MKLThreads in the editor you mentioned, but probably did not change it when I tested)
anyway, problem solved
 
@acl Did you try that curve resampling function I gave you yesterday? Does it work on 2D curves (i.e. ones that "go around")?
 
acl
@Szabolcs Not on such curves, no. I played with it on data points I have that have no overhangs and it works well
 
10:31 AM
Here's the Physics.SE version of the ad. This one needs to be voted above 6 as well in order to be shown:
 
acl
10:53 AM
hm, I just spent my break using the arxiv api to work out the papers with most articles with "Hall" in the title or abstract and plot histograms
some people must be machines (and I'm too scared to try it in other ares of cond matt)
 
11:47 AM
@Szabolcs @acl I found a version of the Ramer-Douglas-Peucker algorithm in an old notebook of mine. It works for curves going around as well.
 
acl
12:01 PM
@Heike really? how? can I take a look?
 
12:18 PM
@acl This is the code:
reducePts[points_, tol_] :=
Module[{maxpos, testSeg, seg, distf},
distf[q : {x_, y_}, {p1 : {x1_, y1_}, p2 : {x2_, y2_}}] :=
With[{u = (q - p1).(p2 - p1)/(p2 - p1).(p2 - p1)},
Which[u <= 0, Norm[q - p1], u >= 1, Norm[q - p2], True,
Norm[q - (p1 + u (p2 - p1))]]];

testSeg[pts_List /; Length[pts] > 2] := Module[{dlst, max, pos},
dlst = distf[#, pts[[{1, -1}]]] & /@ pts[[2 ;; -1]];
max = Max[dlst];
If[max > tol, pos = Position[dlst, max][[1, 1]] + 1;
{testSeg[pts[[;; pos]]], testSeg[pts[[pos ;;]]]},
here, points is the initial list of points and tol is the maximum distance between the original and reduced curves.
 
 
1 hour later…
acl
1:31 PM
@Heike hm recursion limit hit
 
1:48 PM
@acl How long is your point list?
 
2:07 PM
Our community ad on Statistical Analysis has been reposted on the correct question. Please vote for it.
 
2:25 PM
@rcollyer Tch, all I did was to merge the answer the guy posted into his question... :D
@Szabolcs It got one downvote there. Hmm... :)
 
acl
@Heike 1075 pairs. I'll try to unroll your code later tonight
it's well written
 
@JM I'm pretty sure it's "we don't want no closed source stuff around here!"
 
2:41 PM
Likely, yes.
 
I don't have enough rep to see the downvote ... but for as long as the net vote count is not less than +6 it should be fine.
 
@acl funny. I tried it on pts = First@First[CountryData["Brazil", "FullPolygon"]]; which contains 1202 points, and that seems to work fine:
pts1 = reducePts[pts, .001];
Graphics[Polygon[pts1]]
 
acl
@Heike hmm try this
img = Binarize@
  Import["http://i.stack.imgur.com/I2gkK.jpg"]; pts = (Position[
   ImageData[img], 0]);
Length@pts
reducePts[pts, .001]
 
@JM Probably the same people who were complaining about ads for Wolfram|Alpha
 
Do you think this should be closed as duplicate (see the comments on my answer)?
 
2:47 PM
@Szabolcs Tell you what: if three of you vote to close, I'll cast the fourth one.
 
@JM I realized that. I thought it was his doing, at first, but I wanted to point out that his "answer" was used verbatim in his new "question." And, yes the quotes are deliberate.
 
@acl I think the problem is that the points need to be in the right order for it to work
 
acl
@Heike OK I see. ordering them is a nontrivial problem (for me)
 
@acl I'm actually working on that now
 
@rcollyer Oh, I can see that. But, gee guys, you have powers! I'd prefer to use my mod powers only for really hairy messes...
 
2:49 PM
@acl You mean you only have the points, but not the line going through them, and you need to construct the line somehow?
 
FindCurvePath gets a long way, but that still produces a list of subpaths
 
acl
@Szabolcs no I mean, if I have the points and wish to order them so that connecting them with lines creates an outline of the shape, this is not so easy
 
@acl Yes, that's how I understood it, I wasn't very clear. So almost the same thing as in the question on this site?
 
acl
I have written something which works by taking a point then iteratively selecting the one closest, removing it from the list and repeating, but it breaks sometimes. and I didn't yet have time to fix it
 
@acl Can you give us a set of points to try it on?
 
acl
2:51 PM
@Szabolcs yes, I had basically thought about it before but in the end brute-forced my problem otherwise. but it's a useful routine to have
you can always do it with the set given in the question
 
Indeed, I wonder what algorithm FindCurvePath[] actually uses. I haven't had much luck searching for point-sorting algorithms.
 
acl
ie with
img = Binarize@
  Import["http://i.stack.imgur.com/I2gkK.jpg"]; pts = (Position[
   ImageData[img], 0]);
 
You could try finding the shortest path, but that's bloody slow ...
 
Almost always the prescription is "sort by polar angle"...
 
acl
@JM if there are no overhangs yes...
 
2:52 PM
@acl i.e. if the shape is almost nicely approximated by its convex hull.
 
@JM Last I checked, I couldn't delete answers, at least non-negative voted ones. That said, you had made the change, and I was trying to point out that it may not have been wholly correct.
 
acl
@JM in my actual case it is not
 
@acl Oh, so this is actually the problem from the question, it's not a task that you need to solve for your work?
 
acl
@Szabolcs I have solved the analogous thing for my work, but inelegantly.
 
@rcollyer I forget. What's the rep threshold for voting to delete?
 
2:53 PM
@JM 4000 after 3 (?) days, and above 10000 you can do it right away if it's negative voted
 
@acl Yeah. So, again, we wonder what magic FindCurvePath[] is doing...
@Szabolcs Great, thanks. :)
 
acl
@Szabolcs the data points I have take some time to calculate (they are energy spectra, more or less) and I do not want to run even more jobs on the cluster at the moment to produce the data set (we only have 40 mma licenses, I don't want to prevent others from working...)
 
@JM 4k, yet that requires an answer to have a negative score. That one was at 0 when I looked at it ... and I never thought to downvote it myself. I am not used to having this much power. :P
 
...and people are so excited about the graduation... :) I'm quite liking the current slow burn here.
 
@acl DL posted a link to an implementation of his of a FindCurvePath-like function, I'm searching...
 
acl
2:58 PM
@Szabolcs if it was here I missed it
 
@Szabolcs there's no 10k privileges on beta, at 4k you get them all, including immediate delete for negative answers. All powers, except of course the super-special super-secret mod powers.
@JM with you mod-powers, do you need a cape, like super-man? Speaking of which, why don't the 4k (trusted users) get capes?
 
@Szabolcs Right, that's the top tier, and it is at 4k, not 10k. But, it will be 20k after graduation.
 
@rcollyer You're right. @JM So that's 2k and 4k then, not 4k and 10k.
@acl I haven't tried it, but you might find this useful: forums.wolfram.com/mathgroup/archive/2011/Mar/msg00529.html
6
A: Character edge finding

Daniel LichtblauPosting as an answer per request. See http://forums.wolfram.com/mathgroup/archive/2011/Mar/msg00529.html Caveat: It's been almost a year since I've toyed with that code. Strange things can happen to code left on the dusty shelves of Usenet. The basic idea was similar to Leonid's: use some proxi...

 
acl
@Szabolcs OK let me see if I can get this to do my job. thanks
 
3:05 PM
@rcollyer Haven't asked, honestly. :) Never felt curious enough.
 
Did you see this? Did someone mail him about the question?
 
R.M
@Szabolcs some people also track visits and referrers to their sites very religiously...
 
@RM That's true. When you're TAing, and some student posts the midterm quiz on a QA site or help forum, it's easy to find out :D
 
@Szabolcs Clear proof that some students just don't think...
 
3:25 PM
@JM well if we're going to get swag when we graduate, why not capes? =D
 
@rcollyer Heh, right.
Somebody refresh me: where did they move the old MaxBend option for plots again? I remember it's now an option setting of Method...
 
@JM I was looking for that today and couldn't find it...
@JM Do you by any chance know how the adaptive refinement algorithm changed between 5 and 6? I seem to recall reading somewhere that it did ...
 
@Szabolcs I don't, sorry. :(
That comment you made in one of the questions prompted me to dig up some of my old code. I do remember successfully reproducing the behavior of old Plot[] and ParametricPlot[].
But comparing the results of my old code with the current implementation seems to show that the current implementation evaluates at way more points...
 
3:46 PM
@Szabolcs Found it: Method -> {Refinement -> {ControlValue -> (* angle *)}}
They sure buried that setting deep...
 
@JM Now the obligatory question: where did you find it?
 
@rcollyer This.
 
4:03 PM
@JM thanks. The parametric plots he shows later in that chapter would be a good time waster! :)
 
@rcollyer Indeed. :)
 
R.M
too localized question and possibly unhelpful answer... looks like the code works for most people and he just had an issue with existing variables in his session
 
@RM works for me.
Incidentally, the ad has been seen in the wild on Mathematics:
 
acl
@RM well, it is apparently someone's favourite question!
(or one of their favourites anyway)
 
user image
2
 
4:13 PM
@rcollyer despite the downvote
 
@Heike it currently has a score of 9, overall.
And, a 6 on Physics and Statistical Analysis, so it will be displayed there as well.
But, the stats on stats, is not showing up. :)
 
@JM Do you have the book by any chance? Would love to take a look ... (Google Books says those pages are unavailable)
@rcollyer Something is wrong there. I put a comment on Aarthi's post, hopefully they'll react eventually
 
@rcollyer I voted for the one on math.se. I would have voted for the other ones as well if I had had an account there.
 
@Szabolcs Well, I managed to acquire a soft copy of the third edition, and I have the first and second editions in hardback...
 
@Szabolcs someday, they may get to it ... eventually
@Heike voted for physics, math, and stats.
 
R.M
4:18 PM
@Szabolcs jeez! Relax... it just crossed 6 votes. These things are all cached, so it'll take a while
 
@RM But not a single ad shows up in the stats there, not even those with 9 votes.
 
R.M
@Szabolcs I'm guessing the link to check stats is incorrect
Well, she'll probably fix after your comment
 
@RM You are right. This is the correct link. (@rcollyer)
so is 'funnest' proper English then?
 
R.M
no
 
@Szabolcs not even close.
 
4:26 PM
@Szabolcs most certainly not.
 
But, it was deliberate, so I didn't say anything.
 
"most fun" would be the proper English.
 
R.M
it's a bastardization made popular by Steve Jobs in a WWDC address (or something similar) a few years ago
"popular" might be a stretch here too...
 
Janus finally came over to the dark side from SO.
 
4:30 PM
@rcollyer Oh, who offered Janus cookies? ;)
 
@JM His browser?
 
R.M
Rats. Cookie Monster would've been a nice handle
 
(It was a oblique reference to "Come to the dark side; we have cookies.")
@RM Om-nom-nom. :)
 
"Do you want to help me improve it more quickly?" :-)
 
Oh good God, look at that code!
 
4:34 PM
it's just a big expression
 
R.M
@JM I thought come to the dark side was always preceded by a surprise revelation about who your father is...
 
@Szabolcs I was more explaining about the formatting (or lack thereof), but we've seen worse. (I've edited worse.)
 
@RM I suppose... but that weird green guy is supposed to be an expert on those things.
 
@RM so, you're the reason, "who's your daddy!?!" is running through my head.
 
@rcollyer I have the impression that a lot of people think you can just dump something nice and long and you don't have to do any thinking at all...
 
R.M
4:37 PM
@rcollyer well, if that's running through your head, you've probably got other issues besides me... ;)
 
@rcollyer I've seen worse. I remember one post where the OP wrote expressions like array[[i, j]] as lst[[i]][[j]]. Unfortunately, his arrays went quite deep
 
@JM I'm under that impression, also.
 
R.M
Lorem ipsum dolor sit amet, consectetur adipiscing elit. Pellentesque eget risus nunc, sed ullamcorper purus. Mauris ante quam, vehicula sed fringilla id, gravida vel lorem. Etiam sodales cursus velit, nec suscipit risus tincidunt vel. Sed enim dolor, lacinia vel viverra non, sagittis et dui. Suspendisse potenti. Etiam sed pharetra ligula. Suspendisse potenti. Integer sodales orci sed leo sagittis ac porttitor augue porta. Quisque at nulla id dolor blandit iaculis. Duis eu lacus sed erat lobortis viverra nec congue lectus.
 
@Heike I don't remember that one, and please don't show me.
 
@Heike Sounds like a hold-over from his/her previous language...
 
R.M
4:38 PM
Why does this not work?
 
@RM Simple answer: Bob.
@JM likely.
@RM I never said I didn't. :P
So, back to the question at hand: candidate for migration?
 
@rcollyer I thought the answer was mu.
 
@Heike only if you're talking to a cow.
 
@rcollyer I was thinking of this
 
@Heike I was thinking of the greek letter.
 
4:43 PM
@rcollyer small thoughts, eh?
 
@JM just minor annoyances, yes. :)
@RM Ah, I understand now. You're using the wrong language, the parser only accepts pig latin.
Bye for now.
 
@rcollyer Oh-say, it was all ong-wray?
 
R.M
celtschk has flooded a bunch of retags with ... would be better?
 
@RM What could be confused with?
Actually, I'd probably even shorten to ...
 
R.M
I suppose... I can't pin it down, but it felt incomplete. just like
No, functions is way worse...
 
4:57 PM
@RM Well, that one has the nice aura of vagueness...
, not so much...
 
R.M
alright, I got to leave now... bye
 
see you.
 
acl
5:13 PM
@rcollyer no
 
 
1 hour later…
6:36 PM
What's the point on Factorial returning Overflow[] or not for big machine integers but returning unevaluated for big integers? (Developer`$MaxMachineInteger+1)!
Hey rcollyer
 
@acl I figured as much. But, I thought I'd check.
@Rojo Hello.
@Rojo that's odd.
 
Yeah
It makes you able to do
but not (99999999 + 1)!/99999999! // FullSimplify
Doesn't seem so hard to return unevaluated when it overflows, does it?
 
Nope, it doesn't.
My current question has to do with Quiet.
Since I was using On["Packing"]; ... Off["Packing"] a lot recently, I'd thought I'd make a companion to Quiet: Loud.
 
What's your current question?
 
However, Quiet accepts a third parameter: what things you don't want quieted, and Quiet[expr, None, All] is supposed to turn everything on.
Yet, Outer[{#1,#2,Times[##]}&, Range[5], Range[5]] will give an unpacking message with the On Off trick, but not within Quiet[..., None, All].
 
6:42 PM
Interesting
Perhaps that's why the third argument isn't documented?
 
@Rojo Oh, but it is.
 
Wo, it is
No possible issues section
 
@Rojo that's how I know it is there.
And, no issues section.
 
and that third argument usually works fine?
 
Similarly, Quiet[..., None, "Packing"] does not emit a Message, but it shows up in Trace[..., TraceInternal->True].
@Rojo Have never tried it before.
 
6:50 PM
Same happens here
OHH
 
Changing "Packing" to Developer`FromPackedArray::punpack1 (the specific message) does not work either.
 
Overflow[] is an atom
 
That's interesting. Apply won't work on it then. :)
 
Haha
I'm trying to understand why I'm having trouble injecting into Factorial to leave it unevaluated when it overflows
and one of those issues is related to yours
Quiet[99999999!]
doesn't issue a message, but it does when it's called from within my factorial
 
This works, though:
Bob::msg = "This is a message."
Quiet[
Message[Bob::msg],
None,
Bob::msg
]
But, this doesn't:
Quiet[
 Message[Developer`FromPackedArray::punpack1, 4],
 None,
 Developer`FromPackedArray::punpack1
 ]
On the other hand, this does work:
On["Packing"]
Quiet[
 Message[Developer`FromPackedArray::punpack1, 4],
 None,
 Developer`FromPackedArray::punpack1
 ]
Off["Packing"]
WTF?
Why, then doesn't Quiet[..., None, "Packing"] work?
 
6:59 PM
Hehe
We're needing help it seems
 
Seems so.
 
How can, anywhere in the whole MMA
Quiet[Print["boo"]; 99999999!] print and issue a message?
 
Incidentally, replacing Developer`FromPackedArray::punpack1 with "Packing" works. So, it seems if "Packing" is not On to begin with, Quiet does not have the ability to turn it on. In other words, the third argument can't change the global values which seems less then useful.
@Rojo I've found that there are some things that just can't be overridden. Either their using an undocumented/low-level function which is unblockable, or Quiet has holes in what it can block.
 
Can be, yeah
but I'm not giving up for another couple of minutes
 
Best of luck. I'll talk to you later.
 
acl
7:42 PM
@rcollyer yes that is what it looks like, try
Off["Packing"];
Quiet[Outer[{#1, #2, Times[##]} &, Range[5], Range[5]], None, All]
On["Packing"];
Quiet[Outer[{#1, #2, Times[##]} &, Range[5], Range[5]], None, All]
 
@JM More downvotes? It only has 8 now ...
 
8:07 PM
@RM it's soon bedtime for me (very late here), but I didn't forget about your comment on the stylesheet question. Also, that answer was meant to complement yours (which I of course +1'd).
 
R.M
@Szabolcs I remember you (or maybe someone else) discuss something about the automatic (* :: Package :: *) style comments that are generated... do you know how to specify package name, author name, version name etc.
@Szabolcs Oh, I was genuinely curious, didn't mean for you to delete it or anything. If there's a way to get the definitions into the stylesheet by altering the global options and without editing the cell contents, I haven't found it yet and your answer seemed to imply that... it would've made life a lot simpler
 
@RM I misunderstood stylesheets a bit, so it's not as trivial to get it into the stylesheet as I thought, I'll try to update the post tomorrow
"You can only perform 6 searches within a 60 second window, please wait a moment and try again." BAH! SE, make your search function better, then I won't repeat searches!
10
Q: What is the purpose of tags like :Name:, :Context:, etc. in packages?

SzabolcsI noticed that all of the packages that come with Mathematica start with a header that is in a standard format. (See e.g. the header of NIntegrateUtilities` at the end.) There are several commented sections, each starting with a word surrounded by colons. Question: What is the purpose of thes...

That's all I know ...
So, from what I can see, the Mathematica ad got at least 2 downvoted on Math.SE. I just don't understand why there's so much hostility.
 
R.M
ah, that's about reading them, not generating them... Maybe possible, maybe not:
> One fact which I find indicative is that new packages auto-generated with WorkBench do not contain these headers (may be this is just a setting which is switched off by default, I did not dig into this particular issue deep enough).
-LS
 
I blame Sage and their dirty playing ... I have the impression that instead of just trying to make a good system, some of the people from that project were directly attacking other projects, and trying to hinder them, creating a bad atmosphere.
 
R.M
Meh, it's ok... the whole open source vs. closed is always contentious, and best to walk away from it. Besides, the most popular ad has only brought in 500ish clicks in 6 months, so it's not like we expect to get people in large numbers.
 
8:19 PM
Anyone want a "badge" for your site or profile?
 
acl
@RM sometimes I wonder how some people find time to worry about whether their tools are open or not
@Szabolcs so actually, what was the consensus in the end? I could put a badge on my site, but I dislike all three: the spiky thing, its colours and the fonts (I mean no insult to whoever designed this, I just don't like it on my site). so what to do?
 
There was the idea that closed source is inherently incompatible with peer reviewed science, which makes some sense in certain circumstances (depending on what sorts of tools are used), but others took it as far as suggesting that results produced with closed source "are not as good" or "not as trustable". Which to me is nonsense: all software is buggy and you must verify your results, not claim that "it was made with something open source, verify the program yourself if you have doubts".
 
R.M
@Szabolcs -- Sent from my iPad
 
@RM :D
@acl That was only for the ad, not for the site design. You're welcome to post a new design in the site design thread if you like (it would be great!), and also in the ad thread. It's so easy to change the ad to a new design if anyone makes one, I though that there was no reason to delay using it more
whuber actually suggested rotating designs
This badge: I just made it for fun for my profile here
 
acl
@Szabolcs but that's silly. outside books, results are believed because they're reproduced by different approaches, not because they are thoroughly checked
anyway
 
R.M
8:26 PM
@Szabolcs heh, you should push your profile to all sites... no point having it here :)
 
acl
@Szabolcs yes well I tried making a few but I am not sure I can produce anything presentable myself...
nope, my latest attempt is also bad
OK, what do you guys (and girls!) think about the recent influx of basic/badly thought-through questions?
 
R.M
people aren't closing enough
 
acl
I mean, what do we do? we should not be aggressively closing things left and right
@RM yes that may fix it, but I don't disagree with not making it unpleasant for people asking something for the first time
 
R.M
You hold the hands of those that can be held. People who dump 100 lines of code with barely a sentence of coherent text will never improve. They've probably been rejected from other fora as well.
 
acl
on the other hand, if they're told and nothing improves...
@RM right, yes
but then how about questions like this
1
Q: Formal power series form of linear operators

AnixxI want to know how to make Mathematica to automatically convert between forms of representation of linear operators: algebraic expression and formal power series expression. Examples: $f(ax)\rightarrow a^{x D}$ $f(a+x)\rightarrow e^{a D}$ $\int_x^{x+1} f(t)\,dt\rightarrow {e^D - 1 \over D} $ ...

as far as I am concerned, it demonstrates a lack of understanding of what a piece of software like mma currently does
it's also badly asked
so what to do? it's just going to sit there and clutter the place up, and encourage others to hurl this sort of thing at the site
 
R.M
8:41 PM
That was confusing... To me, that made no sense at all (until whuber shed some light), but I didn't vote to close then because it seemed like whuber and azdahak understood or at least, knew what he was talking about and I didn't want to jump on it for lack of domain knowledge
I'm for closing it now. It's been a while and the OP has not shown a willingness to explain it better
 
acl
@RM anybody who took 1st year QM would understand it
that's my point, the way it's posed is very domain-specific even if he doesn't seem to realize it
 
R.M
Yeah, domain specific is ok, as long as he makes the effort to explain the requirements more generally, which he didn't. I've voted to close.
 
acl
@RM Well, now it seems more concrete: he has examples of input and output, but I still don't understand if he simply wants a few cases hard-coded or some way to go from one form to the other
 
R.M
@acl well, that's barely useful... he just changed a -> b to input: f[a], output: b
 
0
Q: Mathematica self-evaluation: let's get critical!

Anna LearYou love your site and we love your site, but there is a whole world of people out there who might not even know it exists. When they do find it, their first impression will either scare them away or keep them around. Given this, let's take a hard look at the questions and answers here and make s...

 
R.M
8:47 PM
@acl he wants something a lot more than hardcoded stuff... he wants to be able to "magically" find these transformations.
How can it help to find the formal power series representation of operators? For example, I want to get formal power series expression for $\sum_0^{x-1} f(x)$, $f(x)*g(x)$ (*-convolution), $f(\sin(x))$. How I can get the formal expression for these linear operators? — Anixx yesterday
 
acl
@RM yes I had seen that but still wasn't sure what he actually wanted
(mainly because I couldn't parse what he says and still can't)
OK I'll go for closing too
 
acl
9:12 PM
@RM very apropos. so, what precisely is being determined via our votes? what happens after the voting is done? who does whatever it is that gets done about it?
 
R.M
@acl I presume they probably file it away until they wake up from their slumber and decide whether or not to graduate us... I guess we're supposed to be critical of it and see if the answers provided are good, and if so upvote and if answers from other sources (via Google etc) are better, downvote. So it provides a "rough measure" of how much of a canonical resource this site is
going by the fact that the who's who in the professional mma world and other regulars from MG and SO are here, I'd say the chances are pretty darn high.
 
acl
@RM but if the comparison is to be to (say) google, why did you not upvote this
11
Q: What are the differences between the “Home Edition” and the regular Mathematica?

F'xThe product page for Mathematica Home Edition says: Mathematica Home Edition is intended for hobbyists and enthusiasts alike, for non-professional use. If you wish to integrate Mathematica in your work, teaching, or research, other licensing options are available. but I cannot find there n...

which basically includes the same information you'd get via google plus personal confirmations of the (somewhat unclear) statements on the wri site?
(I mean, I'm not criticising you or anything!)
 
R.M
9:28 PM
@acl I'm not doing them all at a time... a couple here and then between breaks.
 
acl
@RM oh i see, you're actually thinking about them :)
 
R.M
Not very hard... I mean, from experience, I know right away that there's no way you can google most of them. I'm not really googling them, but rather looking through the answers and usefulness of the question
As for the question you linked to, the first hit is actually this question from Super User...
 
acl
9:48 PM
@RM looks good, but the accepted answer has a comment to the effect that the kernel is only 32 bit. that doesn't seem to be true on my machine, and Heike sees the same
(my point is, this is confusing, even if things look definitive; this tends not to happen here)
but yes googling most of these would be a waste of time, which I suppose is part of the reason that attracted all of us to SO and then here
 
R.M
In other news, Istvan is about to get a gold badge... answering first isn't bad after all, eh? ;)
 
acl
@RM if anybody not used to mathematica sees those answer they'll run away screaming
 
10:43 PM
@RM I just googled most of them and I was amazed how high these questions were for relatively general search terms.
 
acl
hmm... I am trying to make a 3d plot and somehow extract and set the ViewPoint etc in real time, while manipulating it with the cursor. I seem to remember something like that but can't find it. any ideas?
 
R.M
@acl This?
 
acl
@RM yes! thanks
 
acl
11:04 PM
excellent, that solved my problem. now if only I understood DynamicModule...
 
11:25 PM
@acl For me it's Manipulate that I don't get.
 
acl
@Heike you probably have a stricter definition of "get" then.
If I try to think about the details of whats, I also don't understand Manipulate. But I just type out what seems reasonable and it does its job for the simple things I use it for
DynamicModule I don't understand even at that level
"one of these days" I'll re-read the docs
 
I use DynamicModule pretty much in the same way that I use Module, except that I use DynamicModule when Dynamic parameters are involved and Module otherwise.
 
acl
@Heike OK I changed DynamicModule in the first example in the docs to Module and copied the output, and now I see the difference. No clue how I'd use this or, more importantly, how it fits into my picture of mathematica programming concepts and techniques
that's a problem of my picture though.
 
There is a tutorial on DynamicModule vs Module in tutorial/AdvancedDynamicFunctionality
 
Hello
 
acl
11:34 PM
@Heike yes. I read it once and understood it, or so I thought. guess I'll do it one of these days, (I need a way to spend my copious amounts of free time :) )
@Rojo hi
 
Hi @Rojo
 
hi @acl @Heike
Heike, you sure can help me save some time browsing... How would you go do an interface with two types of locators (that autocreate when you click)?
I'm assuming a couple of radiobuttons to choose which one you're creating is necessary.
I wanna do an interactive interface to create a zero-pole diagram
 
R.M
@Rojo You can probably also look at Nasser's demo
 
@Rojo I would probably put all points in a large list and maintain two lists of indices. Radio buttons would work to indicate which list you're adding points to.
removing points is a bit trickier though.
 
But
what about having the locators look different?
Red crosses and blue circles
Is that simple?
Thanks for the link! Seems it will be quite helpful
It's what I wanted
 
R.M
11:44 PM
Nasser has several of these signal processing demos — some of them very complex too. 12000.org/my_notes/mma_demos/index.htm
 
Very interesting, thanksª
 
acl
what happened to Nasser by the way, he's disappeared. maybe he got angry at the criticism of the length of his questions
(which was rather excessive sometimes)
 
R.M
He's been quite busy:
Thanks Leonid. I have been busy writing Mathematica demos for the last few months. I finished 7 new demos, there are numbers 25-31 in this table here: 12000.org/my_notes/mma_demos/KERNEL/KERNEL.htm (send copies of these to WRI demonstrations project also). Whenever I finish one, I get new idea for a new one. Took 7 months to do these 7. The more I use Mathematica, the more I find how little I know about it :) — Nasser M. Abbasi Apr 17 at 23:12
 
acl
@RM OK good, he asked some good quesstions
 

« first day (127 days earlier)      last day (4366 days later) »