The speed of convergence of the R-linear GMRES method is bounded in terms of a polynomial approximation problem on a finite subset of the spectrum. This result resembles the classical GMRES convergence estimate except that the matrix involved is assumed to be condiagonalizable. The bounds obtained are applicable to the CSYM method, in which case they are sharp. Then a three term recurrence for ...

A compact symbolic encoding is described for the transition relation of systems modeled with asynchronously executing, hierarchical UML state machines that communicate through message passing and attribute access. This enables the analysis of such systems by symbolic model checking techniques, such as BDD-based model checking and SATbased bounded model checking. Message reception, completion ev...

Locating objects with topology-independent identifiers has emerged as a key functionality in recent content networking approaches. Numerous designs have been proposed to address the obvious scalability and efficiency challenges such systems face in Internetscale deployments. These designs have often been based on implicit assumptions of full deployment and a homogeneous autonomous system struct...

This article describes a study of the defects in the programs students have written as solutions for the programming assignments in a concurrent programming course. I describe the underlying causes of these defects and the applications in developing teaching, grading and debugging of this information. I present the effects of the students’ approaches to constructing and testing programs on thei...

An efficient method for weakly supervised pattern discovery and recognition from discrete categorical sequences is introduced. The method utilizes two parallel sources of data: categorical sequences carrying some temporal or spatial information and a set of labeled, but not exactly aligned, contextual events related to the sequences. From these inputs the method builds associative models able t...

In this work, novel symbolic step encodings of the transition relation for object based communicating state machines are presented. This class of systems is tailored to capture the essential data manipulation features of UML state machines when enriched with a Java-like object oriented action language. The main contribution of the work is the generalization of the ∃-step semantics approach, whi...

Energy consumption caused by wireless transmission poses a big challenge to the battery lifetime of mobile devices. While the potential of using lossless compression for saving energy has been long acknowledged, no general solution has been proposed for applying lossless compression to energy adaptation for mobile services. We propose a proxy-based energy adaptation framework, in which the data...

We consider online bin packing where in addition to the opening cost of each bin, the arriving items collect delay costs until their assigned bins are released (closed), and the open bins themselves collect holding costs. Besides being of practical interest, this problem generalises several previously unrelated online optimisation problems. We provide a general online algorithm for this problem...