Abstract
Motivated by the need to formalize generation of fast running code for linear algebra applications, we show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the kernel operation of matrix algebra, ranging from its divide-and-conquer version to the conventional, iterative one. From errant attempts to learn how particular products and coproducts emerge from biproducts, we not only rediscovered block-wise matrix combinators but also found a way of addressing other operations calculationally such as e.g. Gaussian elimination. A strategy for addressing vectorization along the same lines is also given.

Abstract
We consider integer-valued autoregressive models of order one contaminated with innovational outliers. Assuming that the time points of the outliers are known but their sizes are unknown, we prove that Conditional Least Squares (CLS) estimators of the offspring and innovation means are strongly consistent. In contrast, CLS estimators of the outliers' sizes are not strongly consistent. We also prove that the joint CLS estimator of the offspring and innovation means is asymptotically normal. Conditionally on the values of the process at time points preceding the outliers' occurrences, the joint CLS estimator of the sizes of the outliers is asymptotically normal.

Abstract
Recently Tracy and Chen presented a parametric DEA model (PDEA) to assess relative efficiency in the presence of a generalized form of linear weight restrictions. This paper proposes a modification to the PDEA model that avoids the need to resort to searching algorithms to estimate efficiency, and assures that the correct efficiency scores are obtained in a single stage using mathematical programming solvers. The results of this model and the results of Tracy and Chen's PDEA model are compared using the examples reported in their paper. The results confirm the superiority of the model proposed in this paper. Journal of the Operational Research Society (2010) 61, 1789-1793. doi:10.1057/jors.2009.140 Published online 16 December 2009

Abstract
Nowadays one can witness the increase of the world population carrying some kind of physical disability, affecting locomotion. With the objective of responding to numerous mobility problems, various intelligent wheelchair related projects have been created in the last years. The development of an intelligent Wheelchair requires a lot of testing due to the complexity of the algorithms used and the obligation of achieving a failproof final product. This paper describes the some need for an Intelligent-Wheelchair specific simulator as well as the requirements of such a simulator. The simulator implementation, based on "Ciber-Mouse" simulator, is also described with emphasis on analyzing the limitations concerning intelligent wheelchair simulation using this adapted simulator. The changes applied on the existing software and the difficulties of robotic simulation development are described in detail. Experimental results are also presented showing that not only the simulator reveals flexible simulation capabilities but, also, enabled to validate the algorithms implemented in the physical intelligent wheelchair controlling agent.

Abstract
(Non-)portability of Prolog programs is widely considered as an important factor in the lack of acceptance of the language. Since 1995, the core of the language is covered by the ISO standard 13211-1. Since 2007, YAP and SWI-Prolog have established a basic compatibility framework. This article describes and evaluates this framework. The aim of the framework is running the same code on both systems rather than migrating an application. We show that today, the portability within the family of Edinburgh/Quintus derived Prolog implementations is good enough to allow for maintaining portable real-world applications.

Abstract