the recent years have witnessed an increasing attention to the methods of multiple attribute decision making in solving the problems of the real world due to their shorter time of calculation and easy application. one of these methods is the ‘permutation method’ which has a strong logic in connection with ranking issues, but when the number of alternatives increases, solving problems through th...

The current study focuses on the problem of determining investment attrаctiveness of countries by means of monitoring regional stock markets. The method of using the permutation entropy as a model of investment attractiveness estimation is suggested. We have calculated the permutation entropy for the time series of stock markets of countries for the period from 2005 to 2018. The countries with ...

this paper presents a new audio encryption algorithm based on permutation and residue number system. in the current approach, signal samples are combined with residue number system through permutation; therefore, a specific noise is generated. then, the audio signal is combined with the noise, generated by the algorithm, to produce a silence signal. for this purpose, the algorithm uses a predef...

This study introduces a method for generating a particular permutation P of a given size N out of N! permutations from a given key. This method computes a unique permutation for a specific size since it takes the same key; therefore, the same permutation can be computed each time the same key and size are applied. The name of random permutation comes from the fact that the probability of gettin...

by a quasi-permutation matrix we mean a square matrix over the complex field c with non-negative integral trace. thus, every permutation matrix over c is a quasipermutation matrix. for a given finite group g, let p(g) denote the minimal degree of a faithful permutation representation of g (or of a faithful representation of g by permutation matrices), let q(g) denote the minimal degree of a fai...

a special class of cubic graphs are the cycle permutation graphs. a cycle permutation graph pn(α) is defined by taking two vertex-disjoint cycles on n vertices and adding a matching between the vertices of the two cycles.in this paper we determine a good upper bound for tenacity of cycle permutation graphs.