In stream cipher cryptography a pseudorandom sequence of bits of length equal to the message length is generated. This sequence is then bitwise XORed (addition modulo 2) with the message sequence and the resulting sequence is transmitted. At the receiving end, deciphering is done by generating the same pseudorandom sequence and bitwise XORing the cipher bits with the random bits. The seed of th...

This work is a generalization of the López-Ruiz, Mancini and Calbet (LMC); and Shiner, 1 Davison and Landsberg (SDL) complexity measures, considering that the state of a system or process 2 is represented by a dynamical variable during a certain time interval. As the two complexity 3 measures are based on the calculation of informational entropy, an equivalent information source 4 is defined an...

Many studies have noted significant differences among human electroencephalograph (EEG) results when participants or patients are exposed to different stimuli, undertaking different tasks, or being affected by conditions such as epilepsy or Alzheimer's disease. Such studies often use only one or two measures of complexity and do not regularly justify their choice of measure beyond the fact that...

Tin Kam Ho and Ester Bernardò Mansilla in 2004 proposed to use data complexity measures to determine the domain of competition of the classifiers. They applied different classifiers over a set of problems of two classes and determined the best classifier for each one. Then for each classifier they analyzed how the values of some pairs of complexity measures were, and based on this analysis they...

Karoline Wiesner, ∗ Mile Gu, Elisabeth Rieper, and Vlatko Vedral 4, 2 School of Mathematics, University of Bristol, University Walk, Bristol BS8 1TW, United Kingdom Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, S15-03-18, Singapore 117543, Singapore Atomic and Laser Physics, Clarendon Laboratory, University of Oxford, Parks Road, Oxford OX1 3PU, United Ki...

This paper examines the use of minimal spanning trees as an alternative measure of classifier performance. The ability of this measure to capture classifier complexity is studied through the use of a gene expression dataset. The effect of distance metric on classifier performance is also detailed within.

The resource-bounded measures of complexity classes are shown to be robust with respect to certain changes in the underlying probability measure. Speci cally, for any real number > 0, any uniformly polynomial-time computable sequence ~ = ( 0; 1; 2; : : : ) of real numbers (biases) i 2 [ ; 1 ], and any complexity class C (such as P, NP, BPP, P/Poly, PH, PSPACE, etc.) that is closed under positiv...

BACKGROUND Self-administered depression measures are important tools for research and practice, but their utility depends on the quality of the measurements they yield. Respondent comprehension is essential for meaningful measurement and prior studies have used readability indices to assess comprehensibility. Readability, however, is only one aspect of comprehension and empirical evidence shows...

a r t i c l e i n f o a b s t r a c t In the recent past, recurrence quantification analysis (RQA) has gained an increasing interest in various research areas. The complexity measures the RQA provides have been useful in describing and analysing a broad range of data. It is known to be rather robust to noise and nonstationarities. Yet, one key question in empirical research concerns the confide...

Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...