Search Results (10)

Load forecasting has significant implications on optimizing the operation of air conditioning systems for industrial mushroom houses and energy saving. This research paper presents a novel approach for short-term load forecasting in mushroom houses, which face challenges in accurately modeling cold and heat loads due to the complex interplay of various factors, including climatic conditions, mushroom growth, and equipment operation. The proposed method combines empirical wavelet transform (EWT), hybrid autoregressive integrated moving average (ARIMA), convolutional neural network (CNN), and bi-directional long short-term memory (BiLSTM) with an attention mechanism (CNN-BiLSTM-Attention) to address these challenges. The first step of this method was to select input features via the Boruta algorithm. Then, the EWT method was used to decompose the load data of mushroom houses into four modal components. Subsequently, the Lempel–Ziv method was introduced to classify the modal components into high-frequency and low-frequency classes. CNN-BiLSTM-Attention and ARIMA prediction models were constructed for these two classes, respectively. Finally, the predictions from both classes were combined and reconstructed to obtain the final load forecasting value. The experimental results show that the Boruta algorithm selects key influential feature factors effectively. Compared to the Spearman and Pearson correlation coefficient methods, the mean absolute error (MAE) of the prediction results is reduced by 14.72% and 3.75%, respectively. Compared to the ensemble empirical mode decomposition (EEMD) method, the EWT method can reduce the decomposition reconstruction error by an order of magnitude of ${10}^3$, effectively improving the accuracy of the prediction model. The proposed model in this paper exhibits significant advantages in prediction performance compared to the single neural network model, with the MAE, root mean square error (RMSE), and mean absolute percentage error (MAPE) of the prediction results reduced by 31.06%, 26.52%, and 39.27%, respectively. Full article

Today, the palindromic analysis of biological sequences, based exclusively on the study of “mirror” symmetry properties, is almost unavoidable. However, other types of symmetry, such as those present in friezes, could allow us to analyze binary sequences from another point of view. New tools, such as symmetropy and symmentropy, based on new types of palindromes allow us to discriminate binarized $1/f$ noise sequences better than Lempel–Ziv complexity. These new palindromes with new types of symmetry also allow for better discrimination of binarized DNA sequences. A relative error of $6\%$ of symmetropy is obtained from the HUMHBB and YEAST1 DNA sequences. A factor of 4 between the slopes obtained from the linear fits of the local symmentropies for the two DNA sequences shows the discriminative capacity of the local symmentropy. Moreover, it is highlighted that a certain number of these new palindromes of sizes greater than 30 bits are more discriminating than those of smaller sizes assimilated to those from an independent and identically distributed random variable. Full article

We consider the problem of encoding a deterministic source sequence (i.e., individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite-state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of the given source sequence, the bandwidth expansion factor, the secrecy capacity, the number of states of the encoder and the number of states of the decoder. Equivalently, this necessary condition can be presented as a converse bound (i.e., a lower bound) on the smallest achievable bandwidth expansion factor. The bound is asymptotically achievable by Lempel–Ziv compression followed by good channel coding for the wiretap channel. Given that the lower bound is saturated, we also derive a lower bound on the minimum necessary rate of purely random bits needed for local randomness at the encoder in order to meet the security constraint. This bound too is achieved by the same achievability scheme. Finally, we extend the main results to the case where the legitimate decoder has access to a side information sequence, which is another individual sequence that may be related to the source sequence, and a noisy version of the side information sequence leaks to the wiretapper. Full article

Hypnotic susceptibility is a major factor influencing the study of the neural correlates of hypnosis using EEG. In this context, while its effects on the response to hypnotic suggestions are undisputed, less attention has been paid to “neutral hypnosis” (i.e., the hypnotic condition in absence of suggestions). Furthermore, although an influence of opened and closed eye condition onto hypnotizability has been reported, a systematic investigation is still missing. Here, we analyzed EEG signals from 34 healthy subjects with low (LS), medium (MS), and (HS) hypnotic susceptibility using power spectral measures (i.e., TPSD, PSD) and Lempel-Ziv-Complexity (i.e., LZC, fLZC). Indeed, LZC was found to be more suitable than other complexity measures for EEG analysis, while it has been never used in the study of hypnosis. Accordingly, for each measure, we investigated within-group differences between rest and neutral hypnosis, and between opened-eye/closed-eye conditions under both rest and neutral hypnosis. Then, we evaluated between-group differences for each experimental condition. We observed that, while power estimates did not reveal notable differences between groups, LZC and fLZC were able to distinguish between HS, MS, and LS. In particular, we found a left frontal difference between HS and LS during closed-eye rest. Moreover, we observed a symmetric pattern distinguishing HS and LS during closed-eye hypnosis. Our results suggest that LZC is better capable of discriminating subjects with different hypnotic susceptibility, as compared to standard power analysis. Full article

We present linear-time algorithms computing the reversed Lempel–Ziv factorization [Kolpakov and Kucherov, TCS’09] within the space bounds of two different suffix tree representations. We can adapt these algorithms to compute the longest previous non-overlapping reverse factor table [Crochemore et al., JDA’12] within the same space but pay a multiplicative logarithmic time penalty. Full article

We consider the communication complexity of the Hamming distance of two strings. Bille et al. [SPIRE 2018] considered the communication complexity of the longest common prefix (LCP) problem in the setting where the two parties have their strings in a compressed form, i.e., represented by the Lempel-Ziv 77 factorization (LZ77) with/without self-references. We present a randomized public-coin protocol for a joint computation of the Hamming distance of two strings represented by LZ77 without self-references. Although our scheme is heavily based on Bille et al.’s LCP protocol, our complexity analysis is original which uses Crochemore’s C-factorization and Rytter’s AVL-grammar. As a byproduct, we also show that LZ77 with/without self-references are not monotonic in the sense that their sizes can increase by a factor of 4/3 when a prefix of the string is removed. Full article

We present algorithms computing the non-overlapping Lempel–Ziv-77 factorization and the longest previous non-overlapping factor table within small space in linear or near-linear time with the help of modern suffix tree representations fitting into limited space. With similar techniques, we show how to answer substring compression queries for the Lempel–Ziv-78 factorization with a possible logarithmic multiplicative slowdown depending on the used suffix tree representation. Full article

Alzheimer’s disease (AD) is the most prevalent cause of dementia, being considered a major health problem, especially in developed countries. Late-onset AD is the most common form of the disease, with symptoms appearing after 65 years old. Genetic determinants of AD risk are vastly unknown, though, $\epsilon$ 4 allele of the ApoE gene has been reported as the strongest genetic risk factor for AD. The objective of this study was to analyze the relationship between brain complexity and the presence of ApoE $\epsilon$ 4 alleles along the AD continuum. For this purpose, resting-state electroencephalography (EEG) activity was analyzed by computing Lempel-Ziv complexity (LZC) from 46 healthy control subjects, 49 mild cognitive impairment subjects, 45 mild AD patients, 44 moderate AD patients and 33 severe AD patients, subdivided by ApoE status. Subjects with one or more ApoE $\epsilon$ 4 alleles were included in the carriers subgroups, whereas the ApoE $\epsilon$ 4 non-carriers subgroups were formed by subjects without any $\epsilon$ 4 allele. Our results showed that AD continuum is characterized by a progressive complexity loss. No differences were observed between AD ApoE $\epsilon$ 4 carriers and non-carriers. However, brain activity from healthy subjects with ApoE $\epsilon$ 4 allele (carriers subgroup) is more complex than from non-carriers, mainly in left temporal, frontal and posterior regions (p-values < 0.05, FDR-corrected Mann–Whitney U-test). These results suggest that the presence of ApoE $\epsilon$ 4 allele could modify the EEG complexity patterns in different brain regions, as the temporal lobes. These alterations might be related to anatomical changes associated to neurodegeneration, increasing the risk of suffering dementia due to AD before its clinical onset. This interesting finding might help to advance in the development of new tools for early AD diagnosis. Full article

Electrohysterography (EHG) has been shown to provide relevant information on uterine activity and could be used for predicting preterm labor and identifying other maternal fetal risks. The extraction of high-quality robust features is a key factor in achieving satisfactory prediction systems from EHG. Temporal, spectral, and non-linear EHG parameters have been computed to characterize EHG signals, sometimes obtaining controversial results, especially for non-linear parameters. The goal of this work was to assess the performance of EHG parameters in identifying those robust enough for uterine electrophysiological characterization. EHG signals were picked up in different obstetric scenarios: antepartum, including women who delivered on term, labor, and post-partum. The results revealed that the 10th and 90th percentiles, for parameters with falling and rising trends as labor approaches, respectively, differentiate between these obstetric scenarios better than median analysis window values. Root-mean-square amplitude, spectral decile 3, and spectral moment ratio showed consistent tendencies for the different obstetric scenarios as well as non-linear parameters: Lempel–Ziv, sample entropy, spectral entropy, and SD1/SD2 when computed in the fast wave high bandwidth. These findings would make it possible to extract high quality and robust EHG features to improve computer-aided assessment tools for pregnancy, labor, and postpartum progress and identify maternal fetal risks. Full article

Designing a chaotic system with infinitely many attractors is a hot topic. In this paper, multiscale multivariate permutation entropy (MMPE) and multiscale multivariate Lempel–Ziv complexity (MMLZC) are employed to analyze the complexity of those self-reproducing chaotic systems with one-directional and two-directional infinitely many chaotic attractors. The analysis results show that complexity of this class of chaotic systems is determined by the initial conditions. Meanwhile, the values of MMPE are independent of the scale factor, which is different from the algorithm of MMLZC. The analysis proposed here is helpful as a reference for the application of the self-reproducing systems. Full article