Abstract

Abstract
As developers target a more diverse range of devices, a one-size-fits-all approach to interaction design becomes harder to sustain. By utilising the notion of interaction styles, developers can create families of user interfaces that are better matched to the interactive capabilities of devices. Style-Based Mark-up Language (SBML) is a language that separates services from style-specific interaction, and allows devices to choose the style of interface that best suits their capability and operating context. This paper outlines the service architecture and language syntax of SBML, using an online banking example. It also explores alternative single-interaction-style approaches and notions of context. Copyright © 2008 Inderscience Enterprises Ltd.

Abstract
Under the emerging network coding paradigm, intermediate nodes in the network are allowed not only to store and forward packets but also to process and mix different data flows. We propose a low-complexity cryptographic scheme that exploits the inherent security provided by random linear network coding and offers the advantage of reduced overhead in comparison to traditional end-to-end encryption of the entire data. Confidentiality is achieved by protecting (or "locking") the source coefficients required to decode the encoded data, without preventing intermediate nodes from running their standard network coding operations. Our scheme can be easily combined with existing techniques that counter active attacks.

Abstract
This paper presents a fast and straightforward method to assess displacement fields on the surface of a planar specimen with sub-pixel resolution. First, pixel level displacements are obtained by cross correlation (CC) of two consecutive images, used as the image similarity measure. Next, sub-pixel displacement information is calculated from the CC coefficients matrix using a similarity interpolation method. Finally, sub-pixel estimation error cancellation is performed. Several experiments were conducted to validate the proposed method effectiveness, applied to chestnuts compression test for quality control purposes.

Abstract
Tabled evaluation has been proved an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. Several "native" implementations of tabled evaluation have been developed which offer good performance, but many of them require significant changes to the underlying Prolog implementation, including the compiler and the abstract machine. Approaches based on program transformation, which tend to minimize changes to both the Prolog compiler and the abstract machine, have also been proposed, but they often result in lower efficiency. We explore some techniques aimed at combining the best of these worlds, i.e., developing an extensible implementation which requires minimal modifications to the compiler and the abstract machine, and with reasonably good performance. Our preliminary experiments indicate promising results.

Abstract