AMPRNet
I've been looking into packet radio and wondering how AMPRNet works or better put how it fits into the picture of the internet as a whole. Also are EchoLink and AMPRNet the same? /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Re: Pay Range Locally?
On Thu, May 12, Robert Merrill wrote: > > For example: high-level schools (locally, think UofU, BYU) teach a lot > of theory and hard math. It's good stuff, but in some corporations > these students come out more interested in the academics of solving > the problem than getting code to commit on deadline and shipping the > next release. Curiously, I think my programming career has been enhanced at least as much by my Physics degree as by the handful of programming courses I took. In the physics classes, programming was just a way to get a result faster than cranking through everything by hand, so it encouraged straightforward and correct code. Even more to the point, the very word makes certain managers automatically assume I'm smart, which has opened some great doors. Granted, as much as I disliked CS-235 while taking it, the awareness of big-O has helped me tremendously in finding bottlenecks and choosing decent algorithms. - Eric /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Re: Pay Range Locally?
big-O? On Fri, May 13, 2011 at 12:43 PM, Eric Wald wrote: > On Thu, May 12, Robert Merrill wrote: >> >> For example: high-level schools (locally, think UofU, BYU) teach a lot >> of theory and hard math. It's good stuff, but in some corporations >> these students come out more interested in the academics of solving >> the problem than getting code to commit on deadline and shipping the >> next release. > > Curiously, I think my programming career has been enhanced at least as > much by my Physics degree as by the handful of programming courses I > took. In the physics classes, programming was just a way to get a > result faster than cranking through everything by hand, so it encouraged > straightforward and correct code. Even more to the point, the very word > makes certain managers automatically assume I'm smart, which has opened > some great doors. > > Granted, as much as I disliked CS-235 while taking it, the awareness of > big-O has helped me tremendously in finding bottlenecks and choosing > decent algorithms. > > - Eric > > /* > PLUG: http://plug.org, #utah on irc.freenode.net > Unsubscribe: http://plug.org/mailman/options/plug > Don't fear the penguin. > */ > /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Re: Pay Range Locally?
On Friday, May 13, 2011 01:44:24 PM Merrill Oveson wrote: > big-O? Heh. You know, Big O Tires. They're a popular case study in Computer Science curricula. http://en.wikipedia.org/wiki/Big_O_notation -- Doran L. Barton - Hypermoo Inc. - - 801-520-9875 Open source consulting, custom development, systems/network administration "Typhoon rips through cemetery; hundreds dead" -- Headline seen in newspaper /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Big O (was Re: Pay Range Locally?)
On 05/13/2011 01:44 PM, Merrill Oveson wrote: > big-O? The Wikipedia article makes it sound complicated. Here it is in a nutshell. Let's say you have two algorithms that do the same thing but in a different way, and you need to choose one. Big-O notation is a good way to compare the theoretical scalability of algorithms. Let's say an algorithm iterates over a list, and for each element in the list, iterates *again* over the entire list. This is O(n^2) behavior and is usually naive. Another algorithm might use hashes and buckets. It still has to iterate over every element of the list, but for each element, it only has to look at the buckets, and the number of buckets is relatively small. This kind of algorithm probably has O(n log n) behavior, which usually scales a lot better. Everyone loves an O(1) algorithm, which means that the algorithm takes the same time regardless of the number of inputs. Selecting a random item from a list is an O(1) operation. In real life, sometimes an O(1) algorithm takes longer than an O(n^2) algorithm. Also, sometimes the scalability of some particular operation is not very important and the "bad" algorithm that is much easier to implement saves a lot of time and money. Still, big-O analysis is very important and developers should be thinking about it in *everything* they write. Shane /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Re: Big O (was Re: Pay Range Locally?)
On Fri, May 13, 2011 at 2:15 PM, Shane Hathaway wrote: > On 05/13/2011 01:44 PM, Merrill Oveson wrote: > > big-O? > > Let's say an algorithm iterates over a list, and for each element in the > list, iterates *again* over the entire list. This is O(n^2) behavior > and is usually naive. > > Another algorithm might use hashes and buckets. It still has to iterate > over every element of the list, but for each element, it only has to > look at the buckets, and the number of buckets is relatively small. > This kind of algorithm probably has O(n log n) behavior, which usually > scales a lot better. > You know you are a geek when you use big-O to describe why you use virtual desktops with a direct keystroke for each desktop O(1) rather than one desktop and alt-tab to change windows O(n). -- Spencer /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
mediawiki - Collections Extension
Pluggers: Anybody out there good with mediawiki? specifically Collection Extension? I can create the book but I can't get the book to print the pdf. I'm using pediapress as the mw-serve ($wgCollectionMWServeURL = "http://tools.pediapress.com/ms-serve/";), but it gives long incomprehensible error message when I go to create the pdf. If you've gotten this to work, or know how to get this to work, let me know. I'm authorized to give $ for help. Merrill /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
mediawiki - Collection Extension
Uphpers: Anybody out there good with mediawiki? specifically Collection Extension? I can create the book but I can't get the book to print the pdf. I'm using pediapress as the mw-serve ($wgCollectionMWServeURL = "http://tools.pediapress.com/ms-serve/";), but it gives long incomprehensible error message when I go to create the pdf. If you've gotten this to work, or know how to get this to work, let me know. I'm authorized to give $ for help. Merrill /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
Best cartoon ever.
I think this one speaks for itself. Caution: Avoid hot drinks before clicking. http://www.sltrib.com/sltrib/opinion/51811692-82/bagley-cartoon-lake-salt.html.csp Thoughts? /* PLUG: http://plug.org, #utah on irc.freenode.net Unsubscribe: http://plug.org/mailman/options/plug Don't fear the penguin. */
