We present an overview of different approaches to define shuffles and synchronized shuffles of words. The shuffle operations considered are distinguished by conditions according to which certain occurrences of symbols common to the original words may or must be identified (synchronized). The words that are shuffled may be infinite which leads to the possibility of unfair shuffling. In addition ...

We compare 32 saliency models. Details of our model comparison setup and compared models are provided in this supplement. We report eye movement prediction accuracy of models using three scores: Shuffled AUC (sAUC), Correlation Coefficient (CC), and Normalized Scanpath Saliency (NSS). Additionally, we show results of statistical significance (statistical tests) of models using t-test. Results a...

We study the properties of memory of a financial time series adopting two different methods of analysis, the detrended fluctuation analysis (DFA) and the analysis of the power spectrum (PSA). The methods are applied on three time series: one of high-frequency returns, one of shuffled returns and one of absolute values of returns. We prove that both DFA and PSA give results in line with those ob...

A simple and efficient shuffling scheme containing two protocols is proposed. Firstly, a prototype, Protocol-1 is designed, which is based on the assumption that the shuffling party cannot find a linear relation of the shuffled messages in polynomial time. As application of Protocol-1 is limited, it is then optimised to Protocol-2, which does not need the assumption. Both protocols are simpler ...

In order to handle large scale problems, this study has used shuffled frog leaping algorithm. This algorithm is an optimization method based on natural memetics that uses a new two-phase modification to it to have a better search in the problem space. The suggested algorithm is evaluated by comparing to some well known algorithms using several benchmark optimization problems. The simulation res...

hub covering location problem, network design,   single machine scheduling, genetic algorithm,   shuffled frog leaping algorithm   hub location problems (hlp) are synthetic optimization problems that appears in telecommunication and transportation networks where nodes send and receive commodities (i.e., data transmissions, passengers transportation, express packages, postal deliveries, etc.) th...