the intuitionistic fuzzy set has been applied to game theory very rarely since it was introduced by atanassov in 1983. the aim of this paper is to develop an effective methodology for solving matrix games with payoffs of atanassov’s triangular intuitionistic fuzzy numbers (tifns). in this methodology, the concepts and ranking order relations of atanassov’s tifns are defined. a pair of bi-object...

In contrast to the classical discrete choice experiment, the respondent in a rank-order discrete choice experiment, is asked to rank a number of alternatives instead of the preferred one. In this paper, we study the information matrix of a rank order nested multinomial logit model (RO.NMNL) and introduce local D-optimality criterion, then we obtain Locally D-optimal design for RO.NMNL models in...

An iterative approach for joint optimization of a scalar error-feedback matrix and a coordinate transformation matrix is developed to minimize the roundoff noise subject to the l2-norm dynamic-range scaling constraints. When the iterative algorithm converges and the optimal coordinate transformation matrix is obtained, the diagonal error-feedback matrix is derived to minimize the noise gain in ...

We address the problem of the bit-error-rate (BER) performance gap between the sub-optimal and optimal linear precoder (LP) for a multi-user (MU) multiple-input and multiple-output (MIMO) broadcast systems in this paper. Particularly, mobile users suffer noise enhancement effect due to a sub-optimal LP that can be suppressed by an optimal LP matrix. A sub-optimal LP matrix such as a linear zero...

In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear programming (abbreviated to FFLP) problems. Also, we employ linear programming (LP) with equality constraints to find a nonegative fuzzy number vector x which satisfies Ax =b, where A is a fuzzy number matrix. Then we investigate the existence of a positive solution of fully fuzzy linear system (FFLS).

Traditional Compressive Sensing (CS) recovery techniques resorts a dictionary matrix to recover a signal. The success of recovery heavily relies on finding a dictionary matrix in which the signal representation is sparse. Achieving a sparse representation does not only depend on the dictionary matrix, but also depends on the data. It is a challenging issue to find an optimal dictionary to recov...

Optimizing the input covariance matrix of a multiple-antenna transmit system with partial channelstructure feedback is an important issue to fully exploit the channel capacity. Efficient design of the optimal input covariance matrix, however, remains unavailable although its eigenvector structure was clearly revealed in a recent publication. In this paper, we obtain an explicit derivative funct...

i,j ∈ Rk×k ′ + is the cost matrix, i.e. matrix of pairwise distances of elements betweenG andG′, and 〈A,B〉 = tr(AB) is the Frobenius dot-product of matrices. The optimal T ∈ Π(G,G′) in optimization problem (1) is called the optimal coupling ofG andG′, representing the optimal transport between these two measures. When k = k′, the complexity of best algorithms for finding the optimal transport i...

We consider ergodic coherent MIMO channels, and characterize the optimal input distribution under general distributions of the fading matrix. We describe how symmetries in the fading matrix distribution and the constraint set, described naturally with group structures, imply the symmetric properties of the optimal input distribution. We use this approach to give a general condition under which ...