However, there are options to increase the global tempo (GT) accuracy and also the detection accuracy of beat positions at the expense of less accurate onset detection. The study by [PERSON] et al. [6] aims to introduce an enhancement of a conventional beat detector. The enhancement is based on the Teager-Kaiser energy operator (TKEO), which pre-processes the input audio signal before the spectral flux calculation. The proposed approach is first evaluated in terms of the ability to estimate the GT and beat positions accuracy of given audio tracks compared to the same conventional system without the proposed enhancement. The accuracy of the GT and average beat differences (ABD) estimation is tested on the manually labelled reference database. Finally, this system is used for analysis of a string quartet music database. Results suggest that the presence of the TKEO lowers onset detection accuracy but also increases the GT and ABD estimation. The average deviation from the reference GT in the reference database is 9.99 BPM (11.28%), which improves the conventional methodology, where the average deviation is 18.19 BPM (17.74%). This study has a pilot character and provides some suggestions for improving the beat tracking system for music analysis. In the paper [7], [PERSON] and [PERSON] present the improvement of the cascaded prediction method. Three types of main predictor block with different levels of complexity were compared, including two complex prediction methods with backward adaptation, i.e., extension Active Level Classification Model (ALCM+) and extended Ordinary Least Square (OLS+). Authors' approach to implementation of the effective context-dependent constant component removal block is also presented. Additionally, the improved adaptive arithmetic coder with short, medium and long-term adaptation was presented, and the experiment was carried out comparing the results with other known lossless audio coders against which here proposed method obtained the best efficiency. The article by [PERSON] et al. [8] presents a configurable, high-throughput pseudo-random number generator template targeting cryptographic applications. The template is parameterized using a chaotic map that generates data, an entropy builder that is used to periodically change the parameters of the map and a parameter change interval, which is the number of iterations after which the entropy builder will change the generator's parameters. The system is implemented in C++ and evaluated using the TestU01 and NIST RNG statistical tests. The same implementation is used for a stream cipher that can encrypt and decrypt PNG images. A Monte-Carlo analysis of the seed space was performed. Results show that for certain combinations of maps and entropy builders, more than 90% of initial states (seeds) tested pass all statistical randomness tests. Furthermore, the throughput is large enough so that an 8 K color image can be encrypted in 2 s on a modern laptop CPU (exact specifications are given in the paper). The conclusion is that chaotic maps can be successfully used as a building block for cryptographic random number generators. In [9], [PERSON] considered the problem of the estimation of signal-to-noise ratio (SNR) with a real deterministic sinusoid with unknown frequency, phase and amplitude in additive Gaussian noise of unknown variance. A blind SNR estimator that does not require the knowledge of the instantaneous frequency of the sinusoid, through separate estimation of signal and noise power, was derived using the method of moments, a general method to derive estimators based on high-order moments. Statistical performances of the proposed estimators were studied theoretically through derivation of Cramer-Rao lower bounds (CRLBs) and asymptotic variances. Furthermore, results from Monte-Carlo simulations that confirm the validity of the theoretical analysis are presented along with some comments on the use of proposed estimators in practical applications.