Asano et al. [JoCG 2011] proposed an open problem of computing the minimum enclosing circle of a set of n points in R2 given in a read-only array in sub-quadratic time. We show that Megiddo’s prune and search algorithm for computing the minimum radius circle enclosing the given points can be tailored to work in a read-only environment in O(n1+ ) time using O(logn) extra space, where is a positi...

Nondestructive evaluation of materials, the science of identifying the physical and mechanical properties of materials without altering their end-use capabilities, is valuable in defining relationships between properties and performance of materials. Nondestructive evaluation techniques using these relationships have current industrial applications. They are used for machine stress rating of lu...

Huuman codes, combined with word-based models, are considered eecient compression schemes for full-text retrieval systems. The decoding rate for these schemes can be substantially improved if the maximum length of the codewords is not greater then the machine word size L. However, if the vocabulary is large, simple methods for generating optimal length-restricted codes are either too slow or re...

Until recently, it was not known whether it was possible to sort stably (i.e., keeping equal elements in their initial order) an array of n elements using only O(n) data moves and O(1) extra space. In [13] an algorithm was given to perform this task in O(n2) comparisons in the worst case. Here, we develop a new algorithm for the problem that performs only O(n1+ε) comparisons (0 < ε ≤ 1 is any f...

We introduce two CHR compiler optimizations aimed at reducing garbage creation by reusing suspension terms, used to represent the CHR constraints. We have implemented both optimizations in the K.U.Leuven CHR system. The optimizations dramatically improve the memory footprint and speed of CHR programs: in several benchmarks we have measured speedups of 40% and more, and a reduction of memory usa...

Family caregivers often are key to aging-in-place. They not only help with everyday activities and needs, but also tend to be a valuable part of the senior’s social network. Many family carers however experience a hard time combining care activities with their busy job and family life. At the same time, they indicate they feel insufficiently aware of the actual situation and needs of the senior...

In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, using constant additional space; we then show how to build the LCP array directly in compressed representation using Elias ...

The Break-Off method is the most recent development in in-place concrete strength testing. In this method, the force required to break-off an in-place concrete cylinder 2.17 in. (55 mm) in diameter and 2-2/4 in. (70 mm) long, is related to the compressive strength of the concrete from a predetermined calibration curve developed for this concrete mix. The reliability of the BreakOff method to te...

This paper describes a standalone, publicly-available implementation of the Resolution of Anaphora Procedure (RAP) given by Lappin and Leass (1994). The RAP algorithm resolves third person pronouns, lexical anaphors, and identifies pleonastic pronouns. Our implementation, JavaRAP, fills a current need in anaphora resolution research by providing a reference implementation that can be benchmarke...

A three dimensional (3D) chip stack featuring a 4096-bit wide I/O demonstrator incorporates an in-place waveform capturer on an intermediate interposer within the stack. The capturer includes probing channels on paths of signaling as well as in power delivery and collects analog waveforms for diagnosing circuits within 3D integration. The collection of in-place waveforms on vertical channels wi...