Journal Description
Entropy
Entropy
is an international and interdisciplinary peer-reviewed open access journal of entropy and information studies, published monthly online by MDPI. The International Society for the Study of Information (IS4SI) and Spanish Society of Biomedical Engineering (SEIB) are affiliated with Entropy and their members receive a discount on the article processing charge.
- Open Access— free for readers, with article processing charges (APC) paid by authors or their institutions.
- High Visibility: indexed within Scopus, SCIE (Web of Science), MathSciNet, Inspec, PubMed, PMC, Astrophysics Data System, and other databases.
- Journal Rank: JCR - Q2 (Physics, Multidisciplinary) / CiteScore - Q1 (Mathematical Physics)
- Rapid Publication: manuscripts are peer-reviewed and a first decision is provided to authors approximately 20.8 days after submission; acceptance to publication is undertaken in 2.9 days (median values for papers published in this journal in the second half of 2023).
- Recognition of Reviewers: reviewers who provide timely, thorough peer-review reports receive vouchers entitling them to a discount on the APC of their next publication in any MDPI journal, in appreciation of the work done.
- Testimonials: See what our editors and authors say about Entropy.
- Companion journals for Entropy include: Foundations, Thermo and MAKE.
Impact Factor:
2.7 (2022);
5-Year Impact Factor:
2.6 (2022)
Latest Articles
HAG-NET: Hiding Data and Adversarial Attacking with Generative Adversarial Network
Entropy 2024, 26(3), 269; https://doi.org/10.3390/e26030269 (registering DOI) - 19 Mar 2024
Abstract
Recent studies on watermarking techniques based on image carriers have demonstrated new approaches that combine adversarial perturbations against steganalysis with embedding distortions. However, while these methods successfully counter convolutional neural network-based steganalysis, they do not adequately protect the data of the carrier itself.
[...] Read more.
Recent studies on watermarking techniques based on image carriers have demonstrated new approaches that combine adversarial perturbations against steganalysis with embedding distortions. However, while these methods successfully counter convolutional neural network-based steganalysis, they do not adequately protect the data of the carrier itself. Recognizing the high sensitivity of Deep Neural Networks (DNNs) to small perturbations, we propose HAG-NET, a method based on image carriers, which is jointly trained by the encoder, decoder, and attacker. In this paper, the encoder generates Adversarial Steganographic Examples (ASEs) that are adversarial to the target classification network, thereby providing protection for the carrier data. Additionally, the decoder can recover secret data from ASEs. The experimental results demonstrate that ASEs produced by HAG-NET achieve an average success rate of over 99% on both the MNIST and CIFAR-10 datasets. ASEs generated with the attacker exhibit greater robustness in terms of attack ability, with an average increase of about 3.32%. Furthermore, our method, when compared with other generative stego examples under similar perturbation strength, contains significantly more information according to image information entropy measurements.
Full article
(This article belongs to the Topic Computational Complex Networks)
►
Show Figures
Open AccessFeature PaperArticle
Game Theoretic Clustering for Finding Strong Communities
by
Chao Zhao, Ali Al-Bashabsheh and Chung Chan
Entropy 2024, 26(3), 268; https://doi.org/10.3390/e26030268 (registering DOI) - 18 Mar 2024
Abstract
We address the challenge of identifying meaningful communities by proposing a model based on convex game theory and a measure of community strength. Many existing community detection methods fail to provide unique solutions, and it remains unclear how the solutions depend on initial
[...] Read more.
We address the challenge of identifying meaningful communities by proposing a model based on convex game theory and a measure of community strength. Many existing community detection methods fail to provide unique solutions, and it remains unclear how the solutions depend on initial conditions. Our approach identifies strong communities with a hierarchical structure, visualizable as a dendrogram, and computable in polynomial time using submodular function minimization. This framework extends beyond graphs to hypergraphs or even polymatroids. In the case when the model is graphical, a more efficient algorithm based on the max-flow min-cut algorithm can be devised. Though not achieving near-linear time complexity, the pursuit of practical algorithms is an intriguing avenue for future research. Our work serves as the foundation, offering an analytical framework that yields unique solutions with clear operational meaning for the communities identified.
Full article
Open AccessArticle
(Re)Construction of Quantum Space-Time: Transcribing Hilbert into Configuration Space
by
Karl Svozil
Entropy 2024, 26(3), 267; https://doi.org/10.3390/e26030267 - 18 Mar 2024
Abstract
Space-time in quantum mechanics is about bridging Hilbert and configuration space. Thereby, an entirely new perspective is obtained by replacing the Newtonian space-time theater with the image of a presumably high-dimensional Hilbert space, through which space-time becomes an epiphenomenon construed by internal observers.
[...] Read more.
Space-time in quantum mechanics is about bridging Hilbert and configuration space. Thereby, an entirely new perspective is obtained by replacing the Newtonian space-time theater with the image of a presumably high-dimensional Hilbert space, through which space-time becomes an epiphenomenon construed by internal observers.
Full article
(This article belongs to the Special Issue Quantum Information and Probability: From Foundations to Engineering II)
Open AccessArticle
Group Structure as a Foundation for Entropies
by
Henrik Jeldtoft Jensen and Piergiulio Tempesta
Entropy 2024, 26(3), 266; https://doi.org/10.3390/e26030266 - 18 Mar 2024
Abstract
Entropy can signify different things. For instance, heat transfer in thermodynamics or a measure of information in data analysis. Many entropies have been introduced, and it can be difficult to ascertain their respective importance and merits. Here, we consider entropy in an abstract
[...] Read more.
Entropy can signify different things. For instance, heat transfer in thermodynamics or a measure of information in data analysis. Many entropies have been introduced, and it can be difficult to ascertain their respective importance and merits. Here, we consider entropy in an abstract sense, as a functional on a probability space, and we review how being able to handle the trivial case of non-interacting systems, together with the subtle requirement of extensivity, allows for a systematic classification of the functional form.
Full article
(This article belongs to the Special Issue Nonadditive Entropies and Nonextensive Statistical Mechanics—Dedicated to Professor Constantino Tsallis on the Occasion of His 80th Birthday)
Open AccessArticle
Exact Results for Non-Newtonian Transport Properties in Sheared Granular Suspensions: Inelastic Maxwell Models and BGK-Type Kinetic Model
by
Rubén Gómez González and Vicente Garzó
Entropy 2024, 26(3), 265; https://doi.org/10.3390/e26030265 - 15 Mar 2024
Abstract
The Boltzmann kinetic equation for dilute granular suspensions under simple (or uniform) shear flow (USF) is considered to determine the non-Newtonian transport properties of the system. In contrast to previous attempts based on a coarse-grained description, our suspension model accounts for the real
[...] Read more.
The Boltzmann kinetic equation for dilute granular suspensions under simple (or uniform) shear flow (USF) is considered to determine the non-Newtonian transport properties of the system. In contrast to previous attempts based on a coarse-grained description, our suspension model accounts for the real collisions between grains and particles of the surrounding molecular gas. The latter is modeled as a bath (or thermostat) of elastic hard spheres at a given temperature. Two independent but complementary approaches are followed to reach exact expressions for the rheological properties. First, the Boltzmann equation for the so-called inelastic Maxwell models (IMM) is considered. The fact that the collision rate of IMM is independent of the relative velocity of the colliding spheres allows us to exactly compute the collisional moments of the Boltzmann operator without the knowledge of the distribution function. Thanks to this property, the transport properties of the sheared granular suspension can be exactly determined. As a second approach, a Bhatnagar–Gross–Krook (BGK)-type kinetic model adapted to granular suspensions is solved to compute the velocity moments and the velocity distribution function of the system. The theoretical results (which are given in terms of the coefficient of restitution, the reduced shear rate, the reduced background temperature, and the diameter and mass ratios) show, in general, a good agreement with the approximate analytical results derived for inelastic hard spheres (IHS) by means of Grad’s moment method and with computer simulations performed in the Brownian limiting case ( , where and m are the masses of the particles of the molecular and granular gases, respectively). In addition, as expected, the IMM and BGK results show that the temperature and non-Newtonian viscosity exhibit an S shape in a plane of stress–strain rate (discontinuous shear thickening, DST). The DST effect becomes more pronounced as the mass ratio increases.
Full article
(This article belongs to the Special Issue 180th Anniversary of Ludwig Boltzmann)
►▼
Show Figures
Figure 1
Open AccessArticle
Exploration of Resonant Modes for Circular and Polygonal Chladni Plates
by
Amira Val Baker, Mate Csanad, Nicolas Fellas, Nour Atassi, Ia Mgvdliashvili and Paul Oomen
Entropy 2024, 26(3), 264; https://doi.org/10.3390/e26030264 - 15 Mar 2024
Abstract
In general, sound waves propagate radially outwards from a point source. These waves will continue in the same direction, decreasing in intensity, unless a boundary condition is met. To arrive at a universal understanding of the relation between frequency and wave propagation within
[...] Read more.
In general, sound waves propagate radially outwards from a point source. These waves will continue in the same direction, decreasing in intensity, unless a boundary condition is met. To arrive at a universal understanding of the relation between frequency and wave propagation within spatial boundaries, we explore the maximum entropy states that are realized as resonant modes. For both circular and polygonal Chladni plates, a model is presented that successfully recreates the nodal line patterns to a first approximation. We discuss the benefits of such a model and the future work necessary to develop the model to its full predictive ability.
Full article
(This article belongs to the Section Signal and Data Analysis)
►▼
Show Figures
Figure 1
Open AccessArticle
A Numerical Study of Quantum Entropy and Information in the Wigner–Fokker–Planck Equation for Open Quantum Systems
by
Arash Edrisi, Hamza Patwa and Jose A. Morales Escalante
Entropy 2024, 26(3), 263; https://doi.org/10.3390/e26030263 - 14 Mar 2024
Abstract
Kinetic theory provides modeling of open quantum systems subject to Markovian noise via the Wigner–Fokker–Planck equation, which is an alternate of the Lindblad master equation setting, having the advantage of great physical intuition as it is the quantum equivalent of the classical phase
[...] Read more.
Kinetic theory provides modeling of open quantum systems subject to Markovian noise via the Wigner–Fokker–Planck equation, which is an alternate of the Lindblad master equation setting, having the advantage of great physical intuition as it is the quantum equivalent of the classical phase space description. We perform a numerical inspection of the Wehrl entropy for the benchmark problem of a harmonic potential, since the existence of a steady state and its analytical formula have been proven theoretically in this case. When there is friction in the noise terms, no theoretical results on the monotonicity of absolute entropy are available. We provide numerical results of the time evolution of the entropy in the case with friction using a stochastic (Euler–Maruyama-based Monte Carlo) numerical solver. For all the chosen initial conditions studied (all of them Gaussian states), up to the inherent numerical error of the method, one cannot disregard the possibility of monotonic behavior even in the case under study, where the noise includes friction terms.
Full article
(This article belongs to the Special Issue 180th Anniversary of Ludwig Boltzmann)
►▼
Show Figures
Figure 1
Open AccessArticle
CNN-HT: A Two-Stage Algorithm Selection Framework
by
Siyi Xu, Wenwen Liu, Chengpei Wu and Junli Li
Entropy 2024, 26(3), 262; https://doi.org/10.3390/e26030262 - 14 Mar 2024
Abstract
The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper
[...] Read more.
The No Free Lunch Theorem tells us that no algorithm can beat other algorithms on all types of problems. The algorithm selection structure is proposed to select the most suitable algorithm from a set of algorithms for an unknown optimization problem. This paper introduces an innovative algorithm selection approach called the CNN-HT, which is a two-stage algorithm selection framework. In the first stage, a Convolutional Neural Network (CNN) is employed to classify problems. In the second stage, the Hypothesis Testing (HT) technique is used to suggest the best-performing algorithm based on the statistical analysis of the performance metric of algorithms that address various problem categories. The two-stage approach can adapt to different algorithm combinations without the need to retrain the entire model, and modifications can be made in the second stage only, which is an improvement of one-stage approaches. To provide a more general structure for the classification model, we adopt Exploratory Landscape Analysis (ELA) features of the problem as input and utilize feature selection techniques to reduce the redundant ones. In problem classification, the average accuracy of classifying problems using CNN is 96%, which demonstrates the advantages of CNN compared to Random Forest and Support Vector Machines. After feature selection, the accuracy increases to 98.8%, further improving the classification performance while reducing the computational cost. This demonstrates the effectiveness of the first stage of the CNN-HT method, which provides a basis for algorithm selection. In the experiments, CNN-HT shows the advantages of the second stage algorithm as well as good performance with better average rankings in different algorithm combinations compared to the individual algorithms and another algorithm combination approach.
Full article
(This article belongs to the Special Issue Swarm Intelligence Optimization: Algorithms and Applications)
►▼
Show Figures
Figure 1
Open AccessArticle
Magnetic Black Hole Thermodynamics in an Extended Phase Space with Nonlinear Electrodynamics
by
Sergey Il’ich Kruglov
Entropy 2024, 26(3), 261; https://doi.org/10.3390/e26030261 - 14 Mar 2024
Abstract
We study Einstein’s gravity coupled to nonlinear electrodynamics with two parameters in anti-de Sitter spacetime. Magnetically charged black holes in an extended phase space are investigated. We obtain the mass and metric functions and the asymptotic and corrections to the Reissner–Nordström metric function
[...] Read more.
We study Einstein’s gravity coupled to nonlinear electrodynamics with two parameters in anti-de Sitter spacetime. Magnetically charged black holes in an extended phase space are investigated. We obtain the mass and metric functions and the asymptotic and corrections to the Reissner–Nordström metric function when the cosmological constant vanishes. The first law of black hole thermodynamics in an extended phase space is formulated and the magnetic potential and the thermodynamic conjugate to the coupling are obtained. We prove the generalized Smarr relation. The heat capacity and the Gibbs free energy are computed and the phase transitions are studied. It is shown that the electric fields of charged objects at the origin and the electrostatic self-energy are finite within the nonlinear electrodynamics proposed.
Full article
(This article belongs to the Special Issue Trends in the Second Law of Thermodynamics)
►▼
Show Figures
Figure 1
Open AccessArticle
Restoring the Fluctuation–Dissipation Theorem in Kardar–Parisi–Zhang Universality Class through a New Emergent Fractal Dimension
by
Márcio S. Gomes-Filho, Pablo de Castro, Danilo B. Liarte and Fernando A. Oliveira
Entropy 2024, 26(3), 260; https://doi.org/10.3390/e26030260 - 14 Mar 2024
Abstract
The Kardar–Parisi–Zhang (KPZ) equation describes a wide range of growth-like phenomena, with applications in physics, chemistry and biology. There are three central questions in the study of KPZ growth: the determination of height probability distributions; the search for ever more precise universal growth
[...] Read more.
The Kardar–Parisi–Zhang (KPZ) equation describes a wide range of growth-like phenomena, with applications in physics, chemistry and biology. There are three central questions in the study of KPZ growth: the determination of height probability distributions; the search for ever more precise universal growth exponents; and the apparent absence of a fluctuation–dissipation theorem (FDT) for spatial dimension . Notably, these questions were answered exactly only for dimensions. In this work, we propose a new FDT valid for the KPZ problem in dimensions. This is achieved by rearranging terms and identifying a new correlated noise which we argue to be characterized by a fractal dimension . We present relations between the KPZ exponents and two emergent fractal dimensions, namely , of the rough interface, and . Also, we simulate KPZ growth to obtain values for transient versions of the roughness exponent , the surface fractal dimension and, through our relations, the noise fractal dimension . Our results indicate that KPZ may have at least two fractal dimensions and that, within this proposal, an FDT is restored. Finally, we provide new insights into the old question about the upper critical dimension of the KPZ universality class.
Full article
(This article belongs to the Special Issue A Journey Through Complex Landscapes—Dedicated to Professor Giorgio Parisi to Celebrate the Nobel Prize & His 75th Birthday)
►▼
Show Figures
Figure 1
Open AccessArticle
Differential Entropy-Based Fault-Detection Mechanism for Power-Constrained Networked Control Systems
by
Alejandro J. Rojas
Entropy 2024, 26(3), 259; https://doi.org/10.3390/e26030259 - 14 Mar 2024
Abstract
In this work, we consider the design of power-constrained networked control systems (NCSs) and a differential entropy-based fault-detection mechanism. For the NCS design of the control loop, we consider faults in the plant gain and unstable plant pole locations, either due to natural
[...] Read more.
In this work, we consider the design of power-constrained networked control systems (NCSs) and a differential entropy-based fault-detection mechanism. For the NCS design of the control loop, we consider faults in the plant gain and unstable plant pole locations, either due to natural causes or malicious intent. Since the power-constrained approach utilized in the NCS design is a stationary approach, we then discuss the finite-time approximation of the power constraints for the relevant control loop signals. The network under study is formed by two additive white Gaussian noise (AWGN) channels located on the direct and feedback paths of the closed control loop. The finite-time approximation of the controller output signal allows us to estimate its differential entropy, which is used in our proposed fault-detection mechanism. After fault detection, we propose a fault-identification mechanism that is capable of correctly discriminating faults. Finally, we discuss the extension of the contributions developed here to future research directions, such as fault recovery and control resilience.
Full article
(This article belongs to the Special Issue The Application of Information Theory in Fault Detection and Diagnosis)
►▼
Show Figures
Figure 1
Open AccessArticle
Three-Dimensional Reconstruction Pre-Training as a Prior to Improve Robustness to Adversarial Attacks and Spurious Correlation
by
Yutaro Yamada, Fred Weiying Zhang, Yuval Kluger and Ilker Yildirim
Entropy 2024, 26(3), 258; https://doi.org/10.3390/e26030258 - 14 Mar 2024
Abstract
Ensuring robustness of image classifiers against adversarial attacks and spurious correlation has been challenging. One of the most effective methods for adversarial robustness is a type of data augmentation that uses adversarial examples during training. Here, inspired by computational models of human vision,
[...] Read more.
Ensuring robustness of image classifiers against adversarial attacks and spurious correlation has been challenging. One of the most effective methods for adversarial robustness is a type of data augmentation that uses adversarial examples during training. Here, inspired by computational models of human vision, we explore a synthesis of this approach by leveraging a structured prior over image formation: the 3D geometry of objects and how it projects to images. We combine adversarial training with a weight initialization that implicitly encodes such a prior about 3D objects via 3D reconstruction pre-training. We evaluate our approach using two different datasets and compare it to alternative pre-training protocols that do not encode a prior about 3D shape. To systematically explore the effect of 3D pre-training, we introduce a novel dataset called Geon3D, which consists of simple shapes that nevertheless capture variation in multiple distinct dimensions of geometry. We find that while 3D reconstruction pre-training does not improve robustness for the simplest dataset setting, we consider (Geon3D on a clean background) that it improves upon adversarial training in more realistic (Geon3D with textured background and ShapeNet) conditions. We also find that 3D pre-training coupled with adversarial training improves the robustness to spurious correlations between shape and background textures. Furthermore, we show that the benefit of using 3D-based pre-training outperforms 2D-based pre-training on ShapeNet. We hope that these results encourage further investigation of the benefits of structured, 3D-based models of vision for adversarial robustness.
Full article
(This article belongs to the Special Issue Probabilistic Models in Machine and Human Learning)
►▼
Show Figures
Figure 1
Open AccessArticle
Analysis of Quantum Steering Measures
by
Lucas Maquedano and Ana C. S. Costa
Entropy 2024, 26(3), 257; https://doi.org/10.3390/e26030257 - 14 Mar 2024
Abstract
The effect of quantum steering describes a possible action at a distance via local measurements. In the last few years, several criteria have been proposed to detect this type of correlation in quantum systems. However, there are few approaches presented in order to
[...] Read more.
The effect of quantum steering describes a possible action at a distance via local measurements. In the last few years, several criteria have been proposed to detect this type of correlation in quantum systems. However, there are few approaches presented in order to measure the degree of steerability of a given system. In this work, we are interested in investigating possible ways to quantify quantum steering, where we based our analysis on different criteria presented in the literature.
Full article
(This article belongs to the Special Issue Quantum Correlations, Contextuality, and Quantum Nonlocality)
►▼
Show Figures
Figure 1
Open AccessArticle
Patterns in Temporal Networks with Higher-Order Egocentric Structures
by
Beatriz Arregui-García, Antonio Longa, Quintino Francesco Lotito, Sandro Meloni and Giulia Cencetti
Entropy 2024, 26(3), 256; https://doi.org/10.3390/e26030256 - 13 Mar 2024
Abstract
The analysis of complex and time-evolving interactions, such as those within social dynamics, represents a current challenge in the science of complex systems. Temporal networks stand as a suitable tool for schematizing such systems, encoding all the interactions appearing between pairs of individuals
[...] Read more.
The analysis of complex and time-evolving interactions, such as those within social dynamics, represents a current challenge in the science of complex systems. Temporal networks stand as a suitable tool for schematizing such systems, encoding all the interactions appearing between pairs of individuals in discrete time. Over the years, network science has developed many measures to analyze and compare temporal networks. Some of them imply a decomposition of the network into small pieces of interactions; i.e., only involving a few nodes for a short time range. Along this line, a possible way to decompose a network is to assume an egocentric perspective; i.e., to consider for each node the time evolution of its neighborhood. This was proposed by Longa et al. by defining the “egocentric temporal neighborhood”, which has proven to be a useful tool for characterizing temporal networks relative to social interactions. However, this definition neglects group interactions (quite common in social domains), as they are always decomposed into pairwise connections. A more general framework that also allows considering larger interactions is represented by higher-order networks. Here, we generalize the description of social interactions to hypergraphs. Consequently, we generalize their decomposition into “hyper egocentric temporal neighborhoods”. This enables the analysis of social interactions, facilitating comparisons between different datasets or nodes within a dataset, while considering the intrinsic complexity presented by higher-order interactions. Even if we limit the order of interactions to the second order (triplets of nodes), our results reveal the importance of a higher-order representation.In fact, our analyses show that second-order structures are responsible for the majority of the variability at all scales: between datasets, amongst nodes, and over time.
Full article
(This article belongs to the Special Issue Topological Data Analysis Meets Information Theory. New Perspectives for the Analysis of Higher-Order Interactions in Complex Systems)
►▼
Show Figures
Figure 1
Open AccessArticle
Events as Elements of Physical Observation: Experimental Evidence
by
J. Gerhard Müller
Entropy 2024, 26(3), 255; https://doi.org/10.3390/e26030255 - 13 Mar 2024
Abstract
It is argued that all physical knowledge ultimately stems from observation and that the simplest possible observation is that an event has happened at a certain space–time location . Considering historic experiments, which have been groundbreaking
[...] Read more.
It is argued that all physical knowledge ultimately stems from observation and that the simplest possible observation is that an event has happened at a certain space–time location . Considering historic experiments, which have been groundbreaking in the evolution of our modern ideas of matter on the atomic, nuclear, and elementary particle scales, it is shown that such experiments produce as outputs streams of macroscopically observable events which accumulate in the course of time into spatio-temporal patterns of events whose forms allow decisions to be taken concerning conceivable alternatives of explanation. Working towards elucidating the physical and informational characteristics of those elementary observations, we show that these represent hugely amplified images of the initiating micro-events and that the resulting macro-images have a cognitive value of 1 bit and a physical value of . In this latter equation, stands for the energy spent in turning the initiating micro-events into macroscopically observable events, for the lifetimes during which the generated events remain macroscopically observable, and for Planck’s constant. The relative value finally represents a measure of amplification that was gained in the observation process.
Full article
(This article belongs to the Special Issue The Landauer Principle and Its Implementations in Physics, Chemistry and Biology: Current Status, Critics and Controversies)
►▼
Show Figures
Figure 1
Open AccessArticle
An n-Dimensional Chaotic Map with Application in Reversible Data Hiding for Medical Images
by
Yuli Yang, Ruiyun Chang, Xiufang Feng, Peizhen Li, Yongle Chen and Hao Zhang
Entropy 2024, 26(3), 254; https://doi.org/10.3390/e26030254 - 13 Mar 2024
Abstract
The drawbacks of a one-dimensional chaotic map are its straightforward structure, abrupt intervals, and ease of signal prediction. Richer performance and a more complicated structure are required for multidimensional chaotic mapping. To address the shortcomings of current chaotic systems, an n-dimensional cosine-transform-based
[...] Read more.
The drawbacks of a one-dimensional chaotic map are its straightforward structure, abrupt intervals, and ease of signal prediction. Richer performance and a more complicated structure are required for multidimensional chaotic mapping. To address the shortcomings of current chaotic systems, an n-dimensional cosine-transform-based chaotic system (nD-CTBCS) with a chaotic coupling model is suggested in this study. To create chaotic maps of any desired dimension, nD-CTBCS can take advantage of already-existing 1D chaotic maps as seed chaotic maps. Three two-dimensional chaotic maps are provided as examples to illustrate the impact. The findings of the evaluation and experiments demonstrate that the newly created chaotic maps function better, have broader chaotic intervals, and display hyperchaotic behavior. To further demonstrate the practicability of nD-CTBCS, a reversible data hiding scheme is proposed for the secure communication of medical images. The experimental results show that the proposed method has higher security than the existing methods.
Full article
(This article belongs to the Special Issue Image Encryption and Privacy Protection Based on Chaotic Systems—Second Edition)
►▼
Show Figures
Figure 1
Open AccessArticle
Intra-Beam Interference Mitigation for the Downlink Transmission of the RIS-Assisted Hybrid Millimeter Wave System
by
Lou Zhao, Yuliang Zhang, Minjie Zhang and Chunshan Liu
Entropy 2024, 26(3), 253; https://doi.org/10.3390/e26030253 - 13 Mar 2024
Abstract
Millimeter-wave (mmWave) communication systems leverage the directional beamforming capabilities of antenna arrays equipped at the base stations (BS) to counteract the inherent high propagation path loss characteristic of mmWave channels. In downlink mmWave transmissions, i.e., from the BS to users, distinguishing users within
[...] Read more.
Millimeter-wave (mmWave) communication systems leverage the directional beamforming capabilities of antenna arrays equipped at the base stations (BS) to counteract the inherent high propagation path loss characteristic of mmWave channels. In downlink mmWave transmissions, i.e., from the BS to users, distinguishing users within the same beam direction poses a significant challenge. Additionally, digital baseband precoding techniques are limited in their ability to mitigate inter-user interference within identical beam directions, representing a fundamental constraint in mmWave downlink transmissions. This study introduces an innovative analog beamforming-based interference mitigation strategy for downlink transmissions in reconfigurable intelligent surface (RIS)-assisted hybrid analog–digital (HAD) mmWave systems. This is achieved through the joint design of analog beamformers and the corresponding coefficients at both the RIS and the BS. We first present derived closed-form approximation expressions for the achievable rate performance in the proposed scenario and establish a stringent upper bound on this performance in a large number of RIS elements regimes. The exclusive use of analog beamforming in the downlink phase allows our proposed transmission algorithm to function efficiently when equipped with low-resolution analog-to-digital/digital-to-analog converters (A/Ds) at the BS. The energy efficiency of the downlink transmission is evaluated through the deployment of six-bit A/Ds and six-bit pulse-amplitude modulation (PAM) signals across varying numbers of activated RIS elements. Numerical simulation results validate the effectiveness of our proposed algorithms in comparison to various benchmark schemes.
Full article
(This article belongs to the Section Signal and Data Analysis)
►▼
Show Figures
Figure 1
Open AccessReview
To Compress or Not to Compress—Self-Supervised Learning and Information Theory: A Review
by
Ravid Shwartz Ziv and Yann LeCun
Entropy 2024, 26(3), 252; https://doi.org/10.3390/e26030252 - 12 Mar 2024
Abstract
Deep neural networks excel in supervised learning tasks but are constrained by the need for extensive labeled data. Self-supervised learning emerges as a promising alternative, allowing models to learn without explicit labels. Information theory has shaped deep neural networks, particularly the information bottleneck
[...] Read more.
Deep neural networks excel in supervised learning tasks but are constrained by the need for extensive labeled data. Self-supervised learning emerges as a promising alternative, allowing models to learn without explicit labels. Information theory has shaped deep neural networks, particularly the information bottleneck principle. This principle optimizes the trade-off between compression and preserving relevant information, providing a foundation for efficient network design in supervised contexts. However, its precise role and adaptation in self-supervised learning remain unclear. In this work, we scrutinize various self-supervised learning approaches from an information-theoretic perspective, introducing a unified framework that encapsulates the self-supervised information-theoretic learning problem. This framework includes multiple encoders and decoders, suggesting that all existing work on self-supervised learning can be seen as specific instances. We aim to unify these approaches to understand their underlying principles better and address the main challenge: many works present different frameworks with differing theories that may seem contradictory. By weaving existing research into a cohesive narrative, we delve into contemporary self-supervised methodologies, spotlight potential research areas, and highlight inherent challenges. Moreover, we discuss how to estimate information-theoretic quantities and their associated empirical problems. Overall, this paper provides a comprehensive review of the intersection of information theory, self-supervised learning, and deep neural networks, aiming for a better understanding through our proposed unified approach.
Full article
(This article belongs to the Special Issue Information-Theoretic Methods in Deep Learning: Theory and Applications)
►▼
Show Figures
Figure 1
Open AccessArticle
Multipole Approach to the Dynamical Casimir Effect with Finite-Size Scatterers
by
Lucas Alonso, Guilherme C. Matos, François Impens, Paulo A. Maia Neto and Reinaldo de Melo e Souza
Entropy 2024, 26(3), 251; https://doi.org/10.3390/e26030251 - 12 Mar 2024
Abstract
A mirror subjected to a fast mechanical oscillation emits photons out of the quantum vacuum—a phenomenon known as the dynamical Casimir effect (DCE). The mirror is usually treated as an infinite metallic surface. Here, we show that, in realistic experimental conditions (mirror size
[...] Read more.
A mirror subjected to a fast mechanical oscillation emits photons out of the quantum vacuum—a phenomenon known as the dynamical Casimir effect (DCE). The mirror is usually treated as an infinite metallic surface. Here, we show that, in realistic experimental conditions (mirror size and oscillation frequency), this assumption is inadequate and drastically overestimates the DCE radiation. Taking the opposite limit, we use instead the dipolar approximation to obtain a simpler and more realistic treatment of DCE for macroscopic bodies. Our approach is inspired by a microscopic theory of DCE, which is extended to the macroscopic realm by a suitable effective Hamiltonian description of moving anisotropic scatterers. We illustrate the benefits of our approach by considering the DCE from macroscopic bodies of different geometries.
Full article
(This article belongs to the Special Issue Quantum Nonstationary Systems)
►▼
Show Figures
Figure 1
Open AccessArticle
Fundamental Limits of Coded Caching in Request-Robust D2D Communication Networks
by
Wuqu Wang, Zhe Tao, Nan Liu and Wei Kang
Entropy 2024, 26(3), 250; https://doi.org/10.3390/e26030250 - 12 Mar 2024
Abstract
D2D coded caching, originally introduced by Ji, Caire, and Molisch, significantly improves communication efficiency by applying the multi-cast technology proposed by Maddah-Ali and Niesen to the D2D network. Most prior works on D2D coded caching are based on the assumption that all users
[...] Read more.
D2D coded caching, originally introduced by Ji, Caire, and Molisch, significantly improves communication efficiency by applying the multi-cast technology proposed by Maddah-Ali and Niesen to the D2D network. Most prior works on D2D coded caching are based on the assumption that all users will request content at the beginning of the delivery phase. However, in practice, this is often not the case. Motivated by this consideration, this paper formulates a new problem called request-robust D2D coded caching. The considered problem includes K users and a content server with access to N files. Only r users, known as requesters, request a file each at the beginning of the delivery phase. The objective is to minimize the average and worst-case delivery rate, i.e., the average and worst-case number of broadcast bits from all users among all possible demands. For this novel D2D coded caching problem, we propose a scheme based on uncoded cache placement and exploiting common demands and one-shot delivery. We also propose information-theoretic converse results under the assumption of uncoded cache placement. Furthermore, we adapt the scheme proposed by Yapar et al. for uncoded cache placement and one-shot delivery to the request-robust D2D coded caching problem and prove that the performance of the adapted scheme is order optimal within a factor of two under uncoded cache placement and within a factor of four in general. Finally, through numerical evaluations, we show that the proposed scheme outperforms known D2D coded caching schemes applied to the request-robust scenario for most cache size ranges.
Full article
(This article belongs to the Special Issue Information Theory and Network Coding II)
►▼
Show Figures
Figure 1
Journal Menu
► ▼ Journal Menu-
- Entropy Home
- Aims & Scope
- Editorial Board
- Reviewer Board
- Topical Advisory Panel
- Video Exhibition
- Instructions for Authors
- Special Issues
- Topics
- Sections & Collections
- Article Processing Charge
- Indexing & Archiving
- Editor’s Choice Articles
- Most Cited & Viewed
- Journal Statistics
- Journal History
- Journal Awards
- Society Collaborations
- Conferences
- Editorial Office
Journal Browser
► ▼ Journal Browser-
arrow_forward_ios
Forthcoming issue
arrow_forward_ios Current issue - Vol. 26 (2024)
- Vol. 25 (2023)
- Vol. 24 (2022)
- Vol. 23 (2021)
- Vol. 22 (2020)
- Vol. 21 (2019)
- Vol. 20 (2018)
- Vol. 19 (2017)
- Vol. 18 (2016)
- Vol. 17 (2015)
- Vol. 16 (2014)
- Vol. 15 (2013)
- Vol. 14 (2012)
- Vol. 13 (2011)
- Vol. 12 (2010)
- Vol. 11 (2009)
- Vol. 10 (2008)
- Vol. 9 (2007)
- Vol. 8 (2006)
- Vol. 7 (2005)
- Vol. 6 (2004)
- Vol. 5 (2003)
- Vol. 4 (2002)
- Vol. 3 (2001)
- Vol. 2 (2000)
- Vol. 1 (1999)
Highly Accessed Articles
Latest Books
E-Mail Alert
News
Topics
Topic in
Entropy, Photonics, Physics, Plasma, Universe, Fractal Fract, Condensed Matter
Applications of Photonics, Laser, Plasma and Radiation Physics
Topic Editors: Viorel-Puiu Paun, Eugen Radu, Maricel Agop, Mircea OlteanuDeadline: 30 March 2024
Topic in
Sensors, J. Imaging, Electronics, Applied Sciences, Entropy, Digital, J. Intell.
Advances in Perceptual Quality Assessment of User Generated Contents
Topic Editors: Guangtao Zhai, Xiongkuo Min, Menghan Hu, Wei ZhouDeadline: 31 March 2024
Topic in
Algorithms, Computation, Entropy, Fractal Fract, MCA
Analytical and Numerical Methods for Stochastic Biological Systems
Topic Editors: Mehmet Yavuz, Necati Ozdemir, Mouhcine Tilioua, Yassine SabbarDeadline: 10 May 2024
Topic in
Algorithms, Diagnostics, Entropy, Information, J. Imaging
Application of Machine Learning in Molecular Imaging
Topic Editors: Allegra Conti, Nicola Toschi, Marianna Inglese, Andrea Duggento, Matthew Grech-Sollars, Serena Monti, Giancarlo Sportelli, Pietro CarraDeadline: 31 May 2024
Conferences
Special Issues
Special Issue in
Entropy
Fractal and Multifractal Analysis of Complex Networks II
Guest Editor: Rafał RakDeadline: 20 March 2024
Special Issue in
Entropy
Quantum Processes in Living Systems
Guest Editors: Alessandro Sergi, Antonino MessinaDeadline: 31 March 2024
Special Issue in
Entropy
Women’s Special Issue Series: Entropy
Guest Editors: Eun-jin Kim, Amelia Carolina SparavignaDeadline: 20 April 2024
Special Issue in
Entropy
The Landauer Principle and Its Implementations in Physics, Chemistry and Biology: Current Status, Critics and Controversies
Guest Editor: Edward BormashenkoDeadline: 30 April 2024
Topical Collections
Topical Collection in
Entropy
Algorithmic Information Dynamics: A Computational Approach to Causality from Cells to Networks
Collection Editors: Hector Zenil, Felipe Abrahão
Topical Collection in
Entropy
Wavelets, Fractals and Information Theory
Collection Editor: Carlo Cattani
Topical Collection in
Entropy
Entropy in Image Analysis
Collection Editor: Amelia Carolina Sparavigna