A novel method for voice conversion based on non-parallel corpus

This article puts forward a new algorithm for voice conversion which not only removes the necessity of parallel corpus in the training phase but also resolves the issue of insufficiency of the target speaker’s corpus. The proposed approach is based on one of the new voice conversion models utilizing classical LPC analysis-synthesis model combined with GMM. Through this algorithm, the conversion functions among vowels and demi-syllables are derived. We assumed that these functions are rather the same for different speakers if their genders, accents, and languages are alike. Therefore, we will be able to produce the demi-syllables with just having access to few sentences from the target speaker and forming the GMM for one of his/her vowels. The results from the appraisal of the proposed method for voice conversion clarifies that this method has the ability to efficiently realize the speech features of the target speaker. It can also provide results comparable to the ones obtained through the parallel-corpus-based approaches.     

On the numerical solution of Fredholm integral equations utilizing the local radial basis function method

The current investigation describes a computational technique to solve one- and two-dimensional Fredholm integral equations of the second kind. The method estimates the solution using the discrete collocation method by combining locally supported radial basis functions (RBFs) constructed on a small set of nodes instead of all points over the analysed domain. In this work, we employ the Gauss–Legendre integration rule on the influence domains of shape functions to approximate the local integrals appearing in the method. In comparison with the globally supported RBFs for solving integral equations, the proposed method is stable and uses much less computer memory. The scheme does not require any cell structures, so it is meshless. We also obtain the error analysis of the proposed method and demonstrate that the convergence rate of the approach is high. Illustrative examples clearly show the reliability and efficiency of the new method.     

A globally convergent BFGS method for pseudo-monotone variational inequality problems

In this paper, we propose a globally convergent BFGS method to solve Variational Inequality Problems (VIPs). In fact, a globalization technique on the basis of the hyperplane projection method is applied to the BFGS method. The technique, which is independent of any merit function, is applicable for pseudo-monotone problems. The proposed method applies the BFGS direction and tries to reduce the distance of iterates to the solution set. This property, called Fejer monotonicity of iterates with respect to the solution set, is the basis of the convergence analysis. The method applied to pseudo-monotone VIP is globally convergent in the sense that subproblems always have unique solutions, and the sequence of iterates converges to a solution to the problem without any regularity assumption. Finally, some numerical simulations are included to evaluate the efficiency of the proposed algorithm.     

Embedding linear arrays of the maximum length in O-shaped meshes

The Journal of Supercomputing - Embedding an interconnection network into another network is one of the important problems in parallel processing. In this paper, we study embedding of linear arrays...     

Improvement of time alignment of the speech signals to be used in voice conversion

One of the main applications of time alignment is parallel corpus based voice conversion. In the literature, various methods such as dynamic time warping (DTW) and hidden Markov model have been suggested for time alignment of two speech signals. In this paper, we introduce some modifications to DTW in order to decrease the time alignment error. These modifications are refinement, which is done by exerting a threshold, normalization, and comparisons between the preceding and the following frames to make sound correspondence between two different parallel corpus-based speakers’ speeches. Evaluation of this approach which has been done on some corpus sentences indicates a significant improvement of time alignment. At least about 4% and in some cases 15% decrease of error in comparison with DTW has been achieved.     

Multidimensional appraisal of customer relationship management: integrating balanced scorecard and multi criteria decision making approaches

This paper presents a comprehensive integrative framework for measuring the performance of customer relationship management (CRM) system based on a detailed empirical study of 32 Iranian internet service provider (ISP) firms. At first, by an extensive literature review and experts who have real practical experiences in the field of CRM, appropriate key performance indicators (KPIs) based on four perspectives of balanced scorecard have been extracted. Then, due to the interdependency and feedback among these KPIs, multiple criteria decision making techniques are used to evaluate CRM performance. Specifically, this study first applies the decision making trial and evaluation laboratory approach to determine the interrelated relationships among criteria, and to find the crucial central and influential factors. Then, the analytical network process method is used to obtain the criterion weights. Finally, according to these previous results, the technique for order of preference by similarity to ideal solution method is adopted to analyze the CRM performance of 32 Iranian ISP firms. The results of this study illustrated that learning and growth is the most crucial influential perspective and it would influence on the other perspectives much more. Furthermore, indicators including organization capital, human capital, customer retention process, customer perceived value, and customer expansion process play an essential role in succeeding of CRM. The results of this study can provide a comprehensive insight for managers into discerning how and through which mechanisms CRM can create merits for the organizations.     

The approximate solution of charged particle motion equations in oscillating magnetic fields using the local multiquadrics collocation method

The charged particle motion for certain configurations of oscillating magnetic fields can be simulated by a Volterra integro-differential equation of the second order with time-periodic coefficients. This paper investigates a simple and accurate scheme for computationally solving these types of integro-differential equations. To start the method, we first reduce the integro-differential equations to equivalent Volterra integral equations of the second kind. Subsequently, the solution of the mentioned Volterra integral equations is estimated by the collocation method based on the local multiquadrics formulated on scattered points. We also expand the proposed method to solve fractional integro-differential equations including non-integer order derivatives. Since the offered method does not need any mesh generations on the solution domain, it can be recognized as a meshless method. To demonstrate the reliability and efficiency of the new technique, several illustrative examples are given. Moreover, the numerical results confirm that the method developed in the current paper in comparison with the method based on the globally supported multiquadrics has much lesser volume computing.

     

Deep Neural Networks Regularization Using a Combination of Sparsity Inducing Feature Selection Methods

Neural Processing Letters - Deep learning is an important subcategory of machine learning approaches in which there is a hope of replacing man-made features with fully automatic extracted features....     

Enhancing spatial and temporal utilities in differentially private moving objects database release

International Journal of Information Security - The pervasive use of mobile technologies and GPS-equipped vehicles has resulted in a large number of moving objects databases. Privacy protection is...     

An efficient parallel algorithm for the longest path problem in meshes

The longest path problem is the problem of finding a simple path with the maximum number of vertices in a given graph, and so far it has been solved polynomially only for a few classes of graphs. This problem generalizes the well-known Hamiltonian path problem, hence it is NP-hard in general graphs. In this paper, first we give a sequential linear-time algorithm for the longest path problem in meshes. Then based on this algorithm, we present a constant-time parallel algorithm for the problem, which can be run on every parallel machine.