We present a technique for evaluating classifications by geometric comparison of rule sets. Rules are represented as objects in an n-dimensional hyperspace. The similarity of classes is computed from the overlap of the geometric class descriptions. The system produces a correlation matrix that indicates the degree of similarity between each pair of classes. The technique can be applied to class...

one of the most important requirements of developing appropriate strategies for international marketing is correct identification of target markets. using quantitative techniques and decision making skills will lead to better results regarding the evaluation of marketing strategies. in this study, first we have used internal factor evaluation (ife) matrix for recognizing and comparing strengths...

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

In this paper we present a technique for reducing to a minimum the number of commutators required in the practical implementation of Lie group methods for integrating numerically matrix differential equations. This technique is subsequently applied to the linear and nonlinear case for constructing new geometric integrators, optimal with respect to the number of commutators. © 2002 Elsevier Scie...

The singular value decomposition SVD is a powerful technique in many matrix computa tions and analyses Using the SVD of a matrix in computations rather than the original matrix has the advantage of being more robust to numerical error Additionally the SVD exposes the geometric structure of a matrix an important aspect of many matrix calcula tions A matrix can be described as a tranformation fro...

I n this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such a n approach are that very efficient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. W e first characterize the class of stochastic Petri nets of interest by formally defining ...

In this paper we characterize a class of stochastic Petri nets that can be solved using matrix geometric techniques. Advantages of such an approach are that very eecient mathematical technique become available for practical usage, as well as that the problem of large state spaces can be circumvented. We rst characterize the class of stochastic Petri nets of interest by formally deening a number...