When applied to probabilistic categorial grammar learning, the Minimum Description Length principle outperforms Maximum Likelihood Estimation. Smoothing does not bridge the gap between the two approaches.

Automata representing game-semantic models of programs are meant to operate in environments whose input-output behaviour is constrained by the rules of a game. This can lead to a notion of equivalence between states which is weaker than the conventional notion of bisimulation, since not all actions are available to the environment. An environment which attempts to break the rules of the game is...

a r t i c l e i n f o At present, there are insufficient design decision making tools to support effective construction waste minimisation evaluation and implementation throughout all design stages. A limited but growing body of recent literature suggests that building information modelling has the potential to assist architects to minimise design waste on their projects. The research reported ...

We discuss known results (c.f. [16, 6]) about stability of `1 minimisation (denoted ∆1) with respect to the measurement error and how those results depend on the measurement matrix Φ. Then we produce a large class of measurement matrices Φ for which we can apply results from [16] so we have estimate ‖∆1(Φ(x) + r)− x‖2 ≤ C(‖r‖2 + k−1/2σ1 k(x)). (1) We conclude with a modification of `1 minimisat...

In the cutting stock pattern minimisation problem, we wish to satisfy demand for various customer reels by cutting as few as possible jumbo reels, and further to minimise the number of distinct cutting patterns used. We focus on the special case in which any two customer reels t into a jumbo, but no three do: this case is of interest partly because it is the simplest case that is not trivial, a...

We study a variational problem whose critical point determines the Reeb vector field for a Sasaki–Einstein manifold. This extends our previous work on Sasakian geometry by lifting the condition that the manifolds are toric. We show that the Einstein–Hilbert action, restricted to a space of Sasakian metrics on a link L in a Calabi–Yau cone X, is the volume functional, which in fact is a function...

Carrier phase positioning is a reliable approach that offers better accuracies than pseudorange-based positioning. It relies on carrier phase measurements that originate from the carrier tracking loop. The performance of this loop dictates the quality of the phase measurements and consequently the quality of the final positioning solution. Carrier phase jitter, which is the metric of carrier lo...

The M-tree is a paged, dynamically balanced metric access method that responds gracefully to the insertion of new objects. Like many spatial access methods, the M-tree’s performance is largely dependent on the degree of overlap between spatial regions represented by nodes in the tree, and minimisation of overlap is key to many of the design features of the M-tree and related structures. We pres...