We present a new meshing algorithm for the plane, Overlay Stitch Meshing (OSM), accepting as input an arbitrary Planar Straight Line Graph and producing a triangulation with all angles smaller than 170◦. The output triangulation has competitive size with any optimal size mesh having equally bounded largest angle. The competitive ratio is O(log(L/s)) where L and s are respectively the largest an...

Input/output (I/O) operations can represent a significant proportion of the run-time when large scientific applications are run in parallel. Although there have been advances in the form of file-format libraries, file system design and I/O hardware, a growing divergence exists between the performance of parallel file systems and compute processing rates. In this paper we utilise RIOT, an input/...

This paper provides an analysis of a log detector in order to determine its response to a multi-tone input for detection of spurious emissions in a radio frequency transmitter. Treatment is given to the single tone response of the log detector and extended to a two-tone log detector system, where a large signal and a small signal are present. The large signal is observed to experience logarithm...

We describe an algorithm to find maximum-weight digitally convex regions in gray-scale images. After Christ et al. [CPS10] gave a system for consistent digital line systems, the question how to transfer the concept of convexity to digital regions naturally appeared. The regions computed using this definition are weight-maximal, the computational complexity of our algorithm amounts to O(n5 · log...

Imagine that you are tasked to help a project improve their testing effort. In a realistic scenario it will quickly become clear, that having an impact is difficult. First of all, it will likely be a challenge to suggest an alternative approach which is significantly more automated and/or more effective than current practice. The reality is that an average software system has a complex input/ou...

The Black-Scholes (1973) option pricing model provides the foundation for the modern theory of options valuation. In actual applications, however, the model has certain well-known deficiencies. For example, when calibrated to accurately price at-the-money options the Black-Scholes (1973) model often misprices deep in-the-money and deep out-of-themoney options. This model-anomalous behavior give...

In this paper we prove a tight log n lower bound on the product of strong space and input head reversals for any Turing machine (equipped with a read only input tape) accepting a nonregular language.

We present an algorithm for asymptotically efficient multiway blockwise in-place merging. Given an array A containing sorted subsequences A1, . . . , Ak of respective lengths n1, . . . , nk, where ∑k i=1 ni = n, we assume that extra k ·s elements (so called buffer elements) are positioned at the very end of array A, and that the lengths n1, . . . , nk are positive integer multiples of some para...

We investigate the coded model of fault-tolerant computations introduced by D. Spielman. In this model the input and the output of a computation circuit is treated as words in some error-correcting code. A circuit is said to compute some function correctly if for an input which is a encoded argument of the function, the output, been decoded, is the value of the function on the given argument. W...