S ymbolic execution of string manipulation programs is challenging as the constraint solvers do not typically support logic over strings and non-string operations. KLEE[1] is a symbolic execution tool used to generate test cases with high coverage. It uses Simple Theorem Prover (STP) as its constraint solver. STP encodes constraints only as bit-vector logic and solves the constraints. It has no...

An examination of historical precedents for contemporary art practice using artificial life, in particular in the work of Paul Klee and Kasimir Malevich. Similarities are identified between artificial life and the philosophical tradition of organicism; specific examples from Klee and Malevich indicate that those artists were engaged in a form of creative organicist thought which imagined the re...

Each packing of R by translates of the unit cube [0, 1) admits a decomposition into at most two parts such that if a translate of the unit cube is covered by one of them, then it also belongs to such a part.

Employment or Leadership: None declared. Consultant or Advisory Role: A.S. Jaffe, Beckman Coulter, Critical Diagnostics, Inverness Medical, Radiometer, Pfizer, and Amgen. Stock Ownership: None declared. Honoraria: A.S. Jaffe, Roche and Abbott Laboratories. Research Funding: A.K. Saenger, Roche Diagnostics; G.G. Klee, Beckman Coulter; A.S. Jaffe, Beckman Coulter. Expert Testimony: None declared....

In a recent study of astrophysical “fine-tunings” (or “coincidences”), Robert Klee critically assesses the support that such astrophysical evidence might be thought to lend to the design argument (i.e., the argument that our universe has been designed by some deity). Klee argues that a proper assessment indicates that the universe is not as “fine-tuned” as advertised by proponents of the design...

By refining a variant of the Klee–Minty example that forces the central path to visit all the vertices of the Klee–Minty n-cube, we exhibit a nearly worst-case example for path-following interior point methods. Namely, while the theoretical iteration-complexity upper bound is O(2nn 5 2 ), we prove that solving this n-dimensional linear optimization problem requires at least 2n − 1 iterations.

Indicator vector analysis of a nucleotide sequence alignment generates a compact heat map, called a Klee diagram, with potential insight into clustering patterns in evolution. However, so far this approach has examined only mitochondrial cytochrome c oxidase I (COI) DNA barcode sequences. To further explore, we developed TreeParser, a freely-available web-based program that sorts a sequence ali...