We consider a class of `0-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including lp-induced quasi-norm (0 < p < 1), maximal scaled spark and scaled mutual coherence, to develop several new uniqueness conditions for the partial sparsest solution to this class of `0-minim...

We propose a decentralized method to perform mutual localization in multi-robot systems using anonymous relative measurements, i.e., measurements that do not include the identity of the measured robot. This is a challenging and practically relevant operating scenario that has received little attention in the literature. Our mutual localization algorithm includes two main components: a probabili...

We show how program transformation techniques can be used for the verification of both safety and liveness properties of reactive systems. In particular, we show how the program transformation technique distillation can be used to transform reactive systems specified in a functional language into a simplified form that can subsequently be analysed to verify temporal properties of the systems. E...

We consider a class of l0-minimization problems, which is to search for the partial sparsest solution to an underdetermined linear system with additional constraints. We introduce several concepts, including lp-induced norm (0 < p < 1), maximal scaled spark and scaled mutual coherence, to develop several new uniqueness conditions for the partial sparsest solution to this class of l0-minimizatio...

The semantics of assignment and mutual exclusion in concurrent and multi-core/multi-processor systems is presented with attention to low level architectural features in an attempt to make the presentation realistic. Recursive functions on event sequences are used to define state dependent functions and variables in ordinary (non-formal-method) algebra.

Klami, A. (2008): Modeling of mutual dependencies. Doctoral thesis, Helsinki University of Technology, Dissertations in Information and Computer Science, TKK-ICS-D6, Espoo, Finland.

To obtain the optimal number of communities is an important problem in detecting community structure. In this paper, we extend the measurement of community detecting algorithms to find the optimal community number. Based on the normalized mutual information index, which has been used as a measure for similarity of communities, a statistic Ω(c) is proposed to detect the optimal number of communi...

”THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD” By combining a bound on the absolute value of the difference of mutual information between two joint probability distributions with a fixed variational distance, and a bound on the probability of a maximal deviation in variational distance between a true joint probability distribution and an empirical joint probability distribution, confidenc...

Purpose of the study The relationship between mutual fund performance and fund flows has been studied widely, but less attention has been given towards mutual fund launches and their success. For services the company itself plays as the brand, and thus product launch can be viewed as brand line extension. This paper investigates the importance of brand performance, company track record, on the ...