Pickup usability dominates: a brief history of mobile text entry research and adoption

Text entry on mobile devices (e.g. phones and PDAs) has been a research challenge since devices shrank below laptop size: mobile devices are simply too small to have a traditional full-size keyboard. There has been a profusion of research into text entry techniques for smaller keyboards and touch screens: some of which have become mainstream, while others have not lived up to early expectations. As the mobile phone industry moves to mainstream touch screen interaction we will review the range of input techniques for mobiles, together with evaluations that have taken place to assess their validity: from theoretical modelling through to formal usability experiments. We also report initial results on iPhone text entry speed

Evaluation of Kermeta for Solving Graph-based Problems

Kermeta is a meta-language for specifying the structure and behavior of graphs of interconnected objects called models. In this paper,\ud we show that Kermeta is relatively suitable for solving three graph-based\ud problems. First, Kermeta allows the specification of generic model\ud transformations such as refactorings that we apply to different metamodels\ud including Ecore, Java, and Uml. Second, we demonstrate the extensibility\ud of Kermeta to the formal language Alloy using an inter-language model\ud transformation. Kermeta uses Alloy to generate recommendations for\ud completing partially specified models. Third, we show that the Kermeta\ud compiler achieves better execution time and memory performance compared\ud to similar graph-based approaches using a common case study. The\ud three solutions proposed for those graph-based problems and their\ud evaluation with Kermeta according to the criteria of genericity,\ud extensibility, and performance are the main contribution of the paper.\ud Another contribution is the comparison of these solutions with those\ud proposed by other graph-based tools

Modelling and Analysis Using GROOVE

In this paper we present case studies that describe how the graph transformation tool GROOVE has been used to model problems from a wide variety of domains. These case studies highlight the wide applicability of GROOVE in particular, and of graph transformation in general. They also give concrete templates for using GROOVE in practice. Furthermore, we use the case studies to analyse the main strong and weak points of GROOVE

Validation in the Software Metric Development Process

In this paper the validation of software metrics will be examined. Two approaches will be combined: representational measurement theory and a validation network scheme. The development process of a software metric will be described, together with validities for the three phases of the metric development process. Representation axioms from measurement theory are used both for the formal and empirical validation. The differentiation of validities according to these phases unifies several validation approaches found in the software metric's literature

Anticipation as prediction in the predication of data types

Every object in existence has its type. Every subject in language has its predicate. Every intension in logic has its extension. Each therefore has two levels but with the fundamental problem of the relationship between the two. The formalism of set theory cannot guarantee the two are co-extensive. That has to be imposed by the axiom of extensibility, which is inadequate for types as shown by Bertrand Russell's rami ed type theory, for language as by Henri Poincar e's impredication and for intension unless satisfying Port Royal's de nitive concept. An anticipatory system is usually de ned to contain its own future state. What is its type? What is its predicate? What is its extension? Set theory can well represent formally the weak anticipatory system, that is in a model of itself. However we have previously shown that the metaphysics of process category theory is needed to represent strong anticipation. Time belongs to extension not intension. The apparent prediction of strong anticipation is really in the structure of its predication. The typing of anticipation arises from a combination of and | respectively (co) multiplication of the (co)monad induced by adjointness of the system's own process. As a property of cartesian closed categories this predication has signi cance for all typing in general systems theory including even in the de nition of time itself

Investigating five key predictive text entry with combined distance and keystroke modelling

This paper investigates text entry on mobile devices using only five-keys. Primarily to support text entry on smaller devices than mobile phones, this method can also be used to maximise screen space on mobile phones. Reported combined Fitt's law and keystroke modelling predicts similar performance with bigram prediction using a five-key keypad as is currently achieved on standard mobile phones using unigram prediction. User studies reported here show similar user performance on five-key pads as found elsewhere for novice nine-key pad users