“Research pro­grammes, even ones as suc­cess­ful as Newton’s, even­tu­ally degen­er­ate. A pro­gramme “is degen­er­at­ing if … (1) it does not lead to stun­ning new pre­dic­tions (at least occa­sion­ally…); (2) if all its bold pre­dic­tions are fal­si­fied; and (3) if it does not grow in steps which fol­low the spirit of the pro­gramme.” (ibid, p. 106) (This last seems to mean avoid­ing the ad hoc addi­tions men­tioned 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 exam­ples of writ­ten process documentation.)”

“We’ve open sourced Tick­ery in order to show other devel­op­ers the insides of a non-​​trivial appli­ca­tion that uses Flu­idDB. Tick­ery was writ­ten over a three month period (Novem­ber 2009 to Jan­u­ary 2010), and much of it was done at a fairly fast pace. While the code could be cleaner and bet­ter doc­u­mented, it’s not bad. We’re of course inter­ested to help peo­ple under­stand the code, so please feel free to join the Flu­idDB users mail­ing list, or join us in #flu­iddb on irc​.freen​ode​.net. Nat­u­rally we’ll be happy and inter­ested to receive improve­ments or patches, and you can of course run your own instance of Tickery.”

“Many tech­niques have been pro­posed to speedup the per­for­mance of clas­sic Hough Trans­form. These tech­niques are pri­mar­ily based on con­vert­ing the vot­ing pro­ce­dure to a hier­ar­chy based vot­ing method. These meth­ods use approx­i­mate decision-​​making process. In this paper, we pro­pose a fast deci­sion mak­ing process that enhances the speed and reduces the space require­ments. Exper­i­men­tal results demon­strate that the pro­posed algo­rithm is much faster than a sim­i­lar Fast Hough Transform.”

“The well known algo­rithm of VOLKER STRASSEN for matrix mul­ti­pli­ca­tion can only be used for $(m2^k \times m2^k)$ matri­ces. For arbi­trary $(n \times n)$ matri­ces one has to add zero rows and columns to the given matri­ces to use STRASSEN’s algo­rithm. … The aim of this work is to give a detailed analy­sis of the num­ber of addi­tional zero rows and columns and the addi­tional work caused by STRASSEN’s bad para­me­ters. STRASSEN used the para­me­ters $m$ and $k$ to show that his matrix mul­ti­pli­ca­tion algo­rithm needs less than $4.7n^{\log_2 7}$ flops. We can show in this paper, that these para­me­ters cause an addi­tional work of approx. 20 % in the worst case in com­par­i­son to the opti­mal strat­egy for the worst case. This is the main rea­son for the search for bet­ter parameters.”

“We show that there is a straight­for­ward algo­rithm to deter­mine if the poly­he­dron guar­an­teed to exist by Alexandrov’s glu­ing the­o­rem is a degen­er­ate flat poly­he­dron, and to recon­struct it from the glu­ing instruc­tions. The algo­rithm runs in O(n^3) time for poly­gons of n vertices.”

“Envi­ron­ment for DeveL­op­ing KDD-​​Applications Sup­ported by Index-​​Structures (ELKI) is a Knowl­edge Dis­cov­ery in Data­bases (KDD, “data min­ing”) soft­ware frame­work devel­oped for use in research and teach­ing by the data­base sys­tems research unit of Pro­fes­sor Hans-​​Peter Kriegel at the Lud­wig Max­i­m­il­ian Uni­ver­sity of Munich, Ger­many. It aims at allow­ing the devel­op­ment and eval­u­a­tion of advanced data min­ing algo­rithms and their inter­ac­tion with data­base index structures.”

“At a min­i­mum, this is clearly a com­pany utterly lack­ing in the sense of urgency that this dis­as­ter war­rants. And as McCal­lis­ter con­tends, it is prob­a­bly by design.”

“The def­i­n­i­tion of “onshore” changes when you are a reg­u­la­tor cap­tured by the indus­try you are sup­posed to monitor…”

“Anne Lukeman’s “22 frames that always work” trans­mutes the Wally Wood comic clas­sic, 22 pan­els that always work,” into a film-​​making equivalent.”

“…I’ve invited read­ers to com­ment and offer sug­ges­tions to improve the trans­la­tion. My goal is to com­mu­ni­cate Plato in Eng­lish the way read­ers of his would have inter­preted his Greek, aim­ing to cap­ture his range of styles (col­lo­quial con­ver­sa­tion on the street, philo­soph­i­cal debate, rhetor­i­cal dis­plays, poetic analy­sis, and so on) in a con­tem­po­rary idiom. The nature of the project requires a wide read­er­ship for its suc­cess, so I hope you will pass this along.”