Modelling user experience with web sites: Usability, hedonic value, beauty and goodness

Recent research into user experience has identified the need for a theoretical model to build cumulative knowledge in research addressing how the overall quality or ‘goodness’ of an interactive product is formed. An experiment tested and extended Hassenzahl’s model of aesthetic experience. The study used a 2 × 2 × (2) experimental design with three factors: principles of screen design, principles for organizing information on a web page and experience of using a web site. Dependent variables included hedonic perceptions and evaluations of a web site as well as measures of task performance, navigation behaviour and mental effort. Measures, except Beauty, were sensitive to manipulation of web design. Beauty was influenced by hedonic attributes (identification and stimulation), but Goodness by both hedonic and pragmatic (user-perceived usability) attributes as well as task performance and mental effort. Hedonic quality was more stable with experience of web-site use than pragmatic quality and Beauty was more stable than Goodness.     

A survey on the history of transaction management: from flat to grid transactions

Transactions have been around since the Seventies to provide reliable information processing in automated information systems. Originally developed for simple ‘debit-credit’ style database operations in centralized systems, they have moved into much more complex application domains including aspects like distribution, process-orientation and loose coupling. The amount of published research work on transactions is huge and a number of overview papers and books already exist. A concise historic analysis providing an overview of the various phases of development of transaction models and mechanisms in the context of growing complexity of application domains is still missing, however. To fill this gap, this paper presents a historic overview of transaction models organized in several ‘transaction management eras’, thereby investigating numerous transaction models ranging from the classical flat transactions, via advanced and workflow transactions to the Web Services and Grid transaction models. The key concepts and techniques with respect to transaction management are investigated. Placing well-known research efforts in historical perspective reveals specific trends and developments in the area of transaction management. As such, this paper provides a comprehensive, structured overview of developments in the area.     

On Aperiodic and Star-Free Formal Power Series in Partially Commuting Variables

Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the concepts of aperiodic and of star-free formal power series over semirings and partially commuting variables. We prove that if the semiring K is idempotent and commutative, or if K is idempotent and the variables are non-commuting, then the product of any two aperiodic series is again aperiodic. We also show that if K is idempotent and the matrix monoids over K have a Burnside property (satisfied, e.g. by the tropical semiring), then the aperiodic and the star-free series coincide. This generalizes a classical result of Schützenberger (Inf. Control 4:245–270, 1961) for aperiodic regular languages and subsumes a result of Guaiana et al. (Theor. Comput. Sci. 97:301–311, 1992) on aperiodic trace languages. This work partly supported by the DAAD-PROCOPE project Temporal and Quantitative Analysis of Distributed Systems.     

A stability-based distributed routing mechanism to support unicast and multicast routing in ad hoc wireless network

An ad hoc network can be envisioned as a collection of mobile routers, each equipped with a wireless transceiver, which are free to move about arbitrarily. In ad hoc wireless networks, even if two nodes are outside the wireless transmission range of each other, they may still be able to communicate in multiple hops using other intermediate nodes. However, the dynamics of these networks, as a consequence of mobility and disconnection of mobile hosts, pose a number of problems in designing routing schemes for effective communication between any pair of source and destination. In this paper, a stability-based unicast routing mechanism, that considers both link affinity and path stability in order to find out a stable route from source to destination, is proposed. It is then extended to support multicast routing as well where only local state information (at source) is utilized for constructing a multicast tree. The performance of the proposed scheme is evaluated on a simulated environment to show that the stability-based scheme provides a unified framework for both unicast and multicast routing and reduces the probability of route error drastically in both the cases.     

Robust Estimation of GARMA Model Parameters with an Application to Cointegration among Interest Rates of Industrialized Countries

We review the literature on long memory ARFIMA and GARMA models andintroduce a new efficient estimator for GARMA models, which we show to berobust. Next we conduct a Monte Carlo study to demonstate the power of theDickie–Fuller test when the data are generated from a stationary GARMAprocess. We conclude with a brief discussion of cointegration in the contextof GARMA models with an application to international interest rates.     

Facet Grammars: Towards static semantic analysis by context-free parsing

Use of executable declarative metalanguages has simplified programming language syntax specification and implementation, whereas existing formalisms for static semantics are still relatively procedural. A working hypothesis is that the context-sensitivity of languages (under static semantic rules) is derived in significant part from the interleaved presences therein of sentences in implicitly-defined and effectively invisible context-free languages. Procedures by which these sentences and context-free grammars for their languages can be respectively derived from the original sentence and the combination of the original language's grammar and semantic rules, lead to the possibility of automatic generation of static semantic analysers from the purely context-free specifications of “Facet Grammars” (FG)!

We show that the utility of FG for static semantic analysis has a non-trivial lower bound, by specifying the relatively complicated identifier scope and accessibility rules for Dijkstra's Guarded Commands Language.     

A case study in SQA audits

Software quality assurance (SQA) audits are becoming a standard practice in corporations seeking to enter contractual relations with other organizations, or just evaluating their own state of readiness. This paper describes one approach to conducting SQA audits. Excerpts from reports of actual audits conducted on several organizations engaged in software development are used to show how an audit is conducted and what can be achieved through the auditing process. The paper is not meant to be a definitive answer or guide to doing SQA audits. Rather, it serves as an annotated case study of how SQA audits can be conducted with an emphasis on data gathering and reporting.Dr Paul W. Oman is an associate professor of computer science at the University of Idaho, and an independent software consultant who specializes in software analysis. He is the director of the Software Engineering Test Lab within the UI College of Engineering, where he conducts research in software development methods, CASE tools, and software maintainability issues. Oman has published over 50 articles and reports on software tools, software development, and computer science education. He has a PhD in computer science and is a member of the IEEE, IEEE Computer Society, and ACM.     

Deriving correctness properties of compiled code

When developing safety-critical software, it is the correctness of the object code that is paramount. However, it is desirable to perform formal verification on the source program. To ensure that correctness results proved about the source program do apply to the object code, the compiler used can be formally verified. However, care must be taken to ensure that the compiler correctness theorem proved is suitable. We have combined a derived programming logic with a verified compiler for a generic subset of the Vista structured assembly language. We show how correctness properties of object code can be formally derived from corresponding correctness properties of the source program which have been proved using the programming logic. Thus we can be sure the results do apply to the object code. The work described has been performed using the HOL system and so is machine-checked.     

Electronic `how things work' articles: two early prototypes

The electronic encyclopedia exploratorium (E³) is a vision of a future computer system-an electronic book describing how thing work. Typical articles in E³ will describe such mechanisms as compression refrigerators, engines, telescopes, and mechanical linkages. Each article will provide simulations, three-dimensional animated graphics that the user can manipulate, laboratory areas that allow a user to modify the device or experiment with related artifacts, and a facility for asking questions and receiving customized, computer-generated English-language explanations. Some of the foundational technology is discussed, focusing on topics in artificial intelligence, graphics, and user interfaces. The initial prototype system and the technical lessons learned from it, as well as the second prototype currently under construction, are described