Bloody hell. I had pasted some graphs and other stuff from Minitab into an open office document and saved it as a word document and sent it to myself at work so I could print it. The graphs didn't make it. Bastards. Fortunately, it was just some scatterplots that I can do in Excel. Speaking of Minitab, it turns out a 6-month license for students is like $30. Might be worthwhile to save me the inconvenience of going to the school computer lab some evenings, but, then, on the other hand, graphs don't survive transition... Of course, we also really do need a printer/scanner combo. We'll discuss this at a budget meeting.
Mmm, budget. YNAB 3 really is some pretty sweet stuff.
Zappa: before I was interrupted by an encounter with somebody on a train, I was listening to Zappa's Hot Rats. Peaches en Regalia, man. Dude.
I keep forgetting to buy new toothpaste. Accordingly, I will purchase new toothpaste at lunch. While at the drug store, I might as well get a quart of milk.
Today's 70's big article was about nutrition for women who want to train for strength. I think he should've taken the chance to emphasize that women need a lot of calcium.
Silly me. I was trying to come up with this complex way of trawling through this hierarchy thing and it's quite simple. Suppose you have a well-defined org chart and every person on the org chart has a state, let's say it's a letter from A to G. Everybody reports to somebody who has a letter earlier or equal to it in the alphabet. So a C can report to an A, B, or C, but cannot report to a D, E, F, or G. Now, suppose you wanted to know the highest level B in each person's reporting chain, and if there are no Bs, the lowest level A. Everybody has an A somewhere, since it's a well-defined org chart and the top of it is an A. The highest-level B thing is easy, but I was doing the lowest-A part in a stupid way. Well, okay, there's a very easy way of doing it, but the way the list comes out in Excel, the easy way doesn't work - it's easy to find the first occurrence of something, but not the last. I was thinking, "Find the first A, go to the next person in the line, if it's an A, continue down...". Which gets ugly to write. Correct answer: "Find the first non-A in the chain, then go up one." Writing this paragraph probably took more time than thinking about the problem in the first place.
It's been a while since I've done math.
|< Pictures | I feel sorry for you furriners that don't have the best health care in the world >|