XML
-
-
List of Articles
-
Open Access Article
1 - Voiced-Unvoiced-Silence Detection of Speech Signal using Combined Spectro-Temporal Features
Nafiseh EsfandianThis paper presents a new method for classification of voiced, unvoiced and silence segments of speech signal. In the proposed method, combination of spectro-temporal features is used for speech segmentation. Combined features are extracted using clustering in spectro-t MoreThis paper presents a new method for classification of voiced, unvoiced and silence segments of speech signal. In the proposed method, combination of spectro-temporal features is used for speech segmentation. Combined features are extracted using clustering in spectro-temporal domain. Multi-dimensional output of auditory model is clustered using weighted Gaussian mixture model. In this method, after extracting the main clusters for each frame, combined spectro-temporal features such as cluster’s energy, energy difference of clusters and minimum value of normalized cross-correlation between clusters are used for detection of voiced, unvoiced and silence regions of speech. In the proposed algorithm, speech segmentation is performed by comparing each class of features with the appropriate threshold value. Combined spectro-temporal features are used for speech segmentation in noisy conditions. The results demonstrate performance of the proposed algorithm comparing to the other features for speech segmentation. Manuscript profile -
Open Access Article
2 - A Three-Term Extension of a Descent Conjugate Gradient Method
Zohre AminifardIn an effort to make modification on the classical Hestenes--Stiefel method, Shengwei et al. proposed an efficient conjugate gradient method which possesses the sufficient descent condition when the line search fulfills the strong Wolfe conditions (by restricting the li MoreIn an effort to make modification on the classical Hestenes--Stiefel method, Shengwei et al. proposed an efficient conjugate gradient method which possesses the sufficient descent condition when the line search fulfills the strong Wolfe conditions (by restricting the line search parameters). Here, we develop a three--term extension of the method which guarantees the sufficient descent condition independent to the line search. Also, we establish global convergence of the method using convexity assumption. At last, practical merits of the proposed method are investigated by numerical experiments on a set of CUTEr test functions. The results show numerical efficiency of the method. Manuscript profile -
Open Access Article
3 - The Interval Rational- Interpolation Method
Hajar Rasekhinezhad Mozhdeh Afshar Kermani Tofigh Allahviranloo Saeid Abbasbandy Esmail BabolianThe rational interpolation sometimes gives better approximations than polynomial interpolation particularly for large sequence of points. In this paper, for the first time we provide a combination of rational interpolation and interval data. we present applied interval MoreThe rational interpolation sometimes gives better approximations than polynomial interpolation particularly for large sequence of points. In this paper, for the first time we provide a combination of rational interpolation and interval data. we present applied interval arithmetic in rational interpolation, when support points are interval-valued. First, we introduce the basic concepts of the algebraic theories to apply the interval methods to uncertainty analysis. Then the interpolation of interval coefficient is obtained and also the error of the proposed method is analyzed and is proved by a theorem for different cases. Some different numerical examples are given to illustrate the proposed method and the results are recorded. Manuscript profile -
Open Access Article
4 - On the Signless Laplacian Eigenvalues and Optimum SLE of Graph
Gholam Hossein Fath-TabarLet G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise. Assume that D(G) is the n×n diagonal matrix MoreLet G be a graph of order n and with the vertex set {v_1,v_2,…,v_n } and the edge set E(G). The adjancency matrix of G is an n×n matrix A(G) whose (i,j)-entry is 1 if v_i is adjacent to v_j and 0, otherwise. Assume that D(G) is the n×n diagonal matrix whose (i,i)-entry is the degree of v_i. The matrices L(G) = D(G) - A(G) and Q(G) = D(G) + A(G) are called the Laplacian matrix and signless Laplacian matrix of G, respectively. The signelss Laplacian eigenvalues of a graph are the roots of characteristic polynomial of the signless Laplacian matrix of it. In this paper, we obtained signless Laplacian spectrum of some special subgraphs of complete graph and then estimated some bounds for signless Laplacian Energy of some graphs. Manuscript profile -
Open Access Article
5 - The Stability of Generalized Jordan Derivations Associated with Hochschild 2-Cocycles of Triangular Algebras
Rohollah Bakhshandeh Isa BakhshandehIn present paper, the stability of generalized Jordan derivations associated with Hochschild 2-cocycles of triangular algebras for the generalized kind of Jensen-type functional equation is investigated. In fact, the main purpose of present paper is to prove the general MoreIn present paper, the stability of generalized Jordan derivations associated with Hochschild 2-cocycles of triangular algebras for the generalized kind of Jensen-type functional equation is investigated. In fact, the main purpose of present paper is to prove the generalized Hyers-Ulam-Rassias stability of generalized Jordan derivation between algebra ${mathcal A}$ and an ${mathcal A}$-bimodule ${mathcal M}$. In present paper, the stability of generalized Jordan derivations associated with Hochschild 2-cocycles of triangular algebras for the generalized kind of Jensen-type functional equation is investigated. In fact, the main purpose of present paper is to prove the generalized Hyers-Ulam-Rassias stability of generalized Jordan derivation between algebra ${mathcal A}$ and an ${mathcal A}$-bimodule ${mathcal M}$. Manuscript profile -
Open Access Article
6 - Extending Allocation Stages of Fixed Costs Between Decision Making Units Using DEA
Hassan Rostamzadeh Ali Reza Fakharzadeh JahromiA good idea for a decision maker to protect and increase the efficiency of the decision-making units (DMUs) in an organization, is to allocate the fixed costs between them based on their efficiencies. Since, data envelopment analysis (DEA) is a suitable method to calcul MoreA good idea for a decision maker to protect and increase the efficiency of the decision-making units (DMUs) in an organization, is to allocate the fixed costs between them based on their efficiencies. Since, data envelopment analysis (DEA) is a suitable method to calculate the efficiency, allocating fixed costs to DMUs based on the two-stage network DEA (NDEA) approach is done by researchers. But due to some limitations (like producing a product in several steps, receiving incomes in several stages and etc) and some organization necessities, it is impossible to do this allocation just in two-stages. In this paper, we suggest a model for allocating the fixed cost among DMUs in more than two-stage network DEA approach, so that more than allocating the fixed cost, increasing in efficiency is also considered. Also, a benchmark example in reality is presented to illustrate the model and its applications. Manuscript profile
-
The rights to this website are owned by the Raimag Press Management System.
Copyright © 2021-2024