This report argues that formal methods need to be properly integrated into an architectural design method if they are to be successfully transferred into industrial practice. It outlines a number of issues which need to be considered when performing such integration, and illustrates these points by reference to the formal techniques for complex high-integrity real-time systems being developed i...

In a recent article [1], random coding error exponents and expurgated exponents were analyzed for the generalized likelihood decoder (GLD), where the decoded message is randomly selected under a probability distribution that is proportional to a general exponential function of the empirical joint distribution of the codeword and the channel output vectors. In Section V of [1], Theorem 2 provide...

We present an explicit method to evaluate the nonnegativity of order 3 Matrix exponential functions.

One of the earliest and best-known application of the probabilistic method is the proof of existence of a 2 logn-Ramsey graph, i.e., a graph with n nodes that contains no clique or independent set of size 2 logn. The explicit construction of such a graph is a major open problem. We show that a reasonable hardness assumption implies that in polynomial time one can construct a list containing pol...

Block graphs are graphs in which every block (biconnected component) is a clique. A graph G = (V,E) is said to be an (unpartitioned) probe block graph if there exists an independent set N ⊆ V and some set E′ ⊆ (N 2 ) such that the graph G′ = (V,E∪E′) is a block graph; if an independent set N is given, G is called a partitioned block graph. In this note we give good characterizations for probe b...

In this paper, we present a novel method for editing stylistic human motions. We represent styles as differences between stylistic motions and introduced neutral motions, including timing differences and spatial differences. Timing differences are defined as time alignment curves, while spatial differences are found by a machine learning technique: Independent Feature Subspaces Analysis, which ...

The Independent Set problem is NP-hard in general, however polynomial time algorithms exist for the problem on various specific graph classes. Over the last couple of decades there has been a long sequence of papers exploring the boundary between the NPhard and polynomial time solvable cases. In particular the complexity of Independent Set on P5-free graphs has received significant attention, a...

Partial methods play an important role in formal methods and beyond. Recently such methods were developed for parity games, where polynomial-time partial solvers decide the winners of a subset of nodes. We investigate here how effective polynomial-time partial solvers can be by studying interactions of partial solvers based on generic composition patterns that preserve polynomial-time computabi...

We have previously shown that classification of single-trial electroencephalographic (EEG) recordings is improved by the use of either a niultichannel classifier or the best independent component over a single channel classifier. In this paper, we introduce a classifier that makes explicit use of multiple independent components. Two models are compared. The first ("direct") model uses independe...