PEGs are a formal grammar foundation for describing syntax, and are not hard to generate parsers with a plain recursive decent parsing. However, the large amount of C-stack consumption in the recursive parsing is not acceptable especially in resource-restricted embedded systems. Alternatively, we have attempted the machine virtualization approach to PEG-based parsing. MiniNez, our implemented v...

Non-rigid-body behaviour can have a considerable effect on the overall accuracy performance of machine tools. These errors originate from bending of the machine structure due to change in distribution of its own weight or from movement of the workpiece and fixture. These effects should be reduced by good mechanical design, but residual errors can still be problematic due to realistic material a...

Non-rigid-body behaviour can have a considerable effect on the overall accuracy performance of machine tools. These errors originate from bending of the machine structure due to change in distribution of its own weight or from movement of the workpiece and fixture. These effects should be reduced by good mechanical design, but residual errors can still be problematic due to realistic material a...

Statistical Machine Translation (SMT) is an approach to automatic text translation based on the use of statistical models and examples of translations. Although Machine Translation (MT) systems developed according to other paradigms are still in use, mainly rule-based or example-based MT, SMT dominates academic MT research and has gained significant commercial interest over the last two decades...

In this study, a tabu search (TS) approach to the single machine total weighted tardiness problem (SMTWT) is presented. The problem consists of a set of independent jobs with distinct processing times, weights and due dates to be scheduled on a single machine to minimize total weighted tardiness. The theoretical foundation of single machine scheduling with due date related objectives reveal tha...

We derive an abstract machine that corresponds to a definitional interpreter for the control operators shift and reset. Based on this abstract machine, we construct a syntactic theory of delimited continuations. Both the derivation and the construction scale to the family of control operators shiftn and resetn. The definitional interpreter for shiftn and resetn has n + 1 layers of continuations...

Much of contemporary research in Artificial Immune Systems (AIS) has partitioned into either algorithmic machine learning and optimisation, or modelling biologically plausible dynamical systems, with little overlap between. Although the balance is latterly beginning to be redressed (e.g. [18]), we propose that this dichotomy is somewhat to blame for the lack of significant advancement of the fi...

Intelligent nanomechanical devices that operate in an autonomous fashion are of great theoretical and practical interest. Recent successes in building large scale DNA nano-structures, in constructing DNA mechanical devices, and in DNA computing provide a solid foundation for the next step forward: designing autonomous DNA mechanical devices capable of arbitrarily complex behavior. One prototype...

The problem of maximizing the weighted number of just-in-time jobs in a two-machine ‡ow shop scheduling system is known to be NP-hard [4]. However, the question of whether this problem is strongly or ordinary NP-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is NP-hard in the ordinary sense. Moreover, we show how the pseudo-po...

Four lemmas, which constitute the theoretical foundation necessary to determine optimal control strategies for a class of single machine family scheduling problems, are presented in this technical report. The scheduling problem is characterized by the presence of sequence-dependent batch setup and controllable processing times; moreover, the generalized due-date model is adopted in the problem....