| bio | website | lauschkeconsulting.net |
|---|---|---|
| location | Rahway, NJ | |
| age | ||
| visits | member for | 10 months |
| seen | 7 hours ago | |
| stats | profile views | 167 |
Mathematica, Java, Scala, C#, F# afficionado. Mooney lover. Steak lover. Linux lover (Fedora). German citizen. Politically: anti-bullshit. Financially: pro-bullshit. Apple hater. Pear lover. Hobby jurist.
Visit my Scala for Java Developers Class on udemy.com: http://www.udemy.com/scala-for-java-developers-transition-up
|
Apr 15 |
answered | Can images made with a trial version of Mathematica be published without copyright issues? |
|
Mar 30 |
awarded | Enthusiast |
|
Mar 29 |
comment |
CreateCOMObject doesn't work on home edition for starters, put a semi between the Needs and the InstallNET. |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points @Lou: indeed, M and the JVM are a match made in heaven. The M/.Net combination (qua NETLink) is also quite powerful, it's very, very similar. I mull writing a blog post here about using JLink. I think JLink is totally under-appreciated. |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points @TheGwa: is this a typo in the headline? I'm only counting 20 or 21 points (depending on how you see this, it can be considered a 20 or 21 point problem). But where does the 30 in the title come from? |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points I understand all that. You're talking the technical details. You're missing the point (of our discussion). You're merely restating the objective, but I can read too (from the o/p). We had this before, and I'm already getting the "no extended discussions in comments" warning from m.SE, so I'll just leave it with that. |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points part 2, ... to go back to the start node as well, no matter where the depot is. By pre-selecting start and end node you can make a solution (almost) arbitrarily good or bad if you don't close the tour. |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points I DID notice that at least TWO points are locked, but I didn't find which ones they actually are (meaning node index). That's why I showed a way to model this in a very flexible manner in my answer. And, this may possibly be better solved with a min cost path approach, as VF1 has already indicated. My point about selecting start and end points allowing for manipulation, a TSP solution is a (closed!) tour, not just a path from a start node to an end node. That's why you always have to consider the edge length from end to start as well, or it's not a TSP. Eventually a bus needs ... |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points the o/p does not mention a specific start point -- unless I'm missing something (in that case please correct me). You pick the start point purely arbitrary, which gives you room to make your solution almost arbitrarily "good". As for you having no idea how meeting a stated requirement falls into the cheating category, I can only concur, but you merely CLAIM you are meeting a stated requirement. As I said, you pick your start node arbitrarily, giving you the option to pick and choose, thus making your tour (almost) arbitrarily "good" (or bad). |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points @Lou: done, see my addition above. |
|
Mar 25 |
revised |
Travelling salesman with start and end points for 30 points - |
|
Mar 25 |
comment |
Travelling salesman with start and end points for 30 points But that's exactly my point. It's cheating if you can pick and choose your start and end nodes. The optimal tour is {{-25.6756,28.0821},{-25.6439,28.1315},{-25.7661,28.2811},{-25.7864,28.2807},{-25.795,28.2993},{-26.2055,28.4206},{-26.772,28.4998},{-26.8743,28.2505},{-26.4214,28.1074},{-26.407,28.1385},{-26.2625,28.1786},{-26.1713,28.2138},{-26.1694,28.2079},{-26.0939,28.1938},{-26.0438,28.1198},{-25.9878,28.0691},{-26.0259,28.0692},{-26.0449,28.0347},{-26.0474,28.0061},{-26.149,27.9227},{-25.992,27.5331}}, verified optimal, and the longest edge is between start and end, the length is 3.22458 |
|
Mar 25 |
revised |
Travelling salesman with start and end points for 30 points edited body |
|
Mar 25 |
answered | Travelling salesman with start and end points for 30 points |
|
Mar 22 |
comment |
What can webmathematica do that CDF cannot do? @Albert Retey: I had to change the sentence that the GUI part of webM is html-only. That's not true, there is a plethora of UI technologies that go beyond simple html forms. None of the items even mentioned the word "JSP", so I had to add a JSP item, and from there mention several technologies readily available from JSPs. Only the first three lines of the first item and the second-last item "dealt with" the server-side technology, but that didn't really "cover" it. |
|
Mar 22 |
revised |
What can webmathematica do that CDF cannot do? added 3857 characters in body |
|
Mar 20 |
comment |
Can Enterprise Edition really encrypt code for distribution via CDF? @AugR: a) I used no sarcasm at all. b) you're talking nonsense about security-through-obscurity, and what you "conclude" about me. c) "There is no need for you to apologize": for once, I agree with you, d) Why do you think I didn't do this already? WRI knows it already, and knew it before I reported it to them (from others). e) I don't need to provide evidence (to you, that is). The professionals whose opinion I care about (WRI and here) expect me NOT to follow your request of disclosure. Chide me for providing no evidence, I am more than A-OK with that! No sarcasm in this one either. |
|
Mar 19 |
comment |
Can Enterprise Edition really encrypt code for distribution via CDF? @Rolf, ok, just encrypting parts of it may do it. But that is the key info. And then you might as well encrypt everything, it's just a string. Once you have your crypto set up in a reliable manner, it doesn't matter if you encrypt a character or a long file because internally it's all done with block ciphers (which use stream ciphers on blocks). |
|
Mar 19 |
comment |
Can Enterprise Edition really encrypt code for distribution via CDF? @Jagra and Rolf: what you are discussing along the lines of PGP is similar to my reply on a CDF blog post:blog.wolfram.com/2011/07/21/… scroll down to "Mooniac". I mentioned GnuPG, which is a particular implementation of PGP. Some people called the CDF useless for corporate purposes, and although that's going too far (I've used it successfully in corporate environments where encryption wasn't needed), the lack of encryption is a VERY RELEVANT barrier to wide-spread adoption. |
|
Mar 19 |
comment |
Can Enterprise Edition really encrypt code for distribution via CDF? @Jagra: no worries, see my other comment. I'm quite critical of WRI's denial of these problems (not just this, there's more), but I'm not malicious. |

