"Research programmes, even ones as successful as Newton's, eventually degenerate. A programme "is degenerating if … (1) it does not lead to stunning new predictions (at least occasionally…); (2) if all its bold predictions are falsified; and (3) if it does not grow in steps which follow the spirit of the programme." (ibid, p. 106) (This last seems to mean avoiding the ad hoc additions mentioned above. But I think there's also a less pin-down-able sense. It would not be in the spirit of an agile method to extend itself by adding more and more examples of written process documentation.)"

"We’ve open sourced Tickery in order to show other developers the insides of a non-trivial application that uses FluidDB. Tickery was written over a three month period (November 2009 to January 2010), and much of it was done at a fairly fast pace. While the code could be cleaner and better documented, it’s not bad. We’re of course interested to help people understand the code, so please feel free to join the FluidDB users mailing list, or join us in #fluiddb on irc.freenode.net. Naturally we’ll be happy and interested to receive improvements or patches, and you can of course run your own instance of Tickery."

"Many techniques have been proposed to speedup the performance of classic Hough Transform. These techniques are primarily based on converting the voting procedure to a hierarchy based voting method. These methods use approximate decision-making process. In this paper, we propose a fast decision making process that enhances the speed and reduces the space requirements. Experimental results demonstrate that the proposed algorithm is much faster than a similar Fast Hough Transform."

"The well known algorithm of VOLKER STRASSEN for matrix multiplication can only be used for $(m2^k \times m2^k)$ matrices. For arbitrary $(n \times n)$ matrices one has to add zero rows and columns to the given matrices to use STRASSEN's algorithm. … The aim of this work is to give a detailed analysis of the number of additional zero rows and columns and the additional work caused by STRASSEN's bad parameters. STRASSEN used the parameters $m$ and $k$ to show that his matrix multiplication algorithm needs less than $4.7n^{\log_2 7}$ flops. We can show in this paper, that these parameters cause an additional work of approx. 20 % in the worst case in comparison to the optimal strategy for the worst case. This is the main reason for the search for better parameters."

"We show that there is a straightforward algorithm to determine if the polyhedron guaranteed to exist by Alexandrov's gluing theorem is a degenerate flat polyhedron, and to reconstruct it from the gluing instructions. The algorithm runs in O(n^3) time for polygons of n vertices."

"Environment for DeveLoping KDD-Applications Supported by Index-Structures (ELKI) is a Knowledge Discovery in Databases (KDD, "data mining") software framework developed for use in research and teaching by the database systems research unit of Professor Hans-Peter Kriegel at the Ludwig Maximilian University of Munich, Germany. It aims at allowing the development and evaluation of advanced data mining algorithms and their interaction with database index structures."

"At a minimum, this is clearly a company utterly lacking in the sense of urgency that this disaster warrants. And as McCallister contends, it is probably by design."

"The definition of "onshore" changes when you are a regulator captured by the industry you are supposed to monitor…"

"Anne Lukeman's "22 frames that always work" transmutes the Wally Wood comic classic, 22 panels that always work," into a film-making equivalent."

"…I’ve invited readers to comment and offer suggestions to improve the translation. My goal is to communicate Plato in English the way readers of his would have interpreted his Greek, aiming to capture his range of styles (colloquial conversation on the street, philosophical debate, rhetorical displays, poetic analysis, and so on) in a contemporary idiom. The nature of the project requires a wide readership for its success, so I hope you will pass this along."