Previous Issue
Volume 26, May
 
 
entropy-logo

Journal Browser

Journal Browser

Entropy, Volume 26, Issue 6 (June 2024) – 58 articles

  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list.
  • You may sign up for e-mail alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.
Order results
Result details
Section
Select all
Export citation of selected articles as:
20 pages, 1971 KiB  
Article
Continuous-Time Quantum Walk in Glued Trees: Localized State-Mediated Almost Perfect Quantum-State Transfer
by Vincent Pouthier, Lucie Pepe and Saad Yalouz
Entropy 2024, 26(6), 490; https://doi.org/10.3390/e26060490 (registering DOI) - 2 Jun 2024
Abstract
In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our [...] Read more.
In this work, the dynamics of a quantum walker on glued trees is revisited to understand the influence of the architecture of the graph on the efficiency of the transfer between the two roots. Instead of considering regular binary trees, we focus our attention on leafier structures where each parent node could give rise to a larger number of children. Through extensive numerical simulations, we uncover a significant dependence of the transfer on the underlying graph architecture, particularly influenced by the branching rate (M) relative to the root degree (N). Our study reveals that the behavior of the walker is isomorphic to that of a particle moving on a finite-size chain. This chain exhibits defects that originate in the specific nature of both the roots and the leaves. Therefore, the energy spectrum of the chain showcases rich features, which lead to diverse regimes for the quantum-state transfer. Notably, the formation of quasi-degenerate localized states due to significant disparities between M and N triggers a localization process on the roots. Through analytical development, we demonstrate that these states play a crucial role in facilitating almost perfect quantum beats between the roots, thereby enhancing the transfer efficiency. Our findings offer valuable insights into the mechanisms governing quantum-state transfer on trees, with potential applications for the transfer of quantum information. Full article
(This article belongs to the Special Issue Quantum Walks for Quantum Technologies)
12 pages, 769 KiB  
Review
Entropy and the Limits to Growth
by Reiner Kümmel
Entropy 2024, 26(6), 489; https://doi.org/10.3390/e26060489 (registering DOI) - 31 May 2024
Abstract
In its business-as-usual scenario, the 1972 Club-of-Rome report—The Limits to Growth—describes the collapse of the world economy around the year 2030, either because of the scarcity of natural resources or because of pollution. Mainstream economists, the high priests of secular societies, condemned it [...] Read more.
In its business-as-usual scenario, the 1972 Club-of-Rome report—The Limits to Growth—describes the collapse of the world economy around the year 2030, either because of the scarcity of natural resources or because of pollution. Mainstream economists, the high priests of secular societies, condemned it fiercely. Their gospel of perpetual economic growth, during which technological progress would solve all problems, promises a bright future for all mankind. On the other hand, engineers, natural scientists, and mathematicians realized that the breakdown scenario is due to the inclusion of the First and the Second Law of Thermodynamics in the Club-of-Rome’s world model. According to these laws, nothing happens in the world without energy conversion and entropy production. In 1865, Rudolph Clausius, the discoverer of entropy, published the laws as the constitution of the universe. Entropy is the physical measure of disorder. Without a proper understanding of energy and entropy in the economy, all efforts to achieve sustainability will fail. Full article
(This article belongs to the Section Complexity)
14 pages, 6693 KiB  
Article
Quantum Key Distribution with Displaced Thermal States
by Adam Walton, Anne Ghesquière and Benjamin T.H. Varcoe
Entropy 2024, 26(6), 488; https://doi.org/10.3390/e26060488 - 31 May 2024
Abstract
Secret key exchange relies on the creation of correlated signals, serving as the raw resource for secure communication. Thermal states exhibit Hanbury Brown and Twiss correlations, which offer a promising avenue for generating such signals. In this paper, we present an experimental implementation [...] Read more.
Secret key exchange relies on the creation of correlated signals, serving as the raw resource for secure communication. Thermal states exhibit Hanbury Brown and Twiss correlations, which offer a promising avenue for generating such signals. In this paper, we present an experimental implementation of a central broadcast thermal-state quantum key distribution (QKD) protocol in the microwave region. Our objective is to showcase a straightforward method of QKD utilizing readily available broadcasting equipment. Unlike conventional approaches to thermal-state QKD, we leverage displaced thermal states. These states enable us to share the output of a thermal source among Alice, Bob, and Eve via both waveguide channels and free space. Through measurement and conversion into bit strings, our protocol produces key-ready bit strings without the need for specialized equipment. By harnessing the inherent noise in thermal broadcasts, our setup facilitates the recovery of distinct bit strings by all parties involved. Full article
21 pages, 5733 KiB  
Article
A Circular-Linear Probabilistic Model Based on Nonparametric Copula with Applications to Directional Wind Energy Assessment
by Jie Liu and Zaizai Yan
Entropy 2024, 26(6), 487; https://doi.org/10.3390/e26060487 - 31 May 2024
Abstract
The joint probability density function of wind speed and wind direction serves as the mathematical basis for directional wind energy assessment. In this study, a nonparametric joint probability estimation system for wind velocity and direction based on copulas is proposed and empirically investigated [...] Read more.
The joint probability density function of wind speed and wind direction serves as the mathematical basis for directional wind energy assessment. In this study, a nonparametric joint probability estimation system for wind velocity and direction based on copulas is proposed and empirically investigated in Inner Mongolia, China. Optimal bandwidth algorithms and transformation techniques are used to determine the nonparametric copula method. Various parameter copula models and models without considering dependency relationships are introduced and compared with this approach. The results indicate a significant advantage of employing the nonparametric copula model for fitting joint probability distributions of both wind speed and wind direction, as well as conducting correlation analyses. By utilizing the proposed KDE-COP-CV model, it becomes possible to accurately and reliably analyze how wind power density fluctuates in relation to wind direction. This study reveals the researched region possesses abundant wind resources, with the highest wind power density being highly dependent on wind direction at maximum speeds. Wind resources in selected regions of Inner Mongolia are predominantly concentrated in the northwest and west directions. These findings can contribute to improving the accuracy of micro-siting for wind farms, as well as optimizing the design and capacity of wind turbine generators. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
20 pages, 681 KiB  
Article
Unveiling Influence in Networks: A Novel Centrality Metric and Comparative Analysis through Graph-Based Models
by Nada Bendahman and Dounia Lotfi
Entropy 2024, 26(6), 486; https://doi.org/10.3390/e26060486 - 31 May 2024
Abstract
Abstract: Identifying influential actors within social networks is pivotal for optimizing information flow and mitigating the spread of both rumors and viruses. Several methods have emerged to pinpoint these influential entities in networks, represented as graphs. In these graphs, nodes correspond to individuals [...] Read more.
Abstract: Identifying influential actors within social networks is pivotal for optimizing information flow and mitigating the spread of both rumors and viruses. Several methods have emerged to pinpoint these influential entities in networks, represented as graphs. In these graphs, nodes correspond to individuals and edges indicate their connections. This study focuses on centrality measures, prized for their straightforwardness and effectiveness. We divide structural centrality into two categories: local, considering a node’s immediate vicinity, and global, accounting for overarching path structures. Some techniques blend both centralities to highlight nodes influential at both micro and macro levels. Our paper presents a novel centrality measure, accentuating node degree and incorporating the network’s broader features, especially paths of different lengths. Through Spearman and Pearson correlations tested on seven standard datasets, our method proves its merit against traditional centrality measures. Additionally, we employ the susceptible–infected–recovered (SIR) model, portraying virus spread, to further validate our approach. The ultimate influential node is gauged by its capacity to infect the most nodes during the SIR model’s progression. Our results indicate a notable correlative efficacy across various real-world networks relative to other centrality metrics. Full article
(This article belongs to the Special Issue Advances in Complex Networks and Artificial Intelligence)
19 pages, 337 KiB  
Article
Even and Odd Cat States of Two and Three Qubits in the Probability Representation of Quantum Mechanics
by Matyas Mechler, Margarita A. Man’ko, Vladimir I. Man’ko and Peter Adam
Entropy 2024, 26(6), 485; https://doi.org/10.3390/e26060485 - 31 May 2024
Abstract
We derive the probability representation of even and odd cat states of two and three qubits. These states are even and odd superpositions of spin-1/2 eigenstates corresponding to two opposite directions along the z axis. The probability representation of even and odd cat [...] Read more.
We derive the probability representation of even and odd cat states of two and three qubits. These states are even and odd superpositions of spin-1/2 eigenstates corresponding to two opposite directions along the z axis. The probability representation of even and odd cat states of an oscillating spin-1/2 particle is also discussed. The exact formulas for entangled probability distributions describing density matrices of all these states are obtained. Full article
(This article belongs to the Section Quantum Information)
14 pages, 2749 KiB  
Article
On Predictive Planning and Counterfactual Learning in Active Inference
by Aswin Paul, Takuya Isomura and Adeel Razi
Entropy 2024, 26(6), 484; https://doi.org/10.3390/e26060484 - 31 May 2024
Abstract
Given the rapid advancement of artificial intelligence, understanding the foundations of intelligent behaviour is increasingly important. Active inference, regarded as a general theory of behaviour, offers a principled approach to probing the basis of sophistication in planning and decision-making. This paper examines two [...] Read more.
Given the rapid advancement of artificial intelligence, understanding the foundations of intelligent behaviour is increasingly important. Active inference, regarded as a general theory of behaviour, offers a principled approach to probing the basis of sophistication in planning and decision-making. This paper examines two decision-making schemes in active inference based on “planning” and “learning from experience”. Furthermore, we also introduce a mixed model that navigates the data complexity trade-off between these strategies, leveraging the strengths of both to facilitate balanced decision-making. We evaluate our proposed model in a challenging grid-world scenario that requires adaptability from the agent. Additionally, our model provides the opportunity to analyse the evolution of various parameters, offering valuable insights and contributing to an explainable framework for intelligent decision-making. Full article
Show Figures

Figure 1

19 pages, 602 KiB  
Article
Optimal Estimation of a Signal Generated Using a Dynamical System Modeled with McKean–Vlasov Stochastic Differential Equations
by Vasile Dragan and Samir Aberkane
Entropy 2024, 26(6), 483; https://doi.org/10.3390/e26060483 - 31 May 2024
Abstract
We consider, in this paper, the problem of state estimation for a class of dynamical systems governed via continuous-time McKean–Vlasov stochastic differential equations. The estimation problem is stated and solved under an H2 norm setting. We adopt a Riccati-based approach in order [...] Read more.
We consider, in this paper, the problem of state estimation for a class of dynamical systems governed via continuous-time McKean–Vlasov stochastic differential equations. The estimation problem is stated and solved under an H2 norm setting. We adopt a Riccati-based approach in order to solve the optimal estimation problem. Full article
(This article belongs to the Special Issue Information Theory in Control Systems II)
Show Figures

Figure 1

17 pages, 815 KiB  
Article
DAFT-Net: Dual Attention and Fast Tongue Contour Extraction Using Enhanced U-Net Architecture
by Xinqiang Wang, Wenhuan Lu, Hengxin Liu, Wei Zhang and Qiang Li
Entropy 2024, 26(6), 482; https://doi.org/10.3390/e26060482 - 31 May 2024
Abstract
In most silent speech research, continuously observing tongue movements is crucial, thus requiring the use of ultrasound to extract tongue contours. Precisely and in real-time extracting ultrasonic tongue contours presents a major challenge. To tackle this challenge, the novel end-to-end lightweight network DAFT-Net [...] Read more.
In most silent speech research, continuously observing tongue movements is crucial, thus requiring the use of ultrasound to extract tongue contours. Precisely and in real-time extracting ultrasonic tongue contours presents a major challenge. To tackle this challenge, the novel end-to-end lightweight network DAFT-Net is introduced for ultrasonic tongue contour extraction. Integrating the Convolutional Block Attention Module (CBAM) and Attention Gate (AG) module with entropy-based optimization strategies, DAFT-Net establishes a comprehensive attention mechanism with dual functionality. This innovative approach enhances feature representation by replacing traditional skip connection architecture, thus leveraging entropy and information-theoretic measures to ensure efficient and precise feature selection. Additionally, the U-Net’s encoder and decoder layers have been streamlined to reduce computational demands. This process is further supported by information theory, thus guiding the reduction without compromising the network’s ability to capture and utilize critical information. Ablation studies confirm the efficacy of the integrated attention module and its components. The comparative analysis of the NS, TGU, and TIMIT datasets shows that DAFT-Net efficiently extracts relevant features, and it significantly reduces extraction time. These findings demonstrate the practical advantages of applying entropy and information theory principles. This approach improves the performance of medical image segmentation networks, thus paving the way for real-world applications. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

28 pages, 4087 KiB  
Perspective
Self-Improvising Memory: A Perspective on Memories as Agential, Dynamically Reinterpreting Cognitive Glue
by Michael Levin
Entropy 2024, 26(6), 481; https://doi.org/10.3390/e26060481 - 31 May 2024
Abstract
Many studies on memory emphasize the material substrate and mechanisms by which data can be stored and reliably read out. Here, I focus on complementary aspects: the need for agents to dynamically reinterpret and modify memories to suit their ever-changing selves and environment. [...] Read more.
Many studies on memory emphasize the material substrate and mechanisms by which data can be stored and reliably read out. Here, I focus on complementary aspects: the need for agents to dynamically reinterpret and modify memories to suit their ever-changing selves and environment. Using examples from developmental biology, evolution, and synthetic bioengineering, in addition to neuroscience, I propose that a perspective on memory as preserving salience, not fidelity, is applicable to many phenomena on scales from cells to societies. Continuous commitment to creative, adaptive confabulation, from the molecular to the behavioral levels, is the answer to the persistence paradox as it applies to individuals and whole lineages. I also speculate that a substrate-independent, processual view of life and mind suggests that memories, as patterns in the excitable medium of cognitive systems, could be seen as active agents in the sense-making process. I explore a view of life as a diverse set of embodied perspectives—nested agents who interpret each other’s and their own past messages and actions as best as they can (polycomputation). This synthesis suggests unifying symmetries across scales and disciplines, which is of relevance to research programs in Diverse Intelligence and the engineering of novel embodied minds. Full article
(This article belongs to the Special Issue Self-Learning in Physical Machines)
Show Figures

Figure 1

22 pages, 28194 KiB  
Article
Application of C-InGAN Model in Interpretable Feature of Bearing Fault Diagnosis
by Wanyi Yang, Tao Liang, Jianxin Tan, Yanwei Jing and Liangnian Lv
Entropy 2024, 26(6), 480; https://doi.org/10.3390/e26060480 - 31 May 2024
Abstract
Although traditional fault diagnosis methods are proficient in extracting signal features, their diagnostic interpretability remains challenging. Consequently, this article proposes a conditionally interpretable generative adversarial network (C-InGAN) model for the interpretable feature fault diagnosis of bearings. Initially, the vibration signal is denoised and [...] Read more.
Although traditional fault diagnosis methods are proficient in extracting signal features, their diagnostic interpretability remains challenging. Consequently, this article proposes a conditionally interpretable generative adversarial network (C-InGAN) model for the interpretable feature fault diagnosis of bearings. Initially, the vibration signal is denoised and transformed into a frequency domain signal. The model consists of the two primary networks, each employing a convolutional layer and an attention module, generator (G) and discriminator (D), respectively. Latent code was incorporated into G to constrain the generated samples, and a discriminant layer was added to D to identify the interpretable features. During training, the two networks were alternately trained, and the feature mapping relationship of the pre-normalized encoder was learned by maximizing the information from the latent code and the discriminative result. The encoding that represents specific features in the vibration signal was extracted from the random noise. Ultimately, after completing adversarial learning, G is capable of generating a simulated signal of the specified feature, and D can assess the interpretable features in the vibration signal. The effectiveness of the model is validated through three typical experimental cases. This method effectively separates the discrete and continuous feature coding in the signal. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

22 pages, 1880 KiB  
Article
Generation of Face Privacy-Protected Images Based on the Diffusion Model
by Xingyi You, Xiaohu Zhao, Yue Wang and Weiqing Sun
Entropy 2024, 26(6), 479; https://doi.org/10.3390/e26060479 - 31 May 2024
Abstract
In light of growing concerns about the misuse of personal data resulting from the widespread use of artificial intelligence technology, it is necessary to implement robust privacy-protection methods. However, existing methods for protecting facial privacy suffer from issues such as poor visual quality, [...] Read more.
In light of growing concerns about the misuse of personal data resulting from the widespread use of artificial intelligence technology, it is necessary to implement robust privacy-protection methods. However, existing methods for protecting facial privacy suffer from issues such as poor visual quality, distortion and limited reusability. To tackle this challenge, we propose a novel approach called Diffusion Models for Face Privacy Protection (DIFP). Our method utilizes a face generator that is conditionally controlled and reality-guided to produce high-resolution encrypted faces that are photorealistic while preserving the naturalness and recoverability of the original facial information. We employ a two-stage training strategy to generate protected faces with guidance on identity and style, followed by an iterative technique for improving latent variables to enhance realism. Additionally, we introduce diffusion model denoising for identity recovery, which facilitates the removal of encryption and restoration of the original face when required. Experimental results demonstrate the effectiveness of our method in qualitative privacy protection, achieving high success rates in evading face-recognition tools and enabling near-perfect restoration of occluded faces. Full article
(This article belongs to the Special Issue Information Security and Data Privacy)
Show Figures

Figure 1

22 pages, 934 KiB  
Article
SF-Transformer: A Mutual Information-Enhanced Transformer Model with Spot-Forward Parity for Forecasting Long-Term Chinese Stock Index Futures Prices
by Weifang Mao, Pin Liu and Jixian Huang
Entropy 2024, 26(6), 478; https://doi.org/10.3390/e26060478 - 30 May 2024
Abstract
The complexity in stock index futures markets, influenced by the intricate interplay of human behavior, is characterized as nonlinearity and dynamism, contributing to significant uncertainty in long-term price forecasting. While machine learning models have demonstrated their efficacy in stock price forecasting, they rely [...] Read more.
The complexity in stock index futures markets, influenced by the intricate interplay of human behavior, is characterized as nonlinearity and dynamism, contributing to significant uncertainty in long-term price forecasting. While machine learning models have demonstrated their efficacy in stock price forecasting, they rely solely on historical price data, which, given the inherent volatility and dynamic nature of financial markets, are insufficient to address the complexity and uncertainty in long-term forecasting due to the limited connection between historical and forecasting prices. This paper introduces a pioneering approach that integrates financial theory with advanced deep learning methods to enhance predictive accuracy and risk management in China’s stock index futures market. The SF-Transformer model, combining spot-forward parity and the Transformer model, is proposed to improve forecasting accuracy across short and long-term horizons. Formulated upon the arbitrage-free futures pricing model, the spot-forward parity model offers variables such as stock index price, risk-free rate, and stock index dividend yield for forecasting. Our insight is that the mutual information generated by these variables has the potential to significantly reduce uncertainty in long-term forecasting. A case study on predicting major stock index futures prices in China demonstrates the superiority of the SF-Transformer model over models based on LSTM, MLP, and the stock index futures arbitrage-free pricing model, covering both short and long-term forecasting up to 28 days. Unlike existing machine learning models, the Transformer processes entire time series concurrently, leveraging its attention mechanism to discern intricate dependencies and capture long-range relationships, thereby offering a holistic understanding of time series data. An enhancement of mutual information is observed after introducing spot-forward parity in the forecasting. The variation of mutual information and ablation study results highlights the significant contributions of spot-forward parity, particularly to the long-term forecasting. Overall, these findings highlight the SF-Transformer model’s efficacy in leveraging spot-forward parity for reducing uncertainty and advancing robust and comprehensive approaches in long-term stock index futures price forecasting. Full article
(This article belongs to the Special Issue Complexity in Financial Networks)
19 pages, 773 KiB  
Article
Link Prediction in Dynamic Social Networks Combining Entropy, Causality, and a Graph Convolutional Network Model
by Xiaoli Huang, Jingyu Li and Yumiao Yuan
Entropy 2024, 26(6), 477; https://doi.org/10.3390/e26060477 - 30 May 2024
Abstract
Link prediction is recognized as a crucial means to analyze dynamic social networks, revealing the principles of social relationship evolution. However, the complex topology and temporal evolution characteristics of dynamic social networks pose significant research challenges. This study introduces an innovative fusion framework [...] Read more.
Link prediction is recognized as a crucial means to analyze dynamic social networks, revealing the principles of social relationship evolution. However, the complex topology and temporal evolution characteristics of dynamic social networks pose significant research challenges. This study introduces an innovative fusion framework that incorporates entropy, causality, and a GCN model, focusing specifically on link prediction in dynamic social networks. Firstly, the framework preprocesses the raw data, extracting and recording timestamp information between interactions. It then introduces the concept of “Temporal Information Entropy (TIE)”, integrating it into the Node2Vec algorithm’s random walk to generate initial feature vectors for nodes in the graph. A causality analysis model is subsequently applied for secondary processing of the generated feature vectors. Following this, an equal dataset is constructed by adjusting the ratio of positive and negative samples. Lastly, a dedicated GCN model is used for model training. Through extensive experimentation in multiple real social networks, the framework proposed in this study demonstrated a better performance than other methods in key evaluation indicators such as precision, recall, F1 score, and accuracy. This study provides a fresh perspective for understanding and predicting link dynamics in social networks and has significant practical value. Full article
(This article belongs to the Section Complexity)
19 pages, 731 KiB  
Article
Correlations in the EPR State Observables
by Daniel F. Orsini, Luna R. N. Oliveira and Marcos G. E. da Luz
Entropy 2024, 26(6), 476; https://doi.org/10.3390/e26060476 - 30 May 2024
Viewed by 16
Abstract
The identification and physical interpretation of arbitrary quantum correlations are not always effortless. Two features that can significantly influence the dispersion of the joint observable outcomes in a quantum bipartite system composed of systems I and II are: (a) All possible pairs of [...] Read more.
The identification and physical interpretation of arbitrary quantum correlations are not always effortless. Two features that can significantly influence the dispersion of the joint observable outcomes in a quantum bipartite system composed of systems I and II are: (a) All possible pairs of observables describing the composite are equally probable upon measurement, and (b) The absence of concurrence (positive reinforcement) between any of the observables within a particular system; implying that their associated operators do not commute. The so-called EPR states are known to observe (a). Here, we demonstrate in very general (but straightforward) terms that they also satisfy condition (b), a relevant technical fact often overlooked. As an illustration, we work out in detail the three-level systems, i.e., qutrits. Furthermore, given the special characteristics of EPR states (such as maximal entanglement, among others), one might intuitively expect the CHSH correlation, computed exclusively for the observables of qubit EPR states, to yield values greater than two, thereby violating Bell’s inequality. We show such a prediction does not hold true. In fact, the combined properties of (a) and (b) lead to a more limited range of values for the CHSH measure, not surpassing the nonlocality threshold of two. The present constitutes an instructive example of the subtleties of quantum correlations. Full article
(This article belongs to the Special Issue Quantum Probability and Randomness V)
Show Figures

Figure 1

15 pages, 3916 KiB  
Article
Photosensitive Control and Network Synchronization of Chemical Oscillators
by Alejandro Carballosa, Ana I. Gomez-Varela, Carmen Bao-Varela, Maria Teresa Flores-Arias and Alberto P. Muñuzuri
Entropy 2024, 26(6), 475; https://doi.org/10.3390/e26060475 - 30 May 2024
Viewed by 30
Abstract
The Belousov–Zhabotinsky (BZ) reaction has long been a paradigmatic system for studying chemical oscillations. Here, we experimentally studied the synchronization control within photochemically coupled star networks of BZ oscillators. Experiments were carried out in wells performed in soda-lime glass constructed using novel laser [...] Read more.
The Belousov–Zhabotinsky (BZ) reaction has long been a paradigmatic system for studying chemical oscillations. Here, we experimentally studied the synchronization control within photochemically coupled star networks of BZ oscillators. Experiments were carried out in wells performed in soda-lime glass constructed using novel laser technologies. Utilizing the inherent oscillatory nature of the BZ reaction, we engineered a star network of oscillators interconnected through photochemical inhibitory coupling. Furthermore, the experimental setup presented here could be extrapolated to more complex network architectures with both excitatory and inhibitory couplings, contributing to the fundamental understanding of synchronization in complex systems. Full article
(This article belongs to the Special Issue Nonlinear Dynamical Behaviors in Complex Systems)
Show Figures

Figure 1

13 pages, 18755 KiB  
Article
Bayesian Spatio-Temporal Modeling of the Dynamics of COVID-19 Deaths in Peru
by César Raúl Castro Galarza, Omar Nolberto Díaz Sánchez, Jonatha Sousa Pimentel, Rodrigo Bulhões, Javier Linkolk López-Gonzales and Paulo Canas Rodrigues
Entropy 2024, 26(6), 474; https://doi.org/10.3390/e26060474 - 30 May 2024
Viewed by 71
Abstract
Amid the COVID-19 pandemic, understanding the spatial and temporal dynamics of the disease is crucial for effective public health interventions. This study aims to analyze COVID-19 data in Peru using a Bayesian spatio-temporal generalized linear model to elucidate mortality patterns and assess the [...] Read more.
Amid the COVID-19 pandemic, understanding the spatial and temporal dynamics of the disease is crucial for effective public health interventions. This study aims to analyze COVID-19 data in Peru using a Bayesian spatio-temporal generalized linear model to elucidate mortality patterns and assess the impact of vaccination efforts. Leveraging data from 194 provinces over 651 days, our analysis reveals heterogeneous spatial and temporal patterns in COVID-19 mortality rates. Higher vaccination coverage is associated with reduced mortality rates, emphasizing the importance of vaccination in mitigating the pandemic’s impact. The findings underscore the value of spatio-temporal data analysis in understanding disease dynamics and guiding targeted public health interventions. Full article
(This article belongs to the Special Issue Bayesianism)
Show Figures

Figure 1

10 pages, 2107 KiB  
Article
Revisiting the Transferability of Few-Shot Image Classification: A Frequency Spectrum Perspective
by Min Zhang, Zhitao Wang and Donglin Wang
Entropy 2024, 26(6), 473; https://doi.org/10.3390/e26060473 - 29 May 2024
Viewed by 170
Abstract
Few-shot learning, especially few-shot image classification (FSIC), endeavors to recognize new categories using only a handful of labeled images by transferring knowledge from a model trained on base categories. Despite numerous efforts to address the challenge of deficient transferability caused by the distribution [...] Read more.
Few-shot learning, especially few-shot image classification (FSIC), endeavors to recognize new categories using only a handful of labeled images by transferring knowledge from a model trained on base categories. Despite numerous efforts to address the challenge of deficient transferability caused by the distribution shift between the base and new classes, the fundamental principles remain a subject of debate. In this paper, we elucidate why a decline in performance occurs and what information is transferred during the testing phase, examining it from a frequency spectrum perspective. Specifically, we adopt causality on the frequency space for FSIC. With our causal assumption, non-causal frequencies (e.g., background knowledge) act as confounders between causal frequencies (e.g., object information) and predictions. Our experimental results reveal that different frequency components represent distinct semantics, and non-causal frequencies adversely affect transferability, resulting in suboptimal performance. Subsequently, we suggest a straightforward but potent approach, namely the FrequencySpectrumMask (FRSM), to weight the frequency and mitigate the impact of non-causal frequencies. Extensive experiments demonstrate that the proposed FRSM method significantly enhanced the transferability of the FSIC model across nine testing datasets. Full article
(This article belongs to the Section Multidisciplinary Applications)
15 pages, 290 KiB  
Article
Analytic Formulae for T Violation in Neutrino Oscillations
by Osamu Yasuda
Entropy 2024, 26(6), 472; https://doi.org/10.3390/e26060472 - 29 May 2024
Viewed by 130
Abstract
Recently, a concept known as μTRISTAN, which involves the acceleration of μ+, has been proposed. This initiative has led to considerations of a new design for a neutrino factory. Additionally, leveraging the polarization of μ+, measurements of T [...] Read more.
Recently, a concept known as μTRISTAN, which involves the acceleration of μ+, has been proposed. This initiative has led to considerations of a new design for a neutrino factory. Additionally, leveraging the polarization of μ+, measurements of T violation in neutrino oscillations are also being explored. In this paper, we present analytical expressions for T violation in neutrino oscillations within the framework of standard three-flavor neutrino oscillations, a scenario involving nonstandard interactions, and a case of unitarity violation. We point out that examining the energy spectrum of T violation may be useful for probing new physics effects. Full article
18 pages, 934 KiB  
Article
Hilbert Space Delocalization under Random Unitary Circuits
by Xhek Turkeshi and Piotr Sierant
Entropy 2024, 26(6), 471; https://doi.org/10.3390/e26060471 - 29 May 2024
Viewed by 87
Abstract
The unitary dynamics of a quantum system initialized in a selected basis state yield, generically, a state that is a superposition of all the basis states. This process, associated with the quantum information scrambling and intimately tied to the resource theory of coherence, [...] Read more.
The unitary dynamics of a quantum system initialized in a selected basis state yield, generically, a state that is a superposition of all the basis states. This process, associated with the quantum information scrambling and intimately tied to the resource theory of coherence, may be viewed as a gradual delocalization of the system’s state in the Hilbert space. This work analyzes the Hilbert space delocalization under the dynamics of random quantum circuits, which serve as a minimal model of the chaotic dynamics of quantum many-body systems. We employ analytical methods based on the replica trick and Weingarten calculus to investigate the time evolution of the participation entropies which quantify the Hilbert space delocalization. We demonstrate that the participation entropies approach, up to a fixed accuracy, their long-time saturation value in times that scale logarithmically with the system size. Exact numerical simulations and tensor network techniques corroborate our findings. Full article
(This article belongs to the Section Quantum Information)
17 pages, 2006 KiB  
Article
View-Driven Multi-View Clustering via Contrastive Double-Learning
by Shengcheng Liu, Changming Zhu, Zishi Li, Zhiyuan Yang and Wenjie Gu
Entropy 2024, 26(6), 470; https://doi.org/10.3390/e26060470 - 29 May 2024
Viewed by 92
Abstract
Multi-view clustering requires simultaneous attention to both consistency and the diversity of information between views. Deep learning techniques have shown impressive abilities to learn complex features when working with extensive datasets; however, existing deep multi-view clustering methods often focus only on either consistency [...] Read more.
Multi-view clustering requires simultaneous attention to both consistency and the diversity of information between views. Deep learning techniques have shown impressive abilities to learn complex features when working with extensive datasets; however, existing deep multi-view clustering methods often focus only on either consistency information or diversity information, making it difficult to balance both aspects. Therefore, this paper proposes a view-driven multi-view clustering using the contrastive double-learning method (VMC-CD), aiming to generate better clustering results. This method first adopts a view-driven approach to consider information from other views to encourage diversity, thus guiding feature learning. Additionally, it presents the idea of dual contrastive learning to enhance the alignment of views at both the clustering and feature levels. The VMC-CD method’s superiority over various cutting-edge methods is substantiated by experimental findings across three datasets, affirming its effectiveness. Full article
(This article belongs to the Section Multidisciplinary Applications)
16 pages, 1193 KiB  
Article
TransConv: Transformer Meets Contextual Convolution for Unsupervised Domain Adaptation
by Junchi Liu, Xiang Zhang and Zhigang Luo
Entropy 2024, 26(6), 469; https://doi.org/10.3390/e26060469 - 29 May 2024
Viewed by 190
Abstract
Unsupervised domain adaptation (UDA) aims to reapply the classifier to be ever-trained on a labeled source domain to a related unlabeled target domain. Recent progress in this line has evolved with the advance of network architectures from convolutional neural networks (CNNs) to transformers [...] Read more.
Unsupervised domain adaptation (UDA) aims to reapply the classifier to be ever-trained on a labeled source domain to a related unlabeled target domain. Recent progress in this line has evolved with the advance of network architectures from convolutional neural networks (CNNs) to transformers or both hybrids. However, this advance has to pay the cost of high computational overheads or complex training processes. In this paper, we propose an efficient alternative hybrid architecture by marrying transformer to contextual convolution (TransConv) to solve UDA tasks. Different from previous transformer based UDA architectures, TransConv has two special aspects: (1) reviving the multilayer perception (MLP) of transformer encoders with Gaussian channel attention fusion for robustness, and (2) mixing contextual features to highly efficient dynamic convolutions for cross-domain interaction. As a result, TransConv enables to calibrate interdomain feature semantics from the global features and the local ones. Experimental results on five benchmarks show that TransConv attains remarkable results with high efficiency as compared to the existing UDA methods. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

23 pages, 7106 KiB  
Article
A Convolutional Neural Network-Based Quantization Method for Block Compressed Sensing of Images
by Jiulu Gong, Qunlin Chen, Wei Zhu and Zepeng Wang
Entropy 2024, 26(6), 468; https://doi.org/10.3390/e26060468 - 29 May 2024
Viewed by 144
Abstract
Block compressed sensing (BCS) is a promising method for resource-constrained image/video coding applications. However, the quantization of BCS measurements has posed a challenge, leading to significant quantization errors and encoding redundancy. In this paper, we propose a quantization method for BCS measurements using [...] Read more.
Block compressed sensing (BCS) is a promising method for resource-constrained image/video coding applications. However, the quantization of BCS measurements has posed a challenge, leading to significant quantization errors and encoding redundancy. In this paper, we propose a quantization method for BCS measurements using convolutional neural networks (CNN). The quantization process maps measurements to quantized data that follow a uniform distribution based on the measurements’ distribution, which aims to maximize the amount of information carried by the quantized data. The dequantization process restores the quantized data to data that conform to the measurements’ distribution. The restored data are then modified by the correlation information of the measurements drawn from the quantized data, with the goal of minimizing the quantization errors. The proposed method uses CNNs to construct quantization and dequantization processes, and the networks are trained jointly. The distribution parameters of each block are used as side information, which is quantized with 1 bit by the same method. Extensive experiments on four public datasets showed that, compared with uniform quantization and entropy coding, the proposed method can improve the PSNR by an average of 0.48 dB without using entropy coding when the compression bit rate is 0.1 bpp. Full article
(This article belongs to the Special Issue Information Theory and Coding for Image/Video Processing)
Show Figures

Figure 1

15 pages, 8021 KiB  
Article
A TCN-Linear Hybrid Model for Chaotic Time Series Forecasting
by Mengjiao Wang and Fengtai Qin
Entropy 2024, 26(6), 467; https://doi.org/10.3390/e26060467 - 29 May 2024
Viewed by 165
Abstract
The applications of deep learning and artificial intelligence have permeated daily life, with time series prediction emerging as a focal area of research due to its significance in data analysis. The evolution of deep learning methods for time series prediction has progressed from [...] Read more.
The applications of deep learning and artificial intelligence have permeated daily life, with time series prediction emerging as a focal area of research due to its significance in data analysis. The evolution of deep learning methods for time series prediction has progressed from the Convolutional Neural Network (CNN) and the Recurrent Neural Network (RNN) to the recently popularized Transformer network. However, each of these methods has encountered specific issues. Recent studies have questioned the effectiveness of the self-attention mechanism in Transformers for time series prediction, prompting a reevaluation of approaches to LTSF (Long Time Series Forecasting) problems. To circumvent the limitations present in current models, this paper introduces a novel hybrid network, Temporal Convolutional Network-Linear (TCN-Linear), which leverages the temporal prediction capabilities of the Temporal Convolutional Network (TCN) to enhance the capacity of LSTF-Linear. Time series from three classical chaotic systems (Lorenz, Mackey–Glass, and Rossler) and real-world stock data serve as experimental datasets. Numerical simulation results indicate that, compared to classical networks and novel hybrid models, our model achieves the lowest RMSE, MAE, and MSE with the fewest training parameters, and its R2 value is the closest to 1. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

19 pages, 2033 KiB  
Article
MV–MR: Multi-Views and Multi-Representations for Self-Supervised Learning and Knowledge Distillation
by Vitaliy Kinakh, Mariia Drozdova and Slava Voloshynovskiy
Entropy 2024, 26(6), 466; https://doi.org/10.3390/e26060466 - 29 May 2024
Viewed by 129
Abstract
We present a new method of self-supervised learning and knowledge distillation based on multi-views and multi-representations (MV–MR). MV–MR is based on the maximization of dependence between learnable embeddings from augmented and non-augmented views, jointly with the maximization of dependence between learnable embeddings from [...] Read more.
We present a new method of self-supervised learning and knowledge distillation based on multi-views and multi-representations (MV–MR). MV–MR is based on the maximization of dependence between learnable embeddings from augmented and non-augmented views, jointly with the maximization of dependence between learnable embeddings from the augmented view and multiple non-learnable representations from the non-augmented view. We show that the proposed method can be used for efficient self-supervised classification and model-agnostic knowledge distillation. Unlike other self-supervised techniques, our approach does not use any contrastive learning, clustering, or stop gradients. MV–MR is a generic framework allowing the incorporation of constraints on the learnable embeddings via the usage of image multi-representations as regularizers. The proposed method is used for knowledge distillation. MV–MR provides state-of-the-art self-supervised performance on the STL10 and CIFAR20 datasets in a linear evaluation setup. We show that a low-complexity ResNet50 model pretrained using proposed knowledge distillation based on the CLIP ViT model achieves state-of-the-art performance on STL10 and CIFAR100 datasets. Full article
(This article belongs to the Special Issue Information Theory for Interpretable Machine Learning)
Show Figures

Figure 1

19 pages, 7091 KiB  
Article
Analysis of Vibration Characteristics of Bridge Structures under Seismic Excitation
by Ling’ai Li and Shengxiang Huang
Entropy 2024, 26(6), 465; https://doi.org/10.3390/e26060465 - 29 May 2024
Viewed by 153
Abstract
Bridges may undergo structural vibration responses when exposed to seismic waves. An analysis of structural vibration characteristics is essential for evaluating the safety and stability of a bridge. In this paper, a signal time-frequency feature extraction method (NTFT-ESVD) integrating standard time-frequency transformation, singular [...] Read more.
Bridges may undergo structural vibration responses when exposed to seismic waves. An analysis of structural vibration characteristics is essential for evaluating the safety and stability of a bridge. In this paper, a signal time-frequency feature extraction method (NTFT-ESVD) integrating standard time-frequency transformation, singular value decomposition, and information entropy is proposed to analyze the vibration characteristics of structures under seismic excitation. First, the experiment simulates the response signal of the structure when exposed to seismic waves. The results of the time-frequency analysis indicate a maximum relative error of only 1% in frequency detection, and the maximum relative errors in amplitude and time parameters are 5.9% and 6%, respectively. These simulation results demonstrate the reliability of the NTFT-ESVD method in extracting the time-frequency characteristics of the signal and its suitability for analyzing the seismic response of the structure. Then, a real seismic wave event of the Su-Tong Yangtze River Bridge during the Hengchun earthquake in Taiwan (2006) is analyzed. The results show that the seismic waves only have a short-term impact on the bridge, with the maximum amplitude of the vibration response no greater than 1 cm, and the maximum vibration frequency no greater than 0.2 Hz in the three-dimensional direction, indicating that the earthquake in Hengchun will not have any serious impact on the stability and security of the Su-Tong Yangtze River Bridge. Additionally, the reliability of determining the arrival time of seismic waves by extracting the time-frequency information from structural vibration response signals is validated by comparing it with results from seismic stations (SSE/WHN/QZN) at similar epicenter distances published by the USGS. The results of the case study show that the combination of dynamic GNSS monitoring technology and time-frequency analysis can be used to analyze the impact of seismic waves on the bridge, which is of great help to the manager in assessing structural seismic damage. Full article
(This article belongs to the Section Multidisciplinary Applications)
Show Figures

Figure 1

22 pages, 8291 KiB  
Article
Viewpoint Selection for 3D-Games with f-Divergences
by Micaela Y. Martin, Mateu Sbert and Miguel Chover
Entropy 2024, 26(6), 464; https://doi.org/10.3390/e26060464 - 29 May 2024
Viewed by 140
Abstract
In this paper, we present a novel approach for the optimal camera selection in video games. The new approach explores the use of information theoretic metrics f-divergences, to measure the correlation between the objects as viewed in camera frustum and the ideal or [...] Read more.
In this paper, we present a novel approach for the optimal camera selection in video games. The new approach explores the use of information theoretic metrics f-divergences, to measure the correlation between the objects as viewed in camera frustum and the ideal or target view. The f-divergences considered are the Kullback–Leibler divergence or relative entropy, the total variation and the χ2 divergence. Shannon entropy is also used for comparison purposes. The visibility is measured using the differential form factors from the camera to objects and is computed by casting rays with importance sampling Monte Carlo. Our method allows a very fast dynamic selection of the best viewpoints, which can take into account changes in the scene, in the ideal or target view, and in the objectives of the game. Our prototype is implemented in Unity engine, and our results show an efficient selection of the camera and an improved visual quality. The most discriminating results are obtained with the use of Kullback–Leibler divergence. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

12 pages, 1160 KiB  
Article
Entropy Production in Reaction–Diffusion Systems Confined in Narrow Channels
by Guillermo Chacón-Acosta and Mayra Núñez-López
Entropy 2024, 26(6), 463; https://doi.org/10.3390/e26060463 - 29 May 2024
Viewed by 193
Abstract
This work analyzes the effect of wall geometry when a reaction–diffusion system is confined to a narrow channel. In particular, we study the entropy production density in the reversible Gray–Scott system. Using an effective diffusion equation that considers modifications by the channel characteristics, [...] Read more.
This work analyzes the effect of wall geometry when a reaction–diffusion system is confined to a narrow channel. In particular, we study the entropy production density in the reversible Gray–Scott system. Using an effective diffusion equation that considers modifications by the channel characteristics, we find that the entropy density changes its value but not its qualitative behavior, which helps explore the structure-formation space. Full article
Show Figures

Figure 1

11 pages, 3522 KiB  
Article
High-Throughput Polar Code Decoders with Information Bottleneck Quantization
by Claus Kestel, Lucas Johannsen and Norbert Wehn
Entropy 2024, 26(6), 462; https://doi.org/10.3390/e26060462 - 28 May 2024
Viewed by 185
Abstract
In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next-generation mobile broadband standards and an ongoing research topic. Quantization [...] Read more.
In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next-generation mobile broadband standards and an ongoing research topic. Quantization has a significant impact on the decoder area, power consumption and throughput. Thus, lower bit widths are preferred for efficient implementations but degrade the error correction capability. To address this issue, a non-uniform quantization based on the Information Bottleneck (IB) method is proposed that enables a low bit width while maintaining the essential information. Many investigations on the use of the IB method for Low-density parity-check code) LDPC decoders exist and have shown its advantages from an implementation perspective. However, for polar code decoder implementations, there exists only one publication that is not based on the state-of-the-art Fast Simplified Successive-Cancellation (Fast-SSC) decoding algorithm, and only synthesis implementation results without energy estimation are shown. In contrast, our paper presents several optimized Fast-SSC polar code decoder implementations using IB-based quantization with placement and routing results using advanced 12 nm FinFET technology. Gains of up to 16% in area and 13% in energy efficiency are achieved with IB-based quantization at a Frame Error Rate (FER) of 107 and a polar code of N=1024,R=0.5 compared to state-of-the-art decoders. Full article
(This article belongs to the Special Issue Intelligent Information Processing and Coding for B5G Communications)
Show Figures

Figure 1

38 pages, 6602 KiB  
Article
Leveraging Data Locality in Quantum Convolutional Classifiers
by Mingyoung Jeng, Alvir Nobel, Vinayak Jha, David Levy, Dylan Kneidel, Manu Chaudhary, Ishraq Islam, Audrey Facer, Manish Singh, Evan Baumgartner, Eade Vanderhoof, Abina Arshad and Esam El-Araby
Entropy 2024, 26(6), 461; https://doi.org/10.3390/e26060461 - 28 May 2024
Viewed by 181
Abstract
Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than a fully connected [...] Read more.
Quantum computing (QC) has opened the door to advancements in machine learning (ML) tasks that are currently implemented in the classical domain. Convolutional neural networks (CNNs) are classical ML architectures that exploit data locality and possess a simpler structure than a fully connected multi-layer perceptrons (MLPs) without compromising the accuracy of classification. However, the concept of preserving data locality is usually overlooked in the existing quantum counterparts of CNNs, particularly for extracting multifeatures in multidimensional data. In this paper, we present an multidimensional quantum convolutional classifier (MQCC) that performs multidimensional and multifeature quantum convolution with average and Euclidean pooling, thus adapting the CNN structure to a variational quantum algorithm (VQA). The experimental work was conducted using multidimensional data to validate the correctness and demonstrate the scalability of the proposed method utilizing both noisy and noise-free quantum simulations. We evaluated the MQCC model with reference to reported work on state-of-the-art quantum simulators from IBM Quantum and Xanadu using a variety of standard ML datasets. The experimental results show the favorable characteristics of our proposed techniques compared with existing work with respect to a number of quantitative metrics, such as the number of training parameters, cross-entropy loss, classification accuracy, circuit depth, and quantum gate count. Full article
(This article belongs to the Special Issue Quantum Computation, Communication and Cryptography)
Show Figures

Figure 1

Previous Issue
Back to TopTop