Actually, if you can find TN #31 in the Technical Notes Stack 3.1, you will have had to run into an actual dogcow (Clarus) saying !fooM. Gee, wonder where that might be? Yours truly found it, and it was not that hard. I must say that the choice of encryption algorithm was extremely clever, however. You will never get it from the script unless you are fluent in ebg13, so you might as well try to solve it the right way!

In this paper we propose a framework that combines the two ideas, and includes two improvements over previously published work on convex-concave programming, specifically the handling of domains of the functions, and the issue of nondifferentiability on the boundary of the domains.

Although sympathetic, my main reaction was to think: “Some people can handle it, and some people can’t,” and then smugly light up a big fat jay.

I was now an invited contributor to art shows in the East. Sympathetic criticisms were unnumbing me; I desired to paint again.