We enumerate and classify all stationary logarithmic configurations of d + 2 d+2 </inline-formu...

This editor’s note gives an overview of the content this issue which is sponsored by Oregon Sea Grant.

This paper describes a new variant of the least-mean-squares (LMS) algorithm, with low computational complexity, for updating an adaptive lter. The reduction in complexity is obtained by using values of the input data and the output error, quantized to the nearest power of two, to compute the gradient. This eliminates the need for multipliers or shifters in the algorithm's update section. The q...

While the problem of determining whether an embedding a graph G in $${\mathbb {R}}^2$$ is infinitesimally rigid well understood, specifying given or not still hard task that usually requires ad hoc arguments. In this paper, we show every (not necessarily generic) dense enough (concretely, with at least $$C_0n^{3/2}(\log n)^{\beta }$$ edges, for some absolute constants $$C_0>0$$ and $$\beta $$ )...

In many domains, the log files generated by digital systems contain important information on the conditions and configurations of systems. Information Extraction from these log files is an essential phase in information systems, which manage the production line. In the case of Integrated Circuit designs, log files generated by design tools are not exhaustively exploited. Although these log file...

For a planar point set we consider the graph of crossing-free straight-line spanning trees where two spanning trees are adjacent in the graph if their union is crossing-free. An upper bound on the diameter of this graph implies an upper bound on the diameter of the flip graph of pseudo-triangulations of the underlying point set. We prove a lower bound of Ω ( log(n)/ log(log(n)) ) for the diamet...

Sheep from a Merino selection experiment at the Tygerhoek research farm in the Southern Cape provided material for this study. The selection lines involved included a line selected for clean fleece weight, a “Wet and Dry” line, a fine wool line and an unselected Control line. Rectal faeces samples were obtained from individual animals at 13 to 16 months of age, after drenching was withheld for ...

We consider the planar convex hull range query problem. Let P be a set of points in the plane. We preprocess these points into a data structure such that given an orthogonal range query, we can report the convex hull of the points in the range in O(log n + h) time, where h is the size of the output. The data structure uses O(n log n) space. This improves the previous bound of O(log n+h) time an...