In this paper, several experiments on F0 transformation within the voice conversion framework are presented. The conversion system is based on a probabilistic transformation of line spectral frequencies and residual prediction. Three probabilistic methods of instantaneous F0 transformation are described and compared. Moreover, a new modification of inter-speaker residual prediction is proposed ...

The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the ...

The all-pairs shortest paths (APSP) problem finds the shortest path distances between all pairs of vertices,and is one of the most fundamental graph problems. In this paper, a parallel recursive partitioning approach to APSP problem using Open Computing Language (OpenCL) for directed and dense graphs with no negative cyclesbased on R-Kleene algorithm, is presented, which recursively partitions ...

In this paper we investigate the herdability property, namely capability of a system to be driven towards (interior the) positive orthant, for linear time-invariant state space models. Herdability certain matrix pairs (A,B), where A is adjacency multi-agent network, and B selection that singles out subset agents (the “network leaders”), explored. The cases when graph associated with A, G(A), di...

Network exploration is an important research directionwithmany applications. In such a setting, the network is, usually, modeled as a graph G, whereas any structural information of interest is extracted by inspecting the way nodes are connected together. In the case where the adjacency matrix or the adjacency list of G is available, one can directly apply graph mining algorithms to extract usef...

This paper studies a linear model in which the regressors and errors covary with drivers of link formation in a large network. Neither the endogenous relationship between the regressors and errors nor the distribution of network links are restricted parametrically. Instead, the model is identified by variation in the regressors unexplained by the distribution of network links. I first demonstra...

We study a parametrized definition of gene clusters that permits control over the trade-off between increasing gene content versus conserving gene order within a cluster. This is based on the notion of generalized adjacency, which is the property shared by any two genes no farther apart, in the linear order of a chromosome, than a fixed threshold parameter θ. Then a cluster in two or more genom...

In this paper we explore how to embed symbolic relational graphs with unweighted edges in a pattern-space. We adopt a graph-spectral approach. We use the leading eigenvectors of the graph adjacency matrix to de0ne eigenmodes of the adjacency matrix. For each eigenmode, we compute vectors of spectral properties. These include the eigenmode perimeter, eigenmode volume, Cheeger number, inter-mode ...

In this paper, we study the dynamics of a viral spreading process in random geometric graphs (RGG). In an RGG, nodes are randomly distributed in a particular spatial region, and edges are located between those pairs of nodes that lie within a given distance r from each other. The spreading of the viral process we consider in this paper is closely related with the spectral radius of the adjacenc...

There is a familiar conjugate for integer partitions: transpose the Ferrers diagram, and a conjugate for integer compositions: transpose a Ferrers-like diagram. Here we propose a conjugate for set partitions and exhibit analogous pairs of statistics interchanged by the conjugate on set partitions and integer compositions respectively. 0 The Conjugate of an Integer Partition A partition of n is ...