We show how it is possible to generate multivariate data which have moments arbitrary close to the desired ones. They are generated as linear combinations of variables with known theoretical moments. It is shown how to derive the weights of the linear combinations in both the univariate and the multivariate setting. The use in bootstrapping is discussed and examplified with an Monte Carlo simul...

In this paper, we extend a previously introduced method for the generation of vocal tract length invariant (VTLI) features. The novelty is a reduction of the number of obtained invariances to the more desired ones, which results in a significant improvement of recognition rates. In experiments on the TIMIT database, the enhanced discrimination capabilities and robustness to mismatches between t...

This paper presents a bio-inspired networking strategy to support the cooperation between static sensors on the ground and mobile sensors in the air to perform surveillance missions in large areas. The goal of the proposal is to provide low overhead in the communication among sensor nodes, while allocating the mobile sensors to perform sensing activities requested by the static ones. Simulation...

Consensus is the desired result in many argumentative discourses such as negotiations, public debates, and goal-oriented forums. This paper presents a summary of the work dedicated to investigating of discourse structure in order to determine rhetorical structures that lead to consensus. In addition we investigated language patterns extracted from the data collection in order to discover which ...

This report defines the rank complement of a diagonalizable matrix (i.e. a matrix which can be brought to a diagonal form by means of a change of basis) as the interchange of the range and the null space. Given a diagonalizable matrix A there is in general no unique matrix Ac which has a range equal to the null space of A and a null space equal to the range of A, only matrices of full rank have...

ing this paper new factorization techniques for computation of the Operational Space Mass Matrix (A) and its inverse (A-l) are developed. Starting with a new factorization of the inverse of mass matrix (M-l) in the form of Schur Complement as M-l = G’ %)TsI-lB, where d and 8 are block tridlagonal matrices and G is a tridiagonal matrix, similar factorization for A and A-i are derived. Specifical...

Given a 3-manifold M , there are generically infinitely many manifold which covers M . However, if we are restricted to the category of knot complements, the situation is quite different. It can be shown (see Lemma 1 and bellow) that if the complement E(K) of a knot K is n-fold covered by some knot complement, then the covering is cyclic, and K admits a cyclic surgery, i.e. a Dehn surgery such ...