[go: up one dir, main page]

Next Issue
Volume 25, September
Previous Issue
Volume 25, July
 
 
entropy-logo

Journal Browser

Journal Browser

Entropy, Volume 25, Issue 8 (August 2023) – 134 articles

Cover Story (view full-size image): Let us consider a triangular hypergraph with three vertices and three hyperedges in an n-dim space, n ≥ 3. If we tried to assign 0 and 1 to vertices, so that just one vertex within each of the three hyperedges is assigned 1, we would realise that this is not possible. The hypergraph exhibits a non-Kochen–Specker (KS) contextuality. Why “non-”? Because KS hypergraphs violate the same condition, but each of their hyperedges must contain n vertices. How can we generate non-KS hypergraphs? Via a dimensional upscaling which does not scale with dimension. The minimal number of their hyperedges is ≤ 9 in up to 16-dim spaces. View this paper
  • 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:
15 pages, 343 KiB  
Article
Quality of Security Guarantees for and with Physical Unclonable Functions and Biometric Secrecy Systems
by Onur Günlü, Rafael F. Schaefer and H. Vincent Poor
Entropy 2023, 25(8), 1243; https://doi.org/10.3390/e25081243 - 21 Aug 2023
Viewed by 1261
Abstract
Unique digital circuit outputs, considered as physical unclonable function (PUF) circuit outputs, can facilitate a secure and reliable secret key agreement. To tackle noise and high correlations between the PUF circuit outputs, transform coding methods combined with scalar quantizers are typically applied to [...] Read more.
Unique digital circuit outputs, considered as physical unclonable function (PUF) circuit outputs, can facilitate a secure and reliable secret key agreement. To tackle noise and high correlations between the PUF circuit outputs, transform coding methods combined with scalar quantizers are typically applied to extract the uncorrelated bit sequences reliably. In this paper, we create realistic models for these transformed outputs by fitting truncated distributions to them. We also show that the state-of-the-art models are inadequate to guarantee a target reliability level for all PUF outputs, which also means that secrecy cannot be guaranteed. Therefore, we introduce a quality of security parameter to control the percentage of the PUF circuit outputs for which a target security level can be guaranteed. By applying the finite-length information theory results to a public ring oscillator output dataset, we illustrate that security guarantees can be provided for each bit extracted from any PUF device by eliminating only a small subset of PUF circuit outputs. Furthermore, we conversely show that it is not possible to provide reliability or security guarantees without eliminating any PUF circuit output. Our holistic methods and analyses can be applied to any PUF type, as well as any biometric secrecy system, with continuous-valued outputs to extract secret keys with low hardware complexity. Full article
(This article belongs to the Special Issue Information Security and Privacy: From IoT to IoV)
Show Figures

Figure 1

Figure 1
<p>The RO logic circuit.</p>
Full article ">Figure 2
<p>Fuzzy commitment scheme (FCS).</p>
Full article ">Figure 3
<p>Correctness probability <math display="inline"> <semantics> <mrow> <msub> <mi>P</mi> <mrow> <mi>c</mi> <mo>,</mo> <mi>j</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>δ</mi> <mo>)</mo> </mrow> </mrow> </semantics> </math> vs. secure manufacturing yield <math display="inline"> <semantics> <mrow> <msub> <mi>β</mi> <mi>j</mi> </msub> <mrow> <mo>(</mo> <mi>δ</mi> <mo>)</mo> </mrow> </mrow> </semantics> </math> with the ST applied to <math display="inline"> <semantics> <mrow> <mn>16</mn> <mo>×</mo> <mn>16</mn> </mrow> </semantics> </math> RO arrays from the dataset in [<a href="#B36-entropy-25-01243" class="html-bibr">36</a>]. We achieve <math display="inline"> <semantics> <mrow> <mo>(</mo> <msub> <mi>β</mi> <mi>j</mi> </msub> <mo>=</mo> <mn>100</mn> <mo>,</mo> <mi>δ</mi> <mo>=</mo> <mn>0</mn> <mo>)</mo> </mrow> </semantics> </math>, and <math display="inline"> <semantics> <msub> <mi>β</mi> <mi>j</mi> </msub> </semantics> </math> decreases with increasing <math display="inline"> <semantics> <mi>δ</mi> </semantics> </math>. In row <math display="inline"> <semantics> <mrow> <mo>⌈</mo> <mi>j</mi> <mo>/</mo> <mn>16</mn> <mo>⌉</mo> </mrow> </semantics> </math> and column <math display="inline"> <semantics> <mrow> <mo>(</mo> <mi>j</mi> <mspace width="3.33333pt"/> <mo form="prefix">mod</mo> <mspace width="0.277778em"/> <mn>16</mn> <mo>)</mo> </mrow> </semantics> </math>, we have the <span class="html-italic">j</span>-th transform coefficient.</p>
Full article ">
10 pages, 299 KiB  
Article
A Maximum Entropy Resolution to the Wine/Water Paradox
by Michael C. Parker and Chris Jeynes
Entropy 2023, 25(8), 1242; https://doi.org/10.3390/e25081242 - 21 Aug 2023
Cited by 1 | Viewed by 1223
Abstract
The Principle of Indifference (‘PI’: the simplest non-informative prior in Bayesian probability) has been shown to lead to paradoxes since Bertrand (1889). Von Mises (1928) introduced the ‘Wine/Water Paradox’ as a resonant example of a ‘Bertrand paradox’, which has been presented as demonstrating [...] Read more.
The Principle of Indifference (‘PI’: the simplest non-informative prior in Bayesian probability) has been shown to lead to paradoxes since Bertrand (1889). Von Mises (1928) introduced the ‘Wine/Water Paradox’ as a resonant example of a ‘Bertrand paradox’, which has been presented as demonstrating that the PI must be rejected. We now resolve these paradoxes using a Maximum Entropy (MaxEnt) treatment of the PI that also includes information provided by Benford’s ‘Law of Anomalous Numbers’ (1938). We show that the PI should be understood to represent a family of informationally identical MaxEnt solutions, each solution being identified with its own explicitly justified boundary condition. In particular, our solution to the Wine/Water Paradox exploits Benford’s Law to construct a non-uniform distribution representing the universal constraint of scale invariance, which is a physical consequence of the Second Law of Thermodynamics. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
20 pages, 5422 KiB  
Article
Projective Synchronization of Delayed Uncertain Coupled Memristive Neural Networks and Their Application
by Zhen Han, Naipeng Chen, Xiaofeng Wei, Manman Yuan and Huijia Li
Entropy 2023, 25(8), 1241; https://doi.org/10.3390/e25081241 - 21 Aug 2023
Cited by 2 | Viewed by 1137
Abstract
In this article, the authors analyzed the nonlinear effects of projective synchronization between coupled memristive neural networks (MNNs) and their applications. Since the complete signal transmission is difficult under parameter mismatch and different projective factors, the delays, which are time-varying, and uncertainties have [...] Read more.
In this article, the authors analyzed the nonlinear effects of projective synchronization between coupled memristive neural networks (MNNs) and their applications. Since the complete signal transmission is difficult under parameter mismatch and different projective factors, the delays, which are time-varying, and uncertainties have been taken to realize the projective synchronization of MNNs with multi-links under the nonlinear control method. Through the extended comparison principle and a new approach to dealing with the mismatched parameters, sufficient criteria have been determined under different types of projective factors and the framework of the Lyapunov–Krasovskii functional (LKF) for projective convergence of the coupled MNNs. Instead of the classical treatment for secure communication, the concept of error of synchronization between the drive and response systems has been applied to solve the signal encryption/decryption problem. Finally, the simulations in numerical form have been demonstrated graphically to confirm the adaptability of the theoretical results. Full article
(This article belongs to the Special Issue Signal and Information Processing in Networks)
Show Figures

Figure 1

Figure 1
<p>The nonlinear behavioral model of the memristor.</p>
Full article ">Figure 2
<p>The simplified mathematical model of the memristor.</p>
Full article ">Figure 3
<p>Dynamic trajectories of systems (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>) and (<a href="#FD12-entropy-25-01241" class="html-disp-formula">12</a>) without controller. (<b>a</b>) Chaotic sequences of drive system (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>); (<b>b</b>) States of error system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>); (<b>c</b>) Input of the ineffective control.</p>
Full article ">Figure 4
<p>Dynamic trajectories of systems (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>) and (<a href="#FD12-entropy-25-01241" class="html-disp-formula">12</a>). (<b>a</b>) Chaotic sequences of drive system (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>); (<b>b</b>) States of drive system (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>) without controller; (<b>c</b>) States of response system (<a href="#FD12-entropy-25-01241" class="html-disp-formula">12</a>) without controller; (<b>d</b>) Synchronization error of system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>; (<b>e</b>) Anti-synchronization error of system(<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mo>−</mo> <mn>1</mn> </mrow> </semantics></math>; (<b>f</b>) Adaptive-synchronization error of system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under adaptive controller (<a href="#FD41-entropy-25-01241" class="html-disp-formula">41</a>).</p>
Full article ">Figure 5
<p>Dynamic trajectories of systems (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>) and (<a href="#FD12-entropy-25-01241" class="html-disp-formula">12</a>) without uncertainties. (<b>a</b>) Chaotic sequences of drive system (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>); (<b>b</b>) States of drive system (<a href="#FD11-entropy-25-01241" class="html-disp-formula">11</a>) without controller; (<b>c</b>) States of response system (<a href="#FD12-entropy-25-01241" class="html-disp-formula">12</a>) without controller; (<b>d</b>) Synchronization error of system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>; (<b>e</b>) Anti-synchronization error of system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mo>−</mo> <mn>1</mn> </mrow> </semantics></math>; (<b>f</b>) Adaptive-synchronization error of system (<a href="#FD18-entropy-25-01241" class="html-disp-formula">18</a>) under adaptive controller (<a href="#FD41-entropy-25-01241" class="html-disp-formula">41</a>).</p>
Full article ">Figure 6
<p>Inputs from different types controllers. (<b>a</b>) Feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) with buffeting phenomenon; (<b>b</b>) Feedback anti-controller with buffeting phenomenon; (<b>c</b>) Adaptive controller (<a href="#FD41-entropy-25-01241" class="html-disp-formula">41</a>) with buffeting phenomenon; (<b>d</b>) Feedback controller (<a href="#FD19-entropy-25-01241" class="html-disp-formula">19</a>) without buffeting phenomenon; (<b>e</b>) Feedback anti-controller without buffeting phenomenon; (<b>f</b>) Adaptive controller (<a href="#FD41-entropy-25-01241" class="html-disp-formula">41</a>) without buffeting phenomenon.</p>
Full article ">Figure 7
<p>Secure communication process of proposed algorithm.</p>
Full article ">Figure 8
<p>The transmitted signals.</p>
Full article ">Figure 9
<p>Trajectories of plaintexts and decrypted siganls under adaptive control approach. (<b>a</b>) <math display="inline"><semantics> <mrow> <msub> <mi>r</mi> <mn>1</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>sin</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>; (<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>r</mi> <mn>2</mn> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>cos</mi> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math>.</p>
Full article ">Figure 10
<p>The error between plaintexts and decrypted siganls.</p>
Full article ">
13 pages, 980 KiB  
Article
Spreading Dynamics of Capital Flow Transfer in Complex Financial Networks
by Wenyan Peng, Tingting Chen, Bo Zheng and Xiongfei Jiang
Entropy 2023, 25(8), 1240; https://doi.org/10.3390/e25081240 - 21 Aug 2023
Cited by 1 | Viewed by 1365
Abstract
The financial system, a complex network, operates primarily through the exchange of capital, where the role of information is critical. This study utilizes the transfer entropy method to examine the strength and direction of information flow among different capital flow time series and [...] Read more.
The financial system, a complex network, operates primarily through the exchange of capital, where the role of information is critical. This study utilizes the transfer entropy method to examine the strength and direction of information flow among different capital flow time series and investigate the community structure within the transfer networks. Moreover, the spreading dynamics of the capital flow transfer networks are observed, and the importance and traveling time of each node are explored. The results imply a dominant role for the food and drink industry within the Chinese market, with increased attention towards the computer industry starting in 2014. The community structure of the capital flow transfer networks significantly differs from those constructed from stock prices, with the main sector predominantly encompassing industry leaders favored by primary funds with robust capital flow connections. The average traveling time from sectors such as food and drink, coal, and utilities to other sectors is the shortest, and the dynamic flow between these sectors displays a significant role. These findings highlight that comprehension of information flow and community structure within the financial system can offer valuable insights into market dynamics and help to identify key sectors and companies. Full article
(This article belongs to the Special Issue Complexity, Entropy and the Physics of Information)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) Time evolution of average main capital (AM). The daily average main capital (AM) and annual average main capital is displayed in blue dotted line and red solid line, respectively. (<b>b</b>) TE network of cash flow transfer network. There are 152 individual stocks, the abbreviations of which are marked. Different colors represent different sectors.</p>
Full article ">Figure 2
<p>The transfer entropy rank of petrochemicals, computer, automobile, and food and drink sectors.</p>
Full article ">Figure 3
<p>(<b>a</b>–<b>e</b>) Community structure of capital flow transfer network in different years. (<b>f</b>–<b>j</b>) Community structure of transfer network based on price returns in different years. The size of nodes and the width of edges represent the number of nodes in the community and the capital transfer flow between two communities, respectively.</p>
Full article ">Figure 4
<p>(<b>a</b>) The reciprocal of average traveling time for different business sectors. (<b>b</b>) Dynamic flow of different business sectors. (<b>c</b>) The reciprocal of traveling time between different business sectors. The depth of the color represents the size of the value of <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>T</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>d</b>) Dynamic flow between different business sectors. The depth of the color represents the size of the value of <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 4 Cont.
<p>(<b>a</b>) The reciprocal of average traveling time for different business sectors. (<b>b</b>) Dynamic flow of different business sectors. (<b>c</b>) The reciprocal of traveling time between different business sectors. The depth of the color represents the size of the value of <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>T</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </mrow> </semantics></math>. (<b>d</b>) Dynamic flow between different business sectors. The depth of the color represents the size of the value of <math display="inline"><semantics> <msub> <mi>F</mi> <mrow> <mi>i</mi> <mi>j</mi> </mrow> </msub> </semantics></math>.</p>
Full article ">Figure 5
<p>(<b>a</b>) The reciprocal of average traveling time for different business sectors form 2010 to 2022. The depth of the color represents the size of the value of <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> </mrow> </semantics></math>. (<b>b</b>) Dynamic flow of different business sectors form 2010 to 2022. The depth of the color represents the size of the value of <math display="inline"><semantics> <msub> <mi>F</mi> <mi>i</mi> </msub> </semantics></math>. For comparison, we normalize <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>/</mo> <msub> <mi>T</mi> <mi>i</mi> </msub> </mrow> </semantics></math> and <math display="inline"><semantics> <msub> <mi>F</mi> <mi>i</mi> </msub> </semantics></math> for different sectors.</p>
Full article ">
16 pages, 2563 KiB  
Article
Quantifying Entropy in Response Times (RT) Distributions Using the Cumulative Residual Entropy (CRE) Function
by Daniel Fitousi
Entropy 2023, 25(8), 1239; https://doi.org/10.3390/e25081239 - 21 Aug 2023
Cited by 1 | Viewed by 1227
Abstract
Response times (RT) distributions are routinely used by psychologists and neuroscientists in the assessment and modeling of human behavior and cognition. The statistical properties of RT distributions are valuable in uncovering unobservable psychological mechanisms. A potentially important statistical aspect of RT distributions is [...] Read more.
Response times (RT) distributions are routinely used by psychologists and neuroscientists in the assessment and modeling of human behavior and cognition. The statistical properties of RT distributions are valuable in uncovering unobservable psychological mechanisms. A potentially important statistical aspect of RT distributions is their entropy. However, to date, no valid measure of entropy on RT distributions has been developed, mainly because available extensions of discrete entropy measures to continuous distributions were fraught with problems and inconsistencies. The present work takes advantage of the cumulative residual entropy (CRE) function—a well-known differential entropy measure that can circumvent those problems. Applications of the CRE to RT distributions are presented along with concrete examples and simulations. In addition, a novel measure of instantaneous CRE is developed that captures the rate of entropy reduction (or information gain) from a stimulus as a function of processing time. Taken together, the new measures of entropy in RT distributions proposed here allow for stronger statistical inferences, as well as motivated theoretical interpretations of psychological constructs such as mental effort and processing efficiency. Full article
(This article belongs to the Section Entropy and Biology)
Show Figures

Figure 1

Figure 1
<p>The exGaussian distribution is often chosen by psychologists to model RT distributions. The Gaussian part is represented by two parameters, the mean <math display="inline"><semantics> <mi>μ</mi> </semantics></math> and standard deviation <math display="inline"><semantics> <mi>σ</mi> </semantics></math>, and the exponential part by its mean <math display="inline"><semantics> <mi>τ</mi> </semantics></math>. The mean and the variance of the exGaussian distribution are, respectively, <math display="inline"><semantics> <mrow> <mi>E</mi> <mo>(</mo> <mi>x</mi> <mo>)</mo> <mo>=</mo> <mi>μ</mi> <mo>+</mo> <mi>τ</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>V</mi> <mi>a</mi> <mi>r</mi> <mrow> <mo>(</mo> <mi>x</mi> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mi>σ</mi> <mn>2</mn> </msup> <mo>+</mo> <msup> <mi>τ</mi> <mn>2</mn> </msup> </mrow> </semantics></math>. The exGaussian provides an excellent fit to empirical data and captures the negatively skewed shape of RT distributions. The effects of its three parameters on the shape and location of the distribution are illustrated: (<b>a</b>) baseline parameters, (<b>b</b>) a change in the <math display="inline"><semantics> <mi>σ</mi> </semantics></math> parameter, (<b>c</b>) a change in the location <math display="inline"><semantics> <mi>μ</mi> </semantics></math> parameter, and (<b>d</b>) a change in the <math display="inline"><semantics> <mi>τ</mi> </semantics></math> parameter.</p>
Full article ">Figure 2
<p>Five canonical RT functions simulated with the exGaussian distribution with parameters <math display="inline"><semantics> <mrow> <mi>μ</mi> <mo>=</mo> <mn>400</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>30</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>60</mn> </mrow> </semantics></math>: (<b>a</b>) probability density function (PDF), (<b>b</b>) cumulative density function (CDF), (<b>c</b>) survivor function, (<b>d</b>) hazard function, and (<b>e</b>) cumulative hazard function. See text for more details.</p>
Full article ">Figure 3
<p>Simulations of PDFs, survivors, and CREs with two exGaussian distributions. Top panel: manipulation of the <math display="inline"><semantics> <mi>μ</mi> </semantics></math> parameter: (<b>a</b>) probability density functions, (<b>b</b>) survivor functions, (<b>c</b>) CRE functions. Middle panel: manipulation of the <math display="inline"><semantics> <mi>σ</mi> </semantics></math> parameter: (<b>d</b>) probability density functions, (<b>e</b>) survivor functions, (<b>f</b>) CRE functions. Bottom panel: manipulation of the <math display="inline"><semantics> <mi>τ</mi> </semantics></math> parameter: (<b>g</b>) probability density functions, (<b>h</b>) survivor functions, (<b>i</b>) CRE functions.</p>
Full article ">Figure 4
<p>Simulations of PDFs, survivors, and CREs with two exponential distributions: (<b>a</b>) probability density functions, (<b>b</b>) survivor functions, and (<b>c</b>) their corresponding CRE functions.</p>
Full article ">Figure 5
<p>Simulations of the iCRE(t) function for the same exGaussian parameters as in <a href="#entropy-25-01239-f003" class="html-fig">Figure 3</a>. (<b>a</b>) Two PDFs differing in <math display="inline"><semantics> <mi>μ</mi> </semantics></math>, (<b>b</b>) iCRE(t) functions for the two pdfs differing in <math display="inline"><semantics> <mi>μ</mi> </semantics></math>, (<b>c</b>) two PDFs differing in <math display="inline"><semantics> <mi>σ</mi> </semantics></math>, (<b>d</b>) iCRE(t) functions for the two PDFs differing in <math display="inline"><semantics> <mi>σ</mi> </semantics></math>, (<b>e</b>) two PDFs differing in <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, (<b>f</b>) iCRE(t) functions for the two pdfs differing in <math display="inline"><semantics> <mi>τ</mi> </semantics></math>.</p>
Full article ">
21 pages, 1341 KiB  
Article
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
by Wenyang Qian, Robert A. M. Basili, Mary Mehrnoosh Eshaghian-Wilner, Ashfaq Khokhar, Glenn Luecke and James P. Vary
Entropy 2023, 25(8), 1238; https://doi.org/10.3390/e25081238 - 21 Aug 2023
Cited by 2 | Viewed by 1989
Abstract
The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the [...] Read more.
The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this class of problems. In this paper, we tackle the TSP using the quantum approximate optimization algorithm (QAOA) approach by formulating it as an optimization problem. By adopting an improved qubit encoding strategy and a layer-wise learning optimization protocol, we present numerical results obtained from the gate-based digital quantum simulator, specifically targeting TSP instances with 3, 4, and 5 cities. We focus on the evaluations of three distinctive QAOA mixer designs, considering their performances in terms of numerical accuracy and optimization cost. Notably, we find that a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run, an observation further supported by our noise model simulations. Furthermore, we investigate the sensitivity of the simulations to the TSP graph. Overall, our simulation results show that the digital quantum simulation of problem-inspired ansatz is a successful candidate for finding optimal TSP solutions. Full article
(This article belongs to the Special Issue Advances in Quantum Computing)
Show Figures

Figure 1

Figure 1
<p>Two-part layer-wise learning protocol of the QAOA. Horizontal lines represent the qubits; rectangular boxes are the unitary operators. Fixed parameters are in black; free parameters are in red.</p>
Full article ">Figure 2
<p>Example of the layer-wise learning protocol applied to the QAOA X mixer simulation. The left panel (<b>a</b>) shows the simulation for a selected LL protocol step A2 of a specific TSP instance, TSP-3. The right panel (<b>b</b>) shows the overall LL optimization for 6 different TSP instances. Here, a TSP instance is a random TSP graph with 3 nodes and a maximum edge weight of 20.</p>
Full article ">Figure 3
<p>Performance comparison of the 3 QAOA mixers for samples of the 4-city TSP (<b>left column</b>) and 5-city TSP (<b>right column</b>). In both cases, we compare the AR in panels (<b>a</b>,<b>b</b>), the percentage of the true solution in panels (<b>c</b>,<b>d</b>), and the rank of the true solution in panels (<b>e</b>,<b>f</b>). The uncertainty bars are standard deviations obtained from simulations of different TSPs. Notably, we leave out the ranks for the X mixers due to their significantly higher values, which further complicates the presentation.</p>
Full article ">Figure 4
<p>Noisy QAOA simulation results of the XY and RS mixers compared with the noise-free simulation of the 4-city TSP graph. In the legend, we show the single-qubit error used for each noisy simulation. The uncertainty bars/bands are standard deviations obtained from simulations of different TSPs. The same scale is used for XY and RS, except for the plot of their ranks.</p>
Full article ">Figure 5
<p>Results of the approximation ratio (AR) of the three QAOA mixers for the 4-city TSP (<b>panel a</b>) and the 5-city TSP (<b>panel b</b>) of distinct graph skewnesses.</p>
Full article ">Figure A1
<p>Performance comparison among the three mixers on a single TSP graph. The respective rank of the true solution in each optimization step is included at the top of the percentage.</p>
Full article ">
18 pages, 5071 KiB  
Article
Synergetic Theory of Information Entropy Based on Failure Approach Index for Stability Analysis of Surrounding Rock System
by Lijun Xiong, Haiping Yuan, Gaoliang Liu, Hengzhe Li, Yangyao Zou, Xiaohu Liu and Xiaoming Li
Entropy 2023, 25(8), 1237; https://doi.org/10.3390/e25081237 - 20 Aug 2023
Cited by 2 | Viewed by 1229
Abstract
It is generally acknowledged that the stability evaluation of surrounding rock denotes nonlinear complex system engineering. In order to accurately and quantitatively assess the safety states of surrounding rock and provide a scientific basis for the prevention and control of surrounding rock stability, [...] Read more.
It is generally acknowledged that the stability evaluation of surrounding rock denotes nonlinear complex system engineering. In order to accurately and quantitatively assess the safety states of surrounding rock and provide a scientific basis for the prevention and control of surrounding rock stability, the analysis method of the synergetic theory of information entropy using the failure approach index has been proposed. By means of deriving the general relationship between the total two-dimensional plastic shear strain and the total three-dimensional plastic shear strain and obtaining the numerical limit analysis step of the plastic shear strain, the threshold value of the ultimate plastic shear strain can be determined, which has provided the key criterion for the calculation of the information entropy based on the failure approach index. In addition, combining with the synergetic theory of the principle of maximum information entropy, the evolution equation of the excavation step and information entropy based on the failure approach index of the surrounding rock system in underground mining space are established, and the equations of the general solution and particular solution as well as the expression of the destabilizing excavation step are given. To account for this, the method is applied to analyze the failure states of the floor surrounding rock after the mining of the 71 coal seam in Xutuan Coal Mine and involve the disturbance effect and stability control method of the underlying 72 coal seam roof from the macroscopic and microscopic aspects. Consequently, the validity of the analysis method of synergetic theory of information entropy based on the failure approach index has been verified, which presents an updated approach for the stability evaluation of surrounding rock systems that is of satisfactory capability and value in engineering applications. Full article
Show Figures

Figure 1

Figure 1
<p>Geographical position of Xutuan Coal Mine and column diagram of coal and rock layers.</p>
Full article ">Figure 2
<p>Numerical simulation flow chart of the ultimate load.</p>
Full article ">Figure 3
<p>Numerical calculation flow chart of the ultimate plastic shear strain.</p>
Full article ">Figure 4
<p>Calculation model: (<b>a</b>) geometric model; (<b>b</b>) boundary conditions and key nodes (units): key node (unit) 1~12 represent the monitoring node (unit) of plastic shear strain; (<b>c</b>) plane figure of failure morphology; and (<b>d</b>) real picture of failure morphology.</p>
Full article ">Figure 5
<p>Curve of maximum unbalanced force: (<b>a</b>) area load on top surface with 24.772 MPa; (<b>b</b>) area load on top surface with 24.773 MPa.</p>
Full article ">Figure 6
<p>Relational graph between the axial load and the plastic shear strain.</p>
Full article ">Figure 7
<p>Schematic diagram of the bifurcation and merge of 7<sub>1</sub> and 7<sub>2</sub> coal in the Xutuan Coal Mine.</p>
Full article ">Figure 8
<p>The spatial position relationship between the 7<sub>1</sub>18 goaf and the 7<sub>2</sub>25 working face.</p>
Full article ">Figure 9
<p>Mechanical tests: (<b>a</b>) Brazilian splitting test; and (<b>b</b>) uniaxial compression test.</p>
Full article ">Figure 10
<p>Failure cloud map from the local area of surrounding rock on the 7<sub>1</sub> coal seam floor among different horizontal excavation distances: (<b>a</b>) 2 m; (<b>b</b>) 4 m; (<b>c</b>) 6 m; (<b>d</b>) 8 m; (<b>e</b>) 10 m; (<b>f</b>) 12 m; (<b>g</b>) 14 m; (<b>h</b>) 15 m.</p>
Full article ">Figure 10 Cont.
<p>Failure cloud map from the local area of surrounding rock on the 7<sub>1</sub> coal seam floor among different horizontal excavation distances: (<b>a</b>) 2 m; (<b>b</b>) 4 m; (<b>c</b>) 6 m; (<b>d</b>) 8 m; (<b>e</b>) 10 m; (<b>f</b>) 12 m; (<b>g</b>) 14 m; (<b>h</b>) 15 m.</p>
Full article ">Figure 11
<p>The curve of excavation distance from the 7<sub>1</sub>18 working face and failure depth from the local area of the floor surrounding the rock.</p>
Full article ">
19 pages, 11607 KiB  
Article
A Wealth Distribution Agent Model Based on a Few Universal Assumptions
by Matheus Calvelli and Evaldo M. F. Curado
Entropy 2023, 25(8), 1236; https://doi.org/10.3390/e25081236 - 19 Aug 2023
Viewed by 1390
Abstract
We propose a new agent-based model for studying wealth distribution. We show that a model that links wealth to information (interaction and trade among agents) and to trade advantage is able to qualitatively reproduce real wealth distributions, as well as their evolution over [...] Read more.
We propose a new agent-based model for studying wealth distribution. We show that a model that links wealth to information (interaction and trade among agents) and to trade advantage is able to qualitatively reproduce real wealth distributions, as well as their evolution over time and equilibrium distributions. These distributions are shown in four scenarios, with two different taxation schemes where, in each scenario, only one of the taxation schemes is applied. In general, the evolving end state is one of extreme wealth concentration, which can be counteracted with an appropriate wealth-based tax. Taxation on annual income alone cannot prevent the evolution towards extreme wealth concentration. Full article
Show Figures

Figure 1

Figure 1
<p>The cumulative probability distribution of net wealth in the US (<b>left</b>, 1997) and UK (<b>right</b>, 1996) shown in log–log scales. Points represent data from the IRS/HMRC, and solid lines are the fitted lines to the exponential (Boltzmann–Gibbs) and power-law (Pareto) [<a href="#B1-entropy-25-01236" class="html-bibr">1</a>].</p>
Full article ">Figure 2
<p>Probability function, Equation (<a href="#FD11-entropy-25-01236" class="html-disp-formula">11</a>).</p>
Full article ">Figure 3
<p>Raw model with taxation on wealth: <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. In the figure on the left, we can see the average wealth held by the 90 and 99 quantiles, i.e., the <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> richest agents, respectively, compared with the standard deviation. On the right, the fraction of wealth held by the <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> richest agents is shown. The time evolution of the Gini index is also shown, stabilizing slightly above <math display="inline"><semantics> <mrow> <mn>0.3</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Statistics for the wealth–connection linked model and taxation on wealth: <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. In the figure on the left, we can see the average wealth held by the 90 and 99 quantiles, i.e., the <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> richest agents, respectively, compared with the standard deviation. Note that these values are larger than in the raw case, <a href="#entropy-25-01236-f005" class="html-fig">Figure 5</a>. On the right, the fraction of wealth held by the <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> richest agents is shown. The increase in wealth concentration is evident. Consequently, the Gini index also increases. The time evolution of the Gini index is also shown, stabilizing just below <math display="inline"><semantics> <mrow> <mn>0.4</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Evolution of the distributions for the model that favors the rich: <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>4</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. At each stage, the figure on the left is the distribution of income, and the figure on the right is the distribution of the number of connections. The orange line is the poverty rate.</p>
Full article ">Figure 6
<p>Stage 23 of <a href="#entropy-25-01236-f005" class="html-fig">Figure 5</a>. Pareto tail (dotted red line) is clear, with Pareto exponent <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>5.63</mn> </mrow> </semantics></math>. <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>4</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Evolution of distributions for the model that favors the rich: <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <msup> <mn>10</mn> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. The orange line is the poverty rate.</p>
Full article ">Figure 8
<p>Evolution of total tax revenue and total taxed agents for different values of <math display="inline"><semantics> <mi>γ</mi> </semantics></math> (tax growth rate according to wealth).</p>
Full article ">Figure 9
<p>Evolution of the top <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> of agents for different values of <math display="inline"><semantics> <mi>γ</mi> </semantics></math> (tax growth rate according to wealth).</p>
Full article ">Figure 10
<p>Evolution of the top <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> of agents for different values of <math display="inline"><semantics> <mi>γ</mi> </semantics></math> (tax growth rate according to wealth).</p>
Full article ">Figure 11
<p>Evolution of the standard deviation (<math display="inline"><semantics> <mi>σ</mi> </semantics></math>) and the Gini coefficient for different values of <math display="inline"><semantics> <mi>γ</mi> </semantics></math> (tax growth rate according to wealth).</p>
Full article ">Figure 12
<p>Evolution of probability distributions for the model with capital gain taxation: <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. The orange line is the poverty rate.</p>
Full article ">Figure 13
<p>Stage 30 of <a href="#entropy-25-01236-f012" class="html-fig">Figure 12</a>. There is a Pareto tail (dotted red line) with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>4.82</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 14
<p>Stage 41 of <a href="#entropy-25-01236-f012" class="html-fig">Figure 12</a>, scenario of annual income taxation. A second Pareto tail appears, with <math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>1.06</mn> </mrow> </semantics></math> (dotted red line). <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>1</mn> <mo>/</mo> <mn>10</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 15
<p>Evolution of total tax revenue and total taxed agents for different values of <math display="inline"><semantics> <mi>τ</mi> </semantics></math> (tax limit). <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 16
<p>Evolution of the top <math display="inline"><semantics> <mrow> <mn>10</mn> <mo>%</mo> </mrow> </semantics></math> of agents for different values of <math display="inline"><semantics> <mi>τ</mi> </semantics></math> (tax limit) and <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 17
<p>Evolution of the top <math display="inline"><semantics> <mrow> <mn>1</mn> <mo>%</mo> </mrow> </semantics></math> of agents for different values of <math display="inline"><semantics> <mi>τ</mi> </semantics></math> (tax limit) and <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 18
<p>Evolution of the standard deviation (<math display="inline"><semantics> <mi>σ</mi> </semantics></math>) and the Gini coefficient for different values of <math display="inline"><semantics> <mi>τ</mi> </semantics></math> (tax limit) and for <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>.</p>
Full article ">
22 pages, 2170 KiB  
Article
Variational Bayesian Algorithms for Maneuvering Target Tracking with Nonlinear Measurements in Sensor Networks
by Yumei Hu, Quan Pan, Bao Deng, Zhen Guo, Menghua Li and Lifeng Chen
Entropy 2023, 25(8), 1235; https://doi.org/10.3390/e25081235 - 18 Aug 2023
Viewed by 1132
Abstract
The variational Bayesian method solves nonlinear estimation problems by iteratively computing the integral of the marginal density. Many researchers have demonstrated the fact its performance depends on the linear approximation in the computation of the variational density in the iteration and the degree [...] Read more.
The variational Bayesian method solves nonlinear estimation problems by iteratively computing the integral of the marginal density. Many researchers have demonstrated the fact its performance depends on the linear approximation in the computation of the variational density in the iteration and the degree of nonlinearity of the underlying scenario. In this paper, two methods for computing the variational density, namely, the natural gradient method and the simultaneous perturbation stochastic method, are used to implement a variational Bayesian Kalman filter for maneuvering target tracking using Doppler measurements. The latter are collected from a set of sensors subject to single-hop network constraints. We propose a distributed fusion variational Bayesian Kalman filter for a networked maneuvering target tracking scenario and both of the evidence lower bound and the posterior Cramér–Rao lower bound of the proposed methods are presented. The simulation results are compared with centralized fusion in terms of posterior Cramér–Rao lower bounds, root-mean-squared errors and the 3σ bound. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

Figure 1
<p>The architectures of sensor networks. (<b>a</b>) Centralized sensor network architectures. (<b>b</b>) Decentralized sensor network architectures. (<b>c</b>) Distributed sensor network architectures.</p>
Full article ">Figure 2
<p>Sensor network scenario.</p>
Full article ">Figure 3
<p>(<b>a</b>) The number of the neighbors of each sensor. (<b>b</b>) The output sensor against scan index.</p>
Full article ">Figure 4
<p>The comparison of PCRLB and RMSE. (<b>a</b>) The RMSE of range. (<b>b</b>) The RMSE of velocity.</p>
Full article ">Figure 5
<p>The comparison of the PCRLB and RMSE of estimated position in coordinates. (<b>a</b>) The RMSE on x-axis. (<b>b</b>) The RMSE on y-axis.</p>
Full article ">Figure 6
<p>The comparison of the PCRLB and RMSE of estimated velocity in coordinates. (<b>a</b>) The RMSE on x-axis. (<b>b</b>) The RMSE on y-axis.</p>
Full article ">Figure 7
<p>The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> comparison. (<b>a</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> of range. (<b>b</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> of velocity.</p>
Full article ">Figure 8
<p>The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> comparison of estimated position. (<b>a</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> on x-axis. (<b>b</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> on y-axis.</p>
Full article ">Figure 9
<p>The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> comparison of estimated velocity. (<b>a</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> on x-axis. (<b>b</b>) The 3<math display="inline"><semantics> <mi>σ</mi> </semantics></math> on y-axis.</p>
Full article ">Figure 10
<p>ELBO. (<b>a</b>) DVBKF-NG. (<b>b</b>) DVBKF-SPSA.</p>
Full article ">Figure 11
<p>KLD. (<b>a</b>) DVBKF-NG. (<b>b</b>) DVBKF-SPSA.</p>
Full article ">
27 pages, 536 KiB  
Article
Convergence Rates for the Constrained Sampling via Langevin Monte Carlo
by Yuanzheng Zhu
Entropy 2023, 25(8), 1234; https://doi.org/10.3390/e25081234 - 18 Aug 2023
Viewed by 1414
Abstract
Sampling from constrained distributions has posed significant challenges in terms of algorithmic design and non-asymptotic analysis, which are frequently encountered in statistical and machine-learning models. In this study, we propose three sampling algorithms based on Langevin Monte Carlo with the Metropolis–Hastings steps to [...] Read more.
Sampling from constrained distributions has posed significant challenges in terms of algorithmic design and non-asymptotic analysis, which are frequently encountered in statistical and machine-learning models. In this study, we propose three sampling algorithms based on Langevin Monte Carlo with the Metropolis–Hastings steps to handle the distribution constrained within some convex body. We present a rigorous analysis of the corresponding Markov chains and derive non-asymptotic upper bounds on the convergence rates of these algorithms in total variation distance. Our results demonstrate that the sampling algorithm, enhanced with the Metropolis–Hastings steps, offers an effective solution for tackling some constrained sampling problems. The numerical experiments are conducted to compare our methods with several competing algorithms without the Metropolis–Hastings steps, and the results further support our theoretical findings. Full article
(This article belongs to the Collection Advances in Applied Statistical Mechanics)
Show Figures

Figure 1

Figure 1
<p>The trace graphs of <math display="inline"><semantics> <msub> <mi>x</mi> <mn>1</mn> </msub> </semantics></math> of the Markov chain determined by the four sampling algorithms.</p>
Full article ">Figure 2
<p>The densities of <math display="inline"><semantics> <msub> <mi>x</mi> <mn>1</mn> </msub> </semantics></math> of the Markov chain determined by the four sampling algorithms.</p>
Full article ">Figure 3
<p>Approximate mixing time with respect to dimension and error tolerance of Algorithm 2. (<b>a</b>) Dimension dependence for fixed error tolerance. (<b>b</b>) Error tolerance dependence for fixed dimension.</p>
Full article ">Figure 4
<p>Approximate mixing time with respect to dimension and error tolerance dependence of the four sampling algorithms. (<b>a</b>) Dimension dependence for fixed error tolerance. (<b>b</b>) Error tolerance dependence for fixed dimension.</p>
Full article ">Figure 5
<p>Bayesian regularized regression via Algorithm 3, where distinct colors represent various trajectories of parameter estimates for distinct variables. (<b>a</b>) <math display="inline"><semantics> <msub> <mi>L</mi> <mn>1</mn> </msub> </semantics></math>—norm-constraint. (<b>b</b>) <math display="inline"><semantics> <msub> <mi>L</mi> <mrow> <mn>1.5</mn> </mrow> </msub> </semantics></math>—norm-constraint. (<b>c</b>) <math display="inline"><semantics> <msub> <mi>L</mi> <mn>2</mn> </msub> </semantics></math>—norm-constraint.</p>
Full article ">
33 pages, 7932 KiB  
Article
Fault Diagnosis of Rolling Bearings in Primary Mine Fans under Sample Imbalance Conditions
by Wei Cui, Jun Ding, Guoying Meng, Zhengyan Lv, Yahui Feng, Aiming Wang and Xingwei Wan
Entropy 2023, 25(8), 1233; https://doi.org/10.3390/e25081233 - 18 Aug 2023
Cited by 2 | Viewed by 1499
Abstract
Rolling bearings are crucial parts of primary mine fans. In order to guarantee the safety of coal mine production, primary mine fans commonly work during regular operation and are immediately shut down for repair in case of failure. This causes the sample imbalance [...] Read more.
Rolling bearings are crucial parts of primary mine fans. In order to guarantee the safety of coal mine production, primary mine fans commonly work during regular operation and are immediately shut down for repair in case of failure. This causes the sample imbalance phenomenon in fault diagnosis (FD), i.e., there are many more normal state samples than faulty ones, seriously affecting the precision of FD. Therefore, the current study presents an FD approach for the rolling bearings of primary mine fans under sample imbalance conditions via symmetrized dot pattern (SDP) images, denoising diffusion probabilistic models (DDPMs), the image generation method, and a convolutional neural network (CNN). First, the 1D bearing vibration signal was transformed into an SDP image with significant characteristics, and the DDPM was employed to create a generated image with similar feature distributions to the real fault image of the minority class. Then, the generated images were supplemented into the imbalanced dataset for data augmentation to balance the minority class samples with the majority ones. Finally, a CNN was utilized as a fault diagnosis model to identify and detect the rolling bearings’ operating conditions. In order to assess the efficiency of the presented method, experiments were performed using the regular rolling bearing dataset and primary mine fan rolling bearing data under actual operating situations. The experimental results indicate that the presented method can more efficiently fit the real image samples’ feature distribution and generate image samples with higher similarity than other commonly used methods. Moreover, the diagnostic precision of the FD model can be effectively enhanced by gradually expanding and enhancing the unbalanced dataset. Full article
Show Figures

Figure 1

Figure 1
<p>Primary coal mine fan: (<b>a</b>) axial-flow fan, main part; (<b>b</b>) explosion-proof motor; (<b>c</b>) motor connection axis extension.</p>
Full article ">Figure 2
<p>SDP schematic.</p>
Full article ">Figure 3
<p>DDPM schematic.</p>
Full article ">Figure 4
<p>CNN structure diagram.</p>
Full article ">Figure 5
<p>Flowchart of fault diagnosis method.</p>
Full article ">Figure 6
<p>QPZZ-II rotating machinery fault test bench.</p>
Full article ">Figure 7
<p>Correlation between SDP images for different parameter values.</p>
Full article ">Figure 8
<p>Time-domain and SDP graphs for the four operating states of rolling bearings.</p>
Full article ">Figure 9
<p>Average correlation coefficients between generated and real images for different faults.</p>
Full article ">Figure 10
<p>Comparison of the real image with different types of generated images.</p>
Full article ">Figure 11
<p>Comparison of the quality of generated images based on evaluation metrics.</p>
Full article ">Figure 12
<p>Feature visualization of the produced and real images.</p>
Full article ">Figure 13
<p>Comparison of fault diagnosis accuracy for multiple imbalance rate datasets.</p>
Full article ">Figure 14
<p>Classification confusion matrix for different datasets.</p>
Full article ">Figure 15
<p>Primary mine fan and data acquisition system: (<b>a</b>) physical diagram of the primary mine fan; (<b>b</b>) schematic diagram of the main fan structure; (<b>c</b>) internal structure of the main fan; (<b>d</b>) data acquisition sensor; (<b>e</b>) data monitoring and acquisition system.</p>
Full article ">Figure 16
<p>Envelope spectra of normal and fault signals.</p>
Full article ">Figure 17
<p>The RB vibration signals’ time-domain and SDP images in various states.</p>
Full article ">Figure 18
<p>Comparison of the generated and real images.</p>
Full article ">Figure 19
<p>Comparing the quality of generated images based on evaluation criteria.</p>
Full article ">Figure 20
<p>Feature visualization of the produced and actual images.</p>
Full article ">
21 pages, 3041 KiB  
Article
Microgravity Spherical Droplet Evaporation and Entropy Effects
by Seyedamirhossein Madani and Christopher Depcik
Entropy 2023, 25(8), 1232; https://doi.org/10.3390/e25081232 - 18 Aug 2023
Viewed by 1386
Abstract
Recent efforts to understand low-temperature combustion (LTC) in internal combustion engines highlight the need to improve chemical kinetic mechanisms involved in the negative temperature coefficient (aka cool flame) regime. Interestingly, microgravity droplet combustion experiments demonstrate this cool flame behavior, allowing a greater focus [...] Read more.
Recent efforts to understand low-temperature combustion (LTC) in internal combustion engines highlight the need to improve chemical kinetic mechanisms involved in the negative temperature coefficient (aka cool flame) regime. Interestingly, microgravity droplet combustion experiments demonstrate this cool flame behavior, allowing a greater focus on chemistry after buoyancy, and the corresponding influence of the conservation of momentum is removed. In Experimental terms, the LTC regime is often characterized by a reduction in heat transfer losses. Novel findings in this area demonstrate that lower entropy generation, in conjunction with diminished heat transfer losses, could more definitively define the LTC regime. As a result, the simulation of the entropy equation for spherical droplet combustion under microgravity could help us to investigate fundamental LTC chemical kinetic pathways. To provide a starting point for researchers who are new to this field, this effort first provides a comprehensive and detailed derivation of the conservation of entropy equation using spherical coordinates and gathers all relevant information under one cohesive framework, which is a resource not readily available in the literature. Subsequently, the well-known d2 law analytical model is determined and compared to experimental data that highlight shortcomings of the law. The potential improvements in the d2 law are then discussed, and a numerical model is presented that includes entropy. The resulting codes are available in an online repository to ensure that other researchers interested in expanding this field of work have a fundamental starting point. Full article
(This article belongs to the Special Issue Thermodynamic Evaluation and Optimization of Combustion Processes)
Show Figures

Figure 1

Figure 1
<p>Terms in the entropy–flux balance for a 3D fluid element.</p>
Full article ">Figure 2
<p>Schematic representation of an evaporating droplet surrounded by gas with mass fractions and temperature distributions along the radial direction.</p>
Full article ">Figure 3
<p>Variations in squared non-dimensional droplet diameter over time; comparison between analytical solution and numerical model and experimental data [<a href="#B21-entropy-25-01232" class="html-bibr">21</a>].</p>
Full article ">Figure 4
<p>Gas-phase temperature and vaporized fuel mass fraction change over radial distance at a 0.1-megapascal ambient pressure for a 0.8-millimeter n-heptane droplet in different ambient temperatures.</p>
Full article ">Figure 5
<p>Vaporization rate of an n-heptane droplet based on the ambient temperature for different ambient pressures in microgravity [<a href="#B21-entropy-25-01232" class="html-bibr">21</a>].</p>
Full article ">Figure 6
<p>Gas-phase temperature and vaporized fuel mass fraction changes over radial distance at a 648-kelvin ambient temperature for a 0.8-millimeter n-heptane droplet in different ambient pressures.</p>
Full article ">Figure 7
<p>Entropy generation due to each irreversible process involved in a 0.8-millimeter n-heptane droplet evaporation at 648 K and 0.1 MPa.</p>
Full article ">Figure 8
<p>Entropy flow due to each reversible process involved in a 0.8-millimeter n-heptane droplet evaporation at 648 K and 0.1 MPa.</p>
Full article ">
17 pages, 1695 KiB  
Article
First Detection and Tunneling Time of a Quantum Walk
by Zhenbo Ni and Yujun Zheng
Entropy 2023, 25(8), 1231; https://doi.org/10.3390/e25081231 - 18 Aug 2023
Cited by 1 | Viewed by 1025
Abstract
We consider the first detection problem for a one-dimensional quantum walk with repeated local measurements. Employing the stroboscopic projective measurement protocol and the renewal equation, we study the effect of tunneling on the detection time. Specifically, we study the continuous-time quantum walk on [...] Read more.
We consider the first detection problem for a one-dimensional quantum walk with repeated local measurements. Employing the stroboscopic projective measurement protocol and the renewal equation, we study the effect of tunneling on the detection time. Specifically, we study the continuous-time quantum walk on an infinite tight-binding lattice for two typical situations with physical reality. The first is the case of a quantum walk in the absence of tunneling with a Gaussian initial state. The second is the case where a barrier is added to the system. It is shown that the transition of the decay behavior of the first detection probability can be observed by modifying the initial condition, and in the presence of a tunneling barrier, the particle can be detected earlier than the impurity-free lattice. This suggests that the evolution of the walker is expedited when it tunnels through the barrier under repeated measurement. The first detection tunneling time is introduced to investigate the tunneling time of the quantum walk. In addition, we analyze the critical transitive point by deriving an asymptotic formula. Full article
(This article belongs to the Section Quantum Information)
Show Figures

Figure 1

Figure 1
<p>(<b>a</b>) The stroboscopic detection protocol. The particle propagates freely between two adjacent measurements, and the detection time interval is <math display="inline"><semantics> <mi>τ</mi> </semantics></math>. (<b>b</b>) The lattice system for the quantum walk. The initial condition <math display="inline"><semantics> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>ψ</mi> <mrow> <mi>i</mi> <mi>n</mi> </mrow> </msub> <mrow> <mo stretchy="false">〉</mo> </mrow> </mrow> </semantics></math> is a wave packet, and we measure whether the particles arrive at the destination by a projective operator <math display="inline"><semantics> <mrow> <mover accent="true"> <mi>D</mi> <mo>^</mo> </mover> <mo>=</mo> <mfenced separators="" open="|" close="&#x232A;"> <msub> <mi>ψ</mi> <mrow> <mi>d</mi> <mi>e</mi> <mi>t</mi> </mrow> </msub> </mfenced> <mfenced separators="" open="&#x2329;" close="|"> <msub> <mi>ψ</mi> <mrow> <mi>d</mi> <mi>e</mi> <mi>t</mi> </mrow> </msub> </mfenced> </mrow> </semantics></math>. The dashed line denotes a barrier located at a lattice. The cases with and without a barrier are discussed in <a href="#sec2dot2-entropy-25-01231" class="html-sec">Section 2.2</a> and <a href="#sec2dot3-entropy-25-01231" class="html-sec">Section 2.3</a>, respectively.</p>
Full article ">Figure 2
<p>The probabilities of the first detection for different initial conditions (log−log). The initial condition is a Gaussian wave packet which centered at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>c</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>10</mn> </mrow> </semantics></math>, and the detection state is <math display="inline"><semantics> <mrow> <mo stretchy="false">|</mo> <mn>0</mn> <mo stretchy="false">〉</mo> </mrow> </semantics></math>. The sampling time is <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> and the momentum <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. The circles, squares, and crosses numerically obtained by Equation (<a href="#FD23-entropy-25-01231" class="html-disp-formula">23</a>) represent the results of the width of the Gaussian wave packet <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>1</mn> <mo>/</mo> <mn>3</mn> <mo>,</mo> <mn>1</mn> <mo>,</mo> <mn>3</mn> </mrow> </semantics></math>, respectively. Generally, <math display="inline"><semantics> <mrow> <msub> <mi>F</mi> <mi>n</mi> </msub> <mo>∝</mo> <msup> <mi>n</mi> <mrow> <mo>−</mo> <mn>3</mn> </mrow> </msup> </mrow> </semantics></math> with superimposed oscillations, the latter vanish when the initial width of the wave packet <math display="inline"><semantics> <mi>σ</mi> </semantics></math> is large.</p>
Full article ">Figure 3
<p>The plot of the total detection probability. The horizontal ordinate <math display="inline"><semantics> <mi>τ</mi> </semantics></math> is the sampling time and the vertical coordinate represents the total probability given by Equation (<a href="#FD11-entropy-25-01231" class="html-disp-formula">11</a>). For small <math display="inline"><semantics> <mi>τ</mi> </semantics></math>, we have the Zeno limit, namely, the particle cannot be detected at all. The non-analytical behaviour at the sampling time provided by Equation (<a href="#FD26-entropy-25-01231" class="html-disp-formula">26</a>) is visible with a finite width of the packet.</p>
Full article ">Figure 4
<p>The total detection probability for different widths of the wave packet. The initial condition is a Gaussian wave packet centered at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>c</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>10</mn> </mrow> </semantics></math>. The detection site is located at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>d</mi> </msub> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>, and the magnitude of the barrier is <math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>The probability distribution <math display="inline"><semantics> <msub> <mi>F</mi> <mi>n</mi> </msub> </semantics></math> of first detection in the <span class="html-italic">n</span>th attempt for the different widths of the wave packet (log−log). The initial condition is a Gaussian wave packet centered at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>c</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>100</mn> </mrow> </semantics></math>, the wave vector is <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mn>0</mn> </msub> <mo>=</mo> <mi>π</mi> <mo>/</mo> <mn>8</mn> </mrow> </semantics></math>, and the sampling time is <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. We measured the particles at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>d</mi> </msub> <mo>=</mo> <mn>100</mn> </mrow> </semantics></math>, and the magnitude of the barrier is <math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>2</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>The tunneling time of a quantum walk as a function of <math display="inline"><semantics> <msub> <mi>k</mi> <mn>0</mn> </msub> </semantics></math>. The wide Gaussian wave packet (<math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>) is centered at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>c</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>100</mn> </mrow> </semantics></math>, the magnitudes of the barrier are <math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>, corresponding to the orange triangles, and <math display="inline"><semantics> <mrow> <mi>ϵ</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>, corresponding to the purple diamonds, and the sampling time <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. We measure the walker at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>d</mi> </msub> <mo>=</mo> <mn>100</mn> </mrow> </semantics></math>. The tunneling time is provided by Equation (<a href="#FD28-entropy-25-01231" class="html-disp-formula">28</a>).</p>
Full article ">Figure 7
<p>The tunneling time of a quantum walk as a function of the number of the defects, denoted by <span class="html-italic">ℓ</span> (log−log). The parameters of the simulation were as follows: the spread of the initial wave packet was 10, the distance between the detector and the starting point was 200, the projective measurement was operated at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>d</mi> </msub> <mo>=</mo> <mn>100</mn> </mrow> </semantics></math>, and the magnitude of the defects was 3.</p>
Full article ">Figure 8
<p>The plot of the asymptotic result of Equation (<a href="#FD42-entropy-25-01231" class="html-disp-formula">42</a>) (log−log). The width of the Gaussian wave is <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>, the detection state <math display="inline"><semantics> <mrow> <mrow> <mo stretchy="false">|</mo> </mrow> <msub> <mi>ψ</mi> <mrow> <mi>d</mi> <mi>e</mi> <mi>t</mi> </mrow> </msub> <mrow> <mo stretchy="false">〉</mo> <mo>=</mo> <mo stretchy="false">|</mo> <mn>90</mn> <mo stretchy="false">〉</mo> </mrow> </mrow> </semantics></math>, the initial state is centred at <math display="inline"><semantics> <mrow> <msub> <mi>j</mi> <mi>c</mi> </msub> <mo>=</mo> <mo>−</mo> <mn>10</mn> </mrow> </semantics></math>, and the sampling time <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.2</mn> </mrow> </semantics></math>.</p>
Full article ">
14 pages, 2020 KiB  
Article
Nonequilibrium Thermodynamics of the Majority Vote Model
by Felipe Hawthorne, Pedro E. Harunari, Mário J. de Oliveira and Carlos E. Fiore
Entropy 2023, 25(8), 1230; https://doi.org/10.3390/e25081230 - 18 Aug 2023
Cited by 2 | Viewed by 1193
Abstract
The majority vote model is one of the simplest opinion systems yielding distinct phase transitions and has garnered significant interest in recent years. This model, as well as many other stochastic lattice models, are formulated in terms of stochastic rules with no connection [...] Read more.
The majority vote model is one of the simplest opinion systems yielding distinct phase transitions and has garnered significant interest in recent years. This model, as well as many other stochastic lattice models, are formulated in terms of stochastic rules with no connection to thermodynamics, precluding the achievement of quantities such as power and heat, as well as their behaviors at phase transition regimes. Here, we circumvent this limitation by introducing the idea of a distinct and well-defined thermal reservoir associated to each local configuration. Thermodynamic properties are derived for a generic majority vote model, irrespective of its neighborhood and lattice topology. The behavior of energy/heat fluxes at phase transitions, whether continuous or discontinuous, in regular and complex topologies, is investigated in detail. Unraveling the contribution of each local configuration explains the nature of the phase diagram and reveals how dissipation arises from the dynamics. Full article
(This article belongs to the Special Issue Non-equilibrium Phase Transitions)
Show Figures

Figure 1

Figure 1
<p>Scheme representing the values of <math display="inline"><semantics> <msup> <mo>ℓ</mo> <mo>*</mo> </msup> </semantics></math> for <math display="inline"><semantics> <mrow> <msub> <mi>η</mi> <mi>i</mi> </msub> <mo>=</mo> <mo>±</mo> <mn>1</mn> </mrow> </semantics></math> corresponding to the plateaus. In the shaded area, where <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> <mo>ℓ</mo> <mo>|</mo> <mo>&lt;</mo> <mo>|</mo> </mrow> <msup> <mo>ℓ</mo> <mo>*</mo> </msup> <mrow> <mo>|</mo> </mrow> </mrow> </semantics></math>, the neighborhoods do not contribute to the entropy production.</p>
Full article ">Figure 2
<p>In (<b>a</b>), the phase diagram of the inertial majority model for a regular lattice for <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>. Vertical lines mark the plateau positions predicted in Equation (<a href="#FD3-entropy-25-01230" class="html-disp-formula">3</a>). Panel (<b>b</b>) depicts the entropy production <math display="inline"><semantics> <mi>σ</mi> </semantics></math> for distinct system sizes <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <msup> <mi>L</mi> <mn>2</mn> </msup> </mrow> </semantics></math>’s. Continuous lines denote the phenomenological description from Equation (<a href="#FD11-entropy-25-01230" class="html-disp-formula">11</a>) and vertical line corresponds to the crossing among entropy production curves at <math display="inline"><semantics> <mrow> <msub> <mi>f</mi> <mi>c</mi> </msub> <mo>=</mo> <mn>0.05085</mn> <mrow> <mo>(</mo> <mn>2</mn> <mo>)</mo> </mrow> </mrow> </semantics></math>. In (<b>c</b>), the derivative <math display="inline"><semantics> <mrow> <msup> <mi>σ</mi> <mo>′</mo> </msup> <mo>≡</mo> <mi>d</mi> <mi>σ</mi> <mo>/</mo> <mi>d</mi> <mi>f</mi> </mrow> </semantics></math> versus <span class="html-italic">f</span> obtained from continuous lines in (<b>b</b>). Panel (<b>d</b>) show the position <math display="inline"><semantics> <msubsup> <mi>f</mi> <mi>c</mi> <mo>*</mo> </msubsup> </semantics></math> of maximum of <math display="inline"><semantics> <msup> <mi>σ</mi> <mo>′</mo> </msup> </semantics></math> versus <math display="inline"><semantics> <msup> <mi>N</mi> <mrow> <mo>−</mo> <mn>1</mn> </mrow> </msup> </semantics></math> and its accordance with the crossing among entropy production curves yielding (symbol •) as <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>→</mo> <mo>∞</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Phase transition for the MV in a random-regular topology with connectivity <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>. Panel (<b>a</b>) depicts the phase diagram <math display="inline"><semantics> <mi>θ</mi> </semantics></math> versus <span class="html-italic">f</span>. Continuous and dashed lines show, for a system of size <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <msup> <mn>10</mn> <mn>4</mn> </msup> </mrow> </semantics></math>. Note that a hysteretic branch for <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>&gt;</mo> <mn>3</mn> <mo>/</mo> <mn>13</mn> </mrow> </semantics></math>. Panels (<b>b</b>,<b>c</b>) show, for <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <mn>3</mn> <mo>/</mo> <mn>8</mn> </mrow> </semantics></math>, the order parameter <math display="inline"><semantics> <mrow> <mo>|</mo> <mi>m</mi> <mo>|</mo> </mrow> </semantics></math> versus <span class="html-italic">f</span> for distinct large and small system sizes <span class="html-italic">N</span>, respectively. Inset: the reduced cumulant <math display="inline"><semantics> <msub> <mi>U</mi> <mn>4</mn> </msub> </semantics></math> versus <span class="html-italic">f</span>. Circles and × attempt to the forward and backward “trajectories”, respectively. In (<b>d</b>), its corresponding <math display="inline"><semantics> <mi>σ</mi> </semantics></math>’s for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>5000</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>(<b>Left</b>) Convergence to the detailed fluctuation theorem as integration window <math display="inline"><semantics> <mi>τ</mi> </semantics></math> increases for a lattice <math display="inline"><semantics> <mrow> <mi>L</mi> <mo>=</mo> <mn>6</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>=</mo> <mn>0.04</mn> </mrow> </semantics></math>; solid lines are simulation results while dashed lines are the respective linear fits. (<b>Right</b>) Convergence to the integral fluctuation theorem for the case with no inertia (blue) and with inertia <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <mn>3</mn> <mo>/</mo> <mn>8</mn> </mrow> </semantics></math> (green); additional parameters are <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <msup> <mn>10</mn> <mn>4</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>For the regular lattice with <math display="inline"><semantics> <mrow> <mi>θ</mi> <mo>=</mo> <mn>3</mn> <mo>/</mo> <mn>8</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math> and distinct system sizes <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <msup> <mi>L</mi> <mn>2</mn> </msup> </mrow> </semantics></math>, panels (<b>a</b>,<b>b</b>) depict the most representative (largest absolute values) heat fluxes per particle <math display="inline"><semantics> <msub> <mo>Φ</mo> <mo>ℓ</mo> </msub> </semantics></math>’s versus control parameter <span class="html-italic">f</span>. Continuous lines denote correspond to the phenomenological approach according to the ideas of Equation (<a href="#FD11-entropy-25-01230" class="html-disp-formula">11</a>). Although the component heat flux panel (<b>c</b>) mildly changes with <span class="html-italic">f</span>, all curves also cross at <math display="inline"><semantics> <msub> <mi>f</mi> <mi>c</mi> </msub> </semantics></math>. Panel (<b>d</b>) shows all <math display="inline"><semantics> <msub> <mo>Φ</mo> <mo>ℓ</mo> </msub> </semantics></math>’s (<math display="inline"><semantics> <mrow> <mo>ℓ</mo> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mn>4</mn> <mo>,</mo> <mo>.</mo> <mo>.</mo> <mo>.</mo> <mo>,</mo> <mi>k</mi> </mrow> </semantics></math>) for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <msup> <mn>60</mn> <mn>2</mn> </msup> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>For a system of size <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>5000</mn> </mrow> </semantics></math>, (<b>a</b>)–(<b>d</b>) the same as before, but for a random-regular structure.</p>
Full article ">Figure 7
<p>For <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>20</mn> </mrow> </semantics></math>, random-regular (<b>left</b>) and regular (<b>right</b>) structures of sizes <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>=</mo> <mn>1600</mn> </mrow> </semantics></math> and <math display="inline"><semantics> <msup> <mn>40</mn> <mn>2</mn> </msup> </semantics></math>, curves for <math display="inline"><semantics> <msub> <mi>σ</mi> <mrow> <msup> <mo>ℓ</mo> <mo>*</mo> </msup> <mo>,</mo> <mi>k</mi> </mrow> </msub> </semantics></math> (dot-dashed) and <math display="inline"><semantics> <mi>σ</mi> </semantics></math> (continuous) are shown in terms of <span class="html-italic">f</span> for distinct <math display="inline"><semantics> <mi>θ</mi> </semantics></math>’s. From top to bottom, <math display="inline"><semantics> <mrow> <msup> <mo>ℓ</mo> <mo>*</mo> </msup> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mn>4</mn> <mo>,</mo> <mn>6</mn> <mo>,</mo> <mn>12</mn> </mrow> </semantics></math> and 14.</p>
Full article ">
20 pages, 34080 KiB  
Article
A Hybrid Model for Cardiac Perfusion: Coupling a Discrete Coronary Arterial Tree Model with a Continuous Porous-Media Flow Model of the Myocardium
by João R. Alves, Lucas A. Berg, Evandro D. Gaio, Bernardo M. Rocha, Rafael A. B. de Queiroz and Rodrigo W. dos Santos
Entropy 2023, 25(8), 1229; https://doi.org/10.3390/e25081229 - 18 Aug 2023
Viewed by 1258
Abstract
This paper presents a novel hybrid approach for the computational modeling of cardiac perfusion, combining a discrete model of the coronary arterial tree with a continuous porous-media flow model of the myocardium. The constructive constrained optimization (CCO) algorithm captures the detailed topology and [...] Read more.
This paper presents a novel hybrid approach for the computational modeling of cardiac perfusion, combining a discrete model of the coronary arterial tree with a continuous porous-media flow model of the myocardium. The constructive constrained optimization (CCO) algorithm captures the detailed topology and geometry of the coronary arterial tree network, while Poiseuille’s law governs blood flow within this network. Contrast agent dynamics, crucial for cardiac MRI perfusion assessment, are modeled using reaction–advection–diffusion equations within the porous-media framework. The model incorporates fibrosis–contrast agent interactions and considers contrast agent recirculation to simulate myocardial infarction and Gadolinium-based late-enhancement MRI findings. Numerical experiments simulate various scenarios, including normal perfusion, endocardial ischemia resulting from stenosis, and myocardial infarction. The results demonstrate the model’s efficacy in establishing the relationship between blood flow and stenosis in the coronary arterial tree and contrast agent dynamics and perfusion in the myocardial tissue. The hybrid model enables the integration of information from two different exams: computational fractional flow reserve (cFFR) measurements of the heart coronaries obtained from CT scans and heart perfusion and anatomy derived from MRI scans. The cFFR data can be integrated with the discrete arterial tree, while cardiac perfusion MRI data can be incorporated into the continuum part of the model. This integration enhances clinical understanding and treatment strategies for managing cardiovascular disease. Full article
Show Figures

Figure 1

Figure 1
<p>Model of two domains (<b>a</b>), used to simulate the scenarios of (1) healthy and (2) ischemic myocardium; and the model with three domains (<b>b</b>). The third domain is used to simulate a scenario of (3) infarction.</p>
Full article ">Figure 2
<p>Communication between intravascular domain, built using CCO method, and the extravascular one; continuum. This communication takes place at the terminal segments of the arterial tree.</p>
Full article ">Figure 3
<p>Data structure used to represent the arterial tree provided by the CCO method. On the left, the figure represents the network of points obtained from the spatial discretization of size <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>x</mi> </mrow> </semantics></math>, made upon the arterial tree. The figure on the right shows the graph structure: there is a linked list of nodes, and each node has a list of edges. This way, each node has the information on where the CA is coming from and to which neighbors the flow is going to be directed.</p>
Full article ">Figure 4
<p>Node 1, of the regular type, i.e., has only two neighbours, 0 and 2, and the respective faces used at the FVM, <span class="html-italic">a</span> and <span class="html-italic">b</span>.</p>
Full article ">Figure 5
<p>Node 2, of the type bifurcation, i.e., it has three neighbours, 1, 3 and 4, and the respective faces used at the FVM, <span class="html-italic">a</span>, <span class="html-italic">b</span> and <span class="html-italic">c</span>.</p>
Full article ">Figure 6
<p>Node 3, of the terminal type, i.e., it has only one neighbour, node 2, and the respective faces <span class="html-italic">a</span> and <span class="html-italic">b</span> used at the FVM scheme.</p>
Full article ">Figure 7
<p>Simplified representation of the regions perfused by the trees from coronary arteries: LCX, LAD, and RCA. It is also indicated the position of the myocardial papilary muscles. Adapted from [<a href="#B30-entropy-25-01229" class="html-bibr">30</a>].</p>
Full article ">Figure 8
<p>Results of the simulations carried out: (<b>a</b>) healthy, (<b>b</b>) ischemia, and (<b>c</b>) infarction. (<b>b</b>,<b>c</b>) indicate the stenosis position, where a reduced flow is imposed. For the ischemic case, the flow was decreased by a factor of 25 (<math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math>), whereas for the infarction, it was decreased by a factor of 30 (<math display="inline"><semantics> <mrow> <mi>α</mi> <mo>=</mo> <mn>30</mn> </mrow> </semantics></math>). Panel (<b>d</b>) shows the regions of interest (remote and damaged) for the evaluation of the signal intensity of the contrast agent.</p>
Full article ">Figure 9
<p>Results of the grid independence test in terms of the total extravascular concentration as a function of time for meshes consisting of <math display="inline"><semantics> <mrow> <mn>100</mn> <mo>×</mo> <mn>100</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mn>200</mn> <mo>×</mo> <mn>200</mn> </mrow> </semantics></math>, and <math display="inline"><semantics> <mrow> <mn>400</mn> <mo>×</mo> <mn>400</mn> </mrow> </semantics></math> nodes.</p>
Full article ">Figure 10
<p>Profiles of (<b>a</b>) blood flow (mL/min); (<b>b</b>) length of the segments; and (<b>c</b>) radius of the segments for the arterial trees provided by the CCO method.</p>
Full article ">Figure 11
<p>Dynamics of the CA at the end (50 s) of the exams first pass (FP) and after the late enhancement (LE) at 600 s.</p>
Full article ">Figure 12
<p>Contrast agent concentration for the (<b>a</b>) infarction and (<b>b</b>) ischemia scenarios at every 50 s until the final time of 450 s.</p>
Full article ">
16 pages, 463 KiB  
Article
Multi-User PIR with Cyclic Wraparound Multi-Access Caches
by Kanishak Vaidya and Balaji Sundar Rajan
Entropy 2023, 25(8), 1228; https://doi.org/10.3390/e25081228 - 18 Aug 2023
Viewed by 1171
Abstract
We consider the problem of multi-access cache-aided multi-user Private Information Retrieval (MACAMuPIR) with cyclic wraparound cache access. In MACAMuPIR, several files are replicated across multiple servers. There are multiple users and multiple cache nodes. When the network is not congested, servers fill these [...] Read more.
We consider the problem of multi-access cache-aided multi-user Private Information Retrieval (MACAMuPIR) with cyclic wraparound cache access. In MACAMuPIR, several files are replicated across multiple servers. There are multiple users and multiple cache nodes. When the network is not congested, servers fill these cache nodes with the content of the files. During peak network traffic, each user accesses several cache nodes. Every user wants to retrieve one file from the servers but does not want the servers to know their demands. This paper proposes a private retrieval scheme for MACAMuPIR and characterizes the transmission cost for multi-access systems with cyclic wraparound cache access. We formalize privacy and correctness constraints and analyze transmission costs. The scheme outperforms the previously known dedicated cache setup, offering efficient and private retrieval. Results demonstrate the effectiveness of the multi-access approach. Our research contributes an efficient, privacy-preserving solution for multi-user PIR, advancing secure data retrieval from distributed servers. Full article
(This article belongs to the Special Issue Information Theory for Distributed Systems)
Show Figures

Figure 1

Figure 1
<p>Multi-access coded caching setup with cyclic wraparound cache access with four users, four helper cache and two servers. Each user is accessing two adjacent helper caches.</p>
Full article ">Figure 2
<p>Comparison of transmission costs for dedicated cache (dotted lines) and multi-access (solid lines) with cyclic wraparound cache access. Here, we take <math display="inline"><semantics> <mrow> <mi>K</mi> <mo>=</mo> <mn>8</mn> </mrow> </semantics></math> users and cache nodes.</p>
Full article ">Figure 3
<p>Transmission cost for <math display="inline"><semantics> <mrow> <mi>K</mi> <mo>=</mo> <mn>8</mn> <mo>,</mo> <mi>L</mi> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mi>S</mi> <mo>=</mo> <mn>2</mn> <mo>,</mo> <mi>N</mi> <mo>=</mo> <mn>3</mn> </mrow> </semantics></math>. Multi-access setup with cyclic wraparound cache access incur transmission cost only as high as dedicated cache setup with equal total memory in both systems.</p>
Full article ">
16 pages, 1608 KiB  
Article
Quantum Knowledge in Phase Space
by Davi Geiger
Entropy 2023, 25(8), 1227; https://doi.org/10.3390/e25081227 - 17 Aug 2023
Cited by 1 | Viewed by 1338
Abstract
Quantum physics through the lens of Bayesian statistics considers probability to be a degree of belief and subjective. A Bayesian derivation of the probability density function in phase space is presented. Then, a Kullback–Liebler divergence in phase space is introduced to define interference [...] Read more.
Quantum physics through the lens of Bayesian statistics considers probability to be a degree of belief and subjective. A Bayesian derivation of the probability density function in phase space is presented. Then, a Kullback–Liebler divergence in phase space is introduced to define interference and entanglement. Comparisons between each of these two quantities and the entropy are made. A brief presentation of entanglement in phase space to the spin degree of freedom and an extension to mixed states completes the work. Full article
(This article belongs to the Special Issue Shannon Entropy: Mathematical View)
Show Figures

Figure 1

Figure 1
<p>Normal distribution in phase space for two coherent states, <span style="color: #0000FF"><b>A</b></span> and <span style="color: #FF0000"><b>B</b></span> in 1D with centers and variances as follows. For all (<b>a</b>–<b>c</b>) position space probabilities, with <b><math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>27</mn> </mrow> </semantics></math></b> with <b><math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>5.6</mn> </mrow> </semantics></math></b> and for (<b>a</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>27</mn> </mrow> </semantics></math></b>, (<b>b</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>37</mn> </mrow> </semantics></math></b>, (<b>c</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>48</mn> </mrow> </semantics></math></b>, all with <b><math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>4.2</mn> </mrow> </semantics></math></b>. Note that for each coherent state, the spatial frequency value is the phase of the coherent state in position space. For (<b>d</b>–<b>f</b>), spatial frequency space probabilities, with <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>≈</mo> <mn>0.35</mn> </mrow> </semantics></math></b> and (<b>d</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>0.35</mn> </mrow> </semantics></math></b>, (<b>e</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>0.75</mn> </mrow> </semantics></math></b>, (<b>f</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>1.15</mn> </mrow> </semantics></math></b>. For (<b>g</b>–<b>i</b>), spatial frequency space probabilities, with <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>≈</mo> <mn>1.04</mn> </mrow> </semantics></math></b> and (<b>g</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>1.04</mn> </mrow> </semantics></math></b>, (<b>h</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>1.55</mn> </mrow> </semantics></math></b>, (<b>i</b>) <b><math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>≈</mo> <mn>2.05</mn> </mrow> </semantics></math></b>.</p>
Full article ">Figure 2
<p>Interference Simulations for a superposition of two coherent states as shown in <a href="#entropy-25-01227-f001" class="html-fig">Figure 1</a>. The coherent state <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> </mrow> <msup> <mi mathvariant="sans-serif">Ψ</mi> <mi mathvariant="normal">A</mi> </msup> <mrow> <mo>〉</mo> </mrow> </mrow> </semantics></math> has <math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>27</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>5.6</mn> </mrow> </semantics></math>, and for (<b>a</b>,<b>b</b>) the phase is <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math> while for (<b>c</b>,<b>d</b>), the phase is <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>1.04</mn> </mrow> </semantics></math>. The other coherent state <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> </mrow> <msup> <mi mathvariant="sans-serif">Ψ</mi> <mi mathvariant="normal">B</mi> </msup> <mrow> <mo>〉</mo> </mrow> </mrow> </semantics></math> in position has fixed <math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>4.2</mn> </mrow> </semantics></math> and the position center and phase vary in 48 increments each, as follows: <math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>=</mo> <mrow> <mo>[</mo> <mn>27</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>48</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>, and for (<b>a</b>,<b>b</b>), the phase varies as <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>=</mo> <mrow> <mo>[</mo> <mn>0.35</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>1.15</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>, while for (<b>c</b>,<b>d</b>), the phase varies as <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>=</mo> <mrow> <mo>[</mo> <mn>1.04</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>2.05</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>. The plots axis are all with <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>μ</mi> <mo>=</mo> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>−</mo> <msub> <mi>μ</mi> <mi>A</mi> </msub> </mrow> </semantics></math> vs. <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>k</mi> <mo>=</mo> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>−</mo> <msub> <mi>k</mi> <mi>A</mi> </msub> </mrow> </semantics></math>. The KLD and the entropy become small as the two states closely overlap, i.e., where <math display="inline"><semantics> <mrow> <mi>δ</mi> <mi>μ</mi> <mo>≈</mo> <mi>δ</mi> <mi>k</mi> <mo>≈</mo> <mn>0</mn> </mrow> </semantics></math>. However, the KLD becomes small as the states do not overlap while the entropy gets to be larger. As the phase increases from (<b>a</b>,<b>b</b>) to (<b>c</b>,<b>d</b>) oscillation increases for both (KLD and Entropy) as periods reduce. Entropy seems to be a good estimation for the interference behavior when the two states overlap either in spatial frequency or in position. However, the more the overlap in both spaces is reduced the more the two quantities differ in behavior.</p>
Full article ">Figure 3
<p>Entanglement simulations from two coherent states shown in <a href="#entropy-25-01227-f001" class="html-fig">Figure 1</a>, with normal probability distributions. Note that the phase of the coherent state projected to position space is the center of the coherent state projected in the spatial frequency space, and vice versa. The coherent state <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> </mrow> <msup> <mi mathvariant="sans-serif">Ψ</mi> <mi mathvariant="normal">A</mi> </msup> <mrow> <mo>〉</mo> </mrow> </mrow> </semantics></math> has a fixed set of parameters, <math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>27</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>5.6</mn> </mrow> </semantics></math> in position space, and for (<b>a</b>,<b>b</b>) the phase is <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math> while for (<b>c</b>–<b>f</b>) the phase is <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>A</mi> </msub> <mo>=</mo> <mn>1.04</mn> </mrow> </semantics></math>. The coherent state <math display="inline"><semantics> <mrow> <mrow> <mo>|</mo> </mrow> <msup> <mi mathvariant="sans-serif">Ψ</mi> <mi mathvariant="normal">B</mi> </msup> <mrow> <mo>〉</mo> </mrow> </mrow> </semantics></math> in position has fixed <math display="inline"><semantics> <mrow> <msub> <mi>σ</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>4.2</mn> </mrow> </semantics></math> and the center and phase vary in 48 increments each, as follows: <math display="inline"><semantics> <mrow> <msub> <mi>μ</mi> <mi>B</mi> </msub> <mo>∈</mo> <mrow> <mo>[</mo> <mn>27</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>48</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>, and for (<b>a</b>,<b>b</b>) <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>∈</mo> <mrow> <mo>[</mo> <mn>0.35</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>1.15</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>, while for (<b>c</b>–<b>f</b>) the phase varies as <math display="inline"><semantics> <mrow> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>∈</mo> <mrow> <mo>[</mo> <mn>1.04</mn> <mo>,</mo> <mo>…</mo> <mo>,</mo> <mn>2.05</mn> <mo>]</mo> </mrow> </mrow> </semantics></math>. The parameter <math display="inline"><semantics> <mrow> <msub> <mi>θ</mi> <mn>2</mn> </msub> <mo>=</mo> <mfrac> <mrow> <mi>p</mi> <mi>i</mi> </mrow> <mn>4</mn> </mfrac> </mrow> </semantics></math> is fixed when entangling the two states. Cases (<b>a</b>–<b>d</b>) show KLD and Entropy, respectively, for a symmetric entanglement where phase <math display="inline"><semantics> <mrow> <msub> <mi>φ</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math>. Cases (<b>e</b>,<b>f</b>) show KLD and Entropy, respectively, for an anti-symmetric entanglement where phase <math display="inline"><semantics> <mrow> <msub> <mi>φ</mi> <mn>2</mn> </msub> <mo>=</mo> <mi>π</mi> </mrow> </semantics></math>. The effect of the phase <math display="inline"><semantics> <msub> <mi>φ</mi> <mn>2</mn> </msub> </semantics></math> is only noticeable when the two states are very similar to each other and then both, KLD and entropy, yield large values for the anti-symmetric case (after all anti-symmetric functions must vanish in these cases, while the product of states does not). While the KLD has a smoother behavior, both increase as the separation of the two coherent state parameters increases. The larger values of the phase parameters in (<b>c</b>–<b>f</b>) clearly cause a periodic behavior. Entropy behavior seems to be a good estimation for entanglement.</p>
Full article ">
8 pages, 272 KiB  
Tutorial
Second Law and Its Amendment: The Axiom of No-Reversible Directions Revisited
by Wolfgang Muschik
Entropy 2023, 25(8), 1226; https://doi.org/10.3390/e25081226 - 17 Aug 2023
Cited by 2 | Viewed by 933
Abstract
A toy model is used to describe the following steps to achieve the no-reversible-direction axiom in a tutorial manner: (i) choose a state space results in the balance equations on state space which are linear in the process directions, (ii) avoid a reversible [...] Read more.
A toy model is used to describe the following steps to achieve the no-reversible-direction axiom in a tutorial manner: (i) choose a state space results in the balance equations on state space which are linear in the process directions, (ii) avoid a reversible process direction that cannot be generated via a combination of non-reversible ones, (iii) process directions that are in the kernel of the balance equations and do not enter the entropy production. The Coleman–Mizel formulation of the second law and the Liu relations follow immediately. Full article
(This article belongs to the Special Issue Thermodynamic Constitutive Theory and Its Application)
23 pages, 1111 KiB  
Article
Students’ Learning Behaviour in Programming Education Analysis: Insights from Entropy and Community Detection
by Tai Tan Mai, Martin Crane and Marija Bezbradica
Entropy 2023, 25(8), 1225; https://doi.org/10.3390/e25081225 - 17 Aug 2023
Cited by 2 | Viewed by 2075
Abstract
The high dropout rates in programming courses emphasise the need for monitoring and understanding student engagement, enabling early interventions. This activity can be supported by insights into students’ learning behaviours and their relationship with academic performance, derived from student learning log data in [...] Read more.
The high dropout rates in programming courses emphasise the need for monitoring and understanding student engagement, enabling early interventions. This activity can be supported by insights into students’ learning behaviours and their relationship with academic performance, derived from student learning log data in learning management systems. However, the high dimensionality of such data, along with their numerous features, pose challenges to their analysis and interpretability. In this study, we introduce entropy-based metrics as a novel manner to represent students’ learning behaviours. Employing these metrics, in conjunction with a proven community detection method, we undertake an analysis of learning behaviours across higher- and lower-performing student communities. Furthermore, we examine the impact of the COVID-19 pandemic on these behaviours. The study is grounded in the analysis of empirical data from 391 Software Engineering students over three academic years. Our findings reveal that students in higher-performing communities typically tend to have lower volatility in entropy values and reach stable learning states earlier than their lower-performing counterparts. Importantly, this study provides evidence of the use of entropy as a simple yet insightful metric for educators to monitor study progress, enhance understanding of student engagement, and enable timely interventions. Full article
(This article belongs to the Special Issue Entropy-Based Applications in Sociophysics)
Show Figures

Figure 1

Figure 1
<p>The heat maps show the entropy values for each student on each day in their programming courses. Warmer colours (more red) suggest higher entropy values and more active learning activities, while cooler colours (more blue) indicate lower entropy values and less active learning behaviours. In each figure, within every seven days, typically two days emerge as significantly more active than the rest, as evidenced by the majority of students exhibiting higher entropy values. This pattern aligns with the instructional schedule, wherein students typically dedicate one day to lecture sessions and another day to practical exercises in the lab. On non-scheduled learning days, a subset of students displays no activity, as evidenced by zero entropy values and the resultant plain blue hue on the heat maps.</p>
Full article ">Figure 2
<p>The percentage of students having positive learning behavioural entropy values in three years of the course. Within each week, a substantial majority of students—typically exceeding 80%—in both higher- and lower-performing communities were observed to be actively engaged on lecture and practice days. The higher-performing communities (green lines) consistently display a higher percentage of active students, particularly on non-scheduled studying days, in comparison with that of the lower-performing communities (red lines).</p>
Full article ">Figure 3
<p>The distribution of the coefficient of variation of entropy by higher- and lower-performing student communities across three courses. Learning dynamics present higher coefficients of variation in early stages, which decrease as courses progress. Lower-performing students (green bars) show higher entropy variation than higher-performing ones (red bars). Higher-performing communities stabilise earlier (red bars) than lower-performing communities (green bars). The vertical solid lines mark the “split-up day”—meaning that, in the following days, the statically significant differences between the two communities have been found.</p>
Full article ">Figure 4
<p>The distribution of the coefficient of variation of entropy for the courses before and during the COVID-19-pandemic. Note that the End semester phase refers to the end point of the course, i.e., after week 12 with Module-2018 and Module-2019, and after week 10 with Module-2020.</p>
Full article ">
16 pages, 6724 KiB  
Article
Efficient Numerical Simulation of Biochemotaxis Phenomena in Fluid Environments
by Xingying Zhou, Guoqing Bian, Yan Wang and Xufeng Xiao
Entropy 2023, 25(8), 1224; https://doi.org/10.3390/e25081224 - 17 Aug 2023
Viewed by 1068
Abstract
A novel dimension splitting method is proposed for the efficient numerical simulation of a biochemotaxis model, which is a coupled system of chemotaxis–fluid equations and incompressible Navier–Stokes equations. A second-order pressure correction method is employed to decouple the velocity and pressure for the [...] Read more.
A novel dimension splitting method is proposed for the efficient numerical simulation of a biochemotaxis model, which is a coupled system of chemotaxis–fluid equations and incompressible Navier–Stokes equations. A second-order pressure correction method is employed to decouple the velocity and pressure for the Navier–Stokes equations. Then, the alternating direction implicit scheme is used to solve the velocity equation, and the operator with dimension splitting effect is used instead of the traditional elliptic operator to solve the pressure equation. For the chemotactic equation, the operator splitting method and extrapolation technique are used to solve oxygen and cell density to achieve second-order time accuracy. The proposed dimension splitting method splits the two-dimensional problem into a one-dimensional problem by splitting the spatial derivative, which reduces the computation and storage costs. Finally, through interesting experiments, we show the evolution of the cell plume shape during the descent process. The effect of changing specific parameters on the velocity and plume shape during the descent process is also studied. Full article
(This article belongs to the Topic Numerical Methods for Partial Differential Equations)
Show Figures

Figure 1

Figure 1
<p>A diagram of the location of variables (<math display="inline"><semantics> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>,</mo> <msub> <mi>v</mi> <mn>2</mn> </msub> <mo>,</mo> <mi>p</mi> <mo>,</mo> <mi>q</mi> <mo>,</mo> <mi>c</mi> </mrow> </semantics></math>).</p>
Full article ">Figure 2
<p>The convergence and accuracy comparison results of the proposed method. (<b>a</b>) The proposed dimension splitting method. (<b>b</b>) Standard FD discretization without dimension splitting.</p>
Full article ">Figure 3
<p>Simulation results of a biochemotaxis phenomenon with <math display="inline"><semantics> <mrow> <mi>ζ</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>50</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>5000</mn> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>. (<b>d</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.092</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.092</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.092</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.113</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.113</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.113</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 4
<p>Simulation results of a biochemotaxis phenomenon <math display="inline"><semantics> <mrow> <mi>ζ</mi> <mo>=</mo> <mn>25</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>50</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>5000</mn> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.035</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.035</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.035</mn> </mrow> </semantics></math>. (<b>d</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.052</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.052</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.052</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.06</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.06</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.06</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.07</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Simulation results of a biochemotaxis phenomenon <math display="inline"><semantics> <mrow> <mi>ζ</mi> <mo>=</mo> <mn>50</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>50</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>5000</mn> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.03</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.03</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.03</mn> </mrow> </semantics></math>. (<b>d</b>)<span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.05</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.058</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.058</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.058</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.067</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.067</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.067</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Simulation results of a biochemotaxis phenomenon <math display="inline"><semantics> <mrow> <mi>ζ</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>1000</mn> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>. (<b>d</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.4</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Simulation results of a biochemotaxis phenomenon <math display="inline"><semantics> <mrow> <mi>ζ</mi> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>=</mo> <mn>30</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>=</mo> <mn>3000</mn> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.09</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.09</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.09</mn> </mrow> </semantics></math>. (<b>d</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.12</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.12</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.12</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.15</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.15</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.15</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>Simulation results of a biochemotaxis phenomenon with initial value <math display="inline"><semantics> <mrow> <msup> <mi>q</mi> <mn>0</mn> </msup> <mrow> <mo>(</mo> <mi>x</mi> <mo>,</mo> <mi>y</mi> <mo>)</mo> </mrow> <mo>=</mo> <mn>0.8</mn> <mo>+</mo> <mn>0.2</mn> <mo>·</mo> <mi>r</mi> <mi>a</mi> <mi>n</mi> <mi>d</mi> </mrow> </semantics></math>. (<b>a</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.095</mn> </mrow> </semantics></math>. (<b>b</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.095</mn> </mrow> </semantics></math>. (<b>c</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.095</mn> </mrow> </semantics></math>. (<b>d</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>e</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>f</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.13</mn> </mrow> </semantics></math>. (<b>g</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.141</mn> </mrow> </semantics></math>. (<b>h</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.141</mn> </mrow> </semantics></math>. (<b>i</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.141</mn> </mrow> </semantics></math>. (<b>j</b>) <span class="html-italic">q</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.144</mn> </mrow> </semantics></math>. (<b>k</b>) <span class="html-italic">c</span> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.144</mn> </mrow> </semantics></math>. (<b>l</b>) <math display="inline"><semantics> <mi mathvariant="bold">u</mi> </semantics></math> at <math display="inline"><semantics> <mrow> <mi>t</mi> <mo>=</mo> <mn>0.144</mn> </mrow> </semantics></math>.</p>
Full article ">
22 pages, 4289 KiB  
Article
Application of the Fuzzy Approach for Evaluating and Selecting Relevant Objects, Features, and Their Ranges
by Wiesław Paja
Entropy 2023, 25(8), 1223; https://doi.org/10.3390/e25081223 - 17 Aug 2023
Viewed by 934
Abstract
Relevant attribute selection in machine learning is a key aspect aimed at simplifying the problem, reducing its dimensionality, and consequently accelerating computation. This paper proposes new algorithms for selecting relevant features and evaluating and selecting a subset of relevant objects in a dataset. [...] Read more.
Relevant attribute selection in machine learning is a key aspect aimed at simplifying the problem, reducing its dimensionality, and consequently accelerating computation. This paper proposes new algorithms for selecting relevant features and evaluating and selecting a subset of relevant objects in a dataset. Both algorithms are mainly based on the use of a fuzzy approach. The research presented here yielded preliminary results of a new approach to the problem of selecting relevant attributes and objects and selecting appropriate ranges of their values. Detailed results obtained on the Sonar dataset show the positive effects of this approach. Moreover, the observed results may suggest the effectiveness of the proposed method in terms of identifying a subset of truly relevant attributes from among those identified by traditional feature selection methods. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

Figure 1
<p>An example of defining a triangular membership function of the value of variable <span class="html-italic">V</span>9 from the Sonar dataset based on the designated discretization intervals. The colors correspond to the different linguistic variables (LV) of the <span class="html-italic">V</span>9 attribute (see <a href="#entropy-25-01223-t001" class="html-table">Table 1</a>)</p>
Full article ">Figure 2
<p>Graph of the average importance value of linguistic variables for the <span class="html-italic">V</span>9 attribute from the Sonar dataset. Green variables are those that are confirmed relevant, while red variables are those that are rejected.</p>
Full article ">Figure 3
<p>The range of values of the <span class="html-italic">V</span>9 original variable (red color) and the values after the selection include linguistic variables (green color).</p>
Full article ">Figure 4
<p>Part of the binary table obtained for the Sonar dataset. The green fields (value 1) indicate the value of an attribute that is in the relevant value range, the red fields (value 0), on the other hand, are the values that are considered irrelevant.</p>
Full article ">Figure 5
<p>The results of the <span class="html-italic">fuzzy feature selection</span> algorithm obtained using the Sonar dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results of the original set.</p>
Full article ">Figure 6
<p>The results of the <span class="html-italic">fuzzy object selection</span> algorithm obtained using the Sonar dataset for different values of the <span class="html-italic">EPS</span> parameter, along with the parameters for assessing the classification quality of the model built on the subset. The results of the original set are marked in red.</p>
Full article ">Figure 7
<p>Feature ranking obtained using four parameters, <span class="html-italic">information gain</span>, <span class="html-italic">gain ratio</span>, <span class="html-italic">Gini</span> index, and the <span class="html-italic">fast correlation-based filter</span>. The <span class="html-italic">FFS</span> column contains all relevant features in the subset indicated by the <span class="html-italic">fuzzy feature selection</span> algorithm.</p>
Full article ">Figure 8
<p>The results of the <span class="html-italic">fuzzy feature selection</span> algorithm obtained using the Pima Indians diabetes dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 9
<p>The results of the <span class="html-italic">fuzzy object selection</span> algorithm obtained using the Pima Indians diabetes dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 10
<p>The results of the <span class="html-italic">fuzzy feature selection</span> algorithm obtained using the breast cancer Wisconsin diagnostic dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 11
<p>The results of the <span class="html-italic">fuzzy object selection</span> algorithm obtained using the breast cancer Wisconsin diagnostic dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 12
<p>The results of the <span class="html-italic">fuzzy feature selection</span> algorithm obtained using the climate model simulation crashes dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 13
<p>The results of the <span class="html-italic">fuzzy object selection</span> algorithm obtained using the climate model simulation crashes dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 14
<p>The results of the <span class="html-italic">fuzzy feature selection</span> algorithm obtained using the single proton emission computed tomography (SPECTF) dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">Figure 15
<p>The results of the <span class="html-italic">fuzzy object selection</span> algorithm obtained using the single proton emission computed tomography (SPECTF) dataset for different values of the <span class="html-italic">EPS</span> parameter, along with parameters for assessing the quality of the classification of the model built on the subset. The red color indicates the results for the original set.</p>
Full article ">
17 pages, 359 KiB  
Article
Joint Probabilities Approach to Quantum Games with Noise
by Alexis R. Legón and Ernesto Medina
Entropy 2023, 25(8), 1222; https://doi.org/10.3390/e25081222 - 16 Aug 2023
Cited by 1 | Viewed by 1115
Abstract
A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not [...] Read more.
A joint probability formalism for quantum games with noise is proposed, inspired by the formalism of non-factorizable probabilities that connects the joint probabilities to quantum games with noise. Using this connection, we show that the joint probabilities are non-factorizable; thus, noise does not generically destroy entanglement. This formalism was applied to the Prisoner’s Dilemma, the Chicken Game, and the Battle of the Sexes, where noise is coupled through a single parameter μ. We find that for all the games except for the Battle of the Sexes, the Nash inequalities are maintained up to a threshold value of the noise. Beyond the threshold value, the inequalities no longer hold for quantum and classical strategies. For the Battle of the sexes, the Nash inequalities always hold, no matter the noise strength. This is due to the symmetry and anti-symmetry of the parameters that determine the joint probabilities for that game. Finally, we propose a new correlation measure for the games with classical and quantum strategies, where we obtain that the incorporation of noise, when we have quantum strategies, does not affect entanglement, but classical strategies result in behavior that approximates quantum games with quantum strategies without the need to saturate the system with the maximum value of noise. In this manner, these correlations can be understood as entanglement for our game approach. Full article
(This article belongs to the Special Issue Quantum Probability and Randomness IV)
Show Figures

Figure 1

Figure 1
<p>Entanglement measure for quantum games with noise from joint probabilities. Corresponding to the classical strategies (red) and quantum strategies (blue).</p>
Full article ">
57 pages, 592 KiB  
Article
Simultaneous Momentum and Position Measurement and the Instrumental Weyl-Heisenberg Group
by Christopher S. Jackson and Carlton M. Caves
Entropy 2023, 25(8), 1221; https://doi.org/10.3390/e25081221 - 16 Aug 2023
Cited by 2 | Viewed by 1135
Abstract
The canonical commutation relation, [Q,P]=i, stands at the foundation of quantum theory and the original Hilbert space. The interpretation of P and Q as observables has always relied on the analogies that exist between the [...] Read more.
The canonical commutation relation, [Q,P]=i, stands at the foundation of quantum theory and the original Hilbert space. The interpretation of P and Q as observables has always relied on the analogies that exist between the unitary transformations of Hilbert space and the canonical (also known as contact) transformations of classical phase space. Now that the theory of quantum measurement is essentially complete (this took a while), it is possible to revisit the canonical commutation relation in a way that sets the foundation of quantum theory not on unitary transformations but on positive transformations. This paper shows how the concept of simultaneous measurement leads to a fundamental differential geometric problem whose solution shows us the following. The simultaneous P and Q measurement (SPQM) defines a universal measuring instrument, which takes the shape of a seven-dimensional manifold, a universal covering group we call the instrumental Weyl-Heisenberg (IWH) group. The group IWH connects the identity to classical phase space in unexpected ways that are significant enough that the positive-operator-valued measure (POVM) offers a complete alternative to energy quantization. Five of the dimensions define processes that can be easily recognized and understood. The other two dimensions, the normalization and phase in the center of the IWH group, are less familiar. The normalization, in particular, requires special handling in order to describe and understand the SPQM instrument. Full article
(This article belongs to the Special Issue Quantum Probability and Randomness IV)
29 pages, 2475 KiB  
Article
Consistent Model Selection Procedure for Random Coefficient INAR Models
by Kaizhi Yu and Tielai Tao
Entropy 2023, 25(8), 1220; https://doi.org/10.3390/e25081220 - 16 Aug 2023
Cited by 1 | Viewed by 1041
Abstract
In the realm of time series data analysis, information criteria constructed on the basis of likelihood functions serve as crucial instruments for determining the appropriate lag order. However, the intricate structure of random coefficient integer-valued time series models, which are founded on thinning [...] Read more.
In the realm of time series data analysis, information criteria constructed on the basis of likelihood functions serve as crucial instruments for determining the appropriate lag order. However, the intricate structure of random coefficient integer-valued time series models, which are founded on thinning operators, complicates the establishment of likelihood functions. Consequently, employing information criteria such as AIC and BIC for model selection becomes problematic. This study introduces an innovative methodology that formulates a penalized criterion by utilizing the estimation equation within conditional least squares estimation, effectively addressing the aforementioned challenge. Initially, the asymptotic properties of the penalized criterion are derived, followed by a numerical simulation study and a comparative analysis. The findings from both theoretical examinations and simulation investigations reveal that this novel approach consistently selects variables under relatively relaxed conditions. Lastly, the applications of this method to infectious disease data and seismic frequency data produce satisfactory outcomes. Full article
Show Figures

Figure 1

Figure 1
<p>The impact of sample size on accuracy under different <inline-formula><mml:math id="mm559"><mml:semantics><mml:mrow><mml:msub><mml:mrow><mml:mi>ϕ</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> settings.</p>
Full article ">Figure 2
<p>The impact of <inline-formula><mml:math id="mm560"><mml:semantics><mml:mrow><mml:msub><mml:mrow><mml:mi>ϕ</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mrow></mml:semantics></mml:math></inline-formula> settings on accuracy under different sample sizes.</p>
Full article ">Figure 3
<p>Number of COVID-19 infections in Cyprus, 13 March to 12 May 2020.</p>
Full article ">Figure 4
<p>Global frequency of earthquakes of magnitude seven or greater between 1900 and 2007.</p>
Full article ">
51 pages, 7033 KiB  
Article
Bounded Confidence and Cohesion-Moderated Pressure: A General Model for the Large-Scale Dynamics of Ordered Opinion
by Fangyikuang Ding, Yang Li and Kejian Ding
Entropy 2023, 25(8), 1219; https://doi.org/10.3390/e25081219 - 16 Aug 2023
Viewed by 1553
Abstract
Due to the development of social media, the mechanisms underlying consensus and chaos in opinion dynamics have become open questions and have been extensively researched in disciplines such as sociology, statistical physics, and nonlinear mathematics. In this regard, our paper establishes a general [...] Read more.
Due to the development of social media, the mechanisms underlying consensus and chaos in opinion dynamics have become open questions and have been extensively researched in disciplines such as sociology, statistical physics, and nonlinear mathematics. In this regard, our paper establishes a general model of opinion evolution based on micro-mechanisms such as bounded confidence, out-group pressure, and in-group cohesion. Several core conclusions are derived through theorems and simulation results in the model: (1) assimilation and high reachability in social networks lead to global consensus; (2) assimilation and low reachability result in local consensus; (3) exclusion and high reachability cause chaos; and (4) a strong “cocoon room effect” can sustain the existence of local consensus. These conclusions collectively form the “ideal synchronization theory”, which also includes findings related to convergence rates, consensus bifurcation, and other exploratory conclusions. Additionally, to address questions about consensus and chaos, we develop a series of mathematical and statistical methods, including the “energy decrease method”, the “cross-d search method”, and the statistical test method for the dynamical models, contributing to a broader understanding of stochastic dynamics. Full article
(This article belongs to the Special Issue Statistical Physics of Opinion Formation and Social Phenomena)
Show Figures

Figure 1

Figure 1
<p>The framework of our model.</p>
Full article ">Figure 2
<p>(<b>a</b>–<b>c</b>) Opinion-Time Chart, social learning rate u<sub>i</sub> = u = 0.5; pressure coefficient k<sub>i</sub> = k = 0.1; (<b>a</b>–<b>c</b>) are simulated on the complete graph/complete graph/connected graph, respectively. Note: The opinion time chart refers to the horizontal axis reflecting time/the vertical axis reflecting opinion values.</p>
Full article ">Figure 3
<p>Opinion-Time Chart (<b>a</b>–<b>i</b>) (social learning rate u<sub>i</sub> = u = 0.5/pressure coefficient k<sub>i</sub> = k = 0.1).</p>
Full article ">Figure 3 Cont.
<p>Opinion-Time Chart (<b>a</b>–<b>i</b>) (social learning rate u<sub>i</sub> = u = 0.5/pressure coefficient k<sub>i</sub> = k = 0.1).</p>
Full article ">Figure 4
<p>(<b>a</b>–<b>f</b>) Opinion-Time Chart (d = 0.4/d* = 5).</p>
Full article ">Figure 5
<p>(<b>a</b>–<b>d</b>) Frequency of global consensus (or “synchronization”) reached by the model under different d*/d.</p>
Full article ">Figure 6
<p>(<b>a</b>–<b>l</b>) Distribution of Consensus Numbers for Given d/d*, d*/d.</p>
Full article ">Figure 7
<p>(<b>a</b>,<b>b</b>) Opinion-Time Chart (u = 0.5, d* = 5, D = 0.4).</p>
Full article ">Figure 8
<p>(<b>a</b>–<b>f</b>) Opinion-Time chart (d* = 5/k = 0.1).</p>
Full article ">Figure 9
<p>(<b>a</b>,<b>b</b>) Opinion-Time Graph (d = 0.6 d* = 8 k = 0.1).</p>
Full article ">Figure 10
<p>(<b>a</b>–<b>l</b>) Opinion-Time chart (probability of u<sub>i</sub> being a positive number is <span class="html-italic">p</span>, d* = 5, k = 0.1).</p>
Full article ">Figure 11
<p>The following image reflects the accuracy of the model in predicting five political positions as well as specific numerical deviations.</p>
Full article ">Figure 12
<p>(1) (<b>a</b>,<b>b</b>) represent the scatter plots drawn by the data points of (real_openion, simulation_opinion). (2) (<b>c</b>,<b>d</b>) show the frequency distribution histograms of the real opinions (yellow) and the simulated opinions (green) at different times, respectively.</p>
Full article ">Figure A1
<p>(<b>a</b>) Shows that the value of V_function is decreasing over time. (<b>b</b>) Reflects that the opinion2 of the actor0 and actor1 is gradually attracted to the plane of x1 = x2, i.e., entering a synchronous state. (<b>c</b>) The three colored lines, respectively, represent the evolution of the opinions of three individuals, and this type of chart is referred to as the O-T chart (Opinion-Time) in the following text.</p>
Full article ">Figure A2
<p>Both figures reflect the proof ideas stated in the remarks above.</p>
Full article ">Figure A3
<p>The following is an Opinion-Time chart reflecting chaos.</p>
Full article ">
21 pages, 495 KiB  
Article
Energy Conversion and Entropy Production in Biased Random Walk Processes—From Discrete Modeling to the Continuous Limit
by Henning Kirchberg and Abraham Nitzan
Entropy 2023, 25(8), 1218; https://doi.org/10.3390/e25081218 - 16 Aug 2023
Cited by 1 | Viewed by 1138
Abstract
We considered discrete and continuous representations of a thermodynamic process in which a random walker (e.g., a molecular motor on a molecular track) uses periodically pumped energy (work) to pass N sites and move energetically downhill while dissipating heat. Interestingly, we found that, [...] Read more.
We considered discrete and continuous representations of a thermodynamic process in which a random walker (e.g., a molecular motor on a molecular track) uses periodically pumped energy (work) to pass N sites and move energetically downhill while dissipating heat. Interestingly, we found that, starting from a discrete model, the limit in which the motion becomes continuous in space and time (N) is not unique and depends on what physical observables are assumed to be unchanged in the process. In particular, one may (as usually done) choose to keep the speed and diffusion coefficient fixed during this limiting process, in which case, the entropy production is affected. In addition, we also studied processes in which the entropy production is kept constant as N at the cost of a modified speed or diffusion coefficient. Furthermore, we also combined this dynamics with work against an opposing force, which made it possible to study the effect of discretization of the process on the thermodynamic efficiency of transferring the power input to the power output. Interestingly, we found that the efficiency was increased in the limit of N. Finally, we investigated the same process when transitions between sites can only happen at finite time intervals and studied the impact of this time discretization on the thermodynamic variables as the continuous limit is approached. Full article
(This article belongs to the Collection Disorder and Biological Physics)
Show Figures

Figure 1

Figure 1
<p>Entropy production rate <math display="inline"><semantics> <mrow> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> against time plotted for different <span class="html-italic">N</span>-site cycles by keeping the velocity <span class="html-italic">v</span> and diffusion coefficient <span class="html-italic">D</span> constant. The velocity <span class="html-italic">v</span> (here chosen to be <math display="inline"><semantics> <mrow> <mi>v</mi> <mo>=</mo> <mfrac> <mrow> <mn>3</mn> <mi>D</mi> </mrow> <mrow> <mn>2</mn> <mi>π</mi> <mi>R</mi> </mrow> </mfrac> </mrow> </semantics></math>) needs to be within the bounds implied by <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>≥</mo> <mn>0</mn> </mrow> </semantics></math> of Equation (13) for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. The steady-state value <math display="inline"><semantics> <mrow> <msup> <mi>v</mi> <mn>2</mn> </msup> <mo>/</mo> <mi>D</mi> </mrow> </semantics></math> (black curve) is reached for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>→</mo> <mo>∞</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 2
<p>Entropy production rate at steady state <math display="inline"><semantics> <mrow> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mo>(</mo> <mi>t</mi> <mo>→</mo> <mo>∞</mo> <mo>)</mo> </mrow> <mo>≡</mo> <msub> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mi>S</mi> <mi>S</mi> </mrow> </msub> <mrow> <mo>[</mo> <mo>=</mo> <mo>−</mo> <msub> <mover accent="true"> <mi>S</mi> <mo>˙</mo> </mover> <mi>e</mi> </msub> <mo>]</mo> </mrow> </mrow> </semantics></math> against the number of sites <span class="html-italic">N</span> per cycle by keeping the velocity <span class="html-italic">v</span> and diffusion coefficient <span class="html-italic">D</span> constant. The velocity <span class="html-italic">v</span> (here chosen to be <math display="inline"><semantics> <mrow> <mi>v</mi> <mo>=</mo> <mfrac> <mrow> <mn>3</mn> <mi>D</mi> </mrow> <mrow> <mn>2</mn> <mi>π</mi> <mi>R</mi> </mrow> </mfrac> </mrow> </semantics></math>) needs to be within the bounds implied by <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>≥</mo> <mn>0</mn> </mrow> </semantics></math> of Equation (13) for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. The red line is the entropy production rate in the limit <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>→</mo> <mo>∞</mo> </mrow> </semantics></math> and takes the value <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mi>S</mi> <mi>S</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>N</mi> <mo>→</mo> <mo>∞</mo> <mo>)</mo> </mrow> <mo>=</mo> <msup> <mi>v</mi> <mn>2</mn> </msup> <mo>/</mo> <mi>D</mi> </mrow> </semantics></math>.</p>
Full article ">Figure 3
<p>Efficiency at steady state <math display="inline"><semantics> <mi>η</mi> </semantics></math> plotted against the number of sites <span class="html-italic">N</span> per cycle by keeping the velocity <span class="html-italic">v</span> and diffusion constant <span class="html-italic">D</span> constant. We depict <math display="inline"><semantics> <mi>η</mi> </semantics></math> for <math display="inline"><semantics> <mrow> <msub> <mi>v</mi> <mn>1</mn> </msub> <mo>=</mo> <mn>0.5</mn> <mi>v</mi> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>v</mi> <mn>2</mn> </msub> <mo>=</mo> <mn>0.8</mn> <mi>v</mi> </mrow> </semantics></math> and <math display="inline"><semantics> <mrow> <msub> <mi>v</mi> <mn>3</mn> </msub> <mo>=</mo> <mi>v</mi> </mrow> </semantics></math>, where we chose <math display="inline"><semantics> <mrow> <mi>v</mi> <mo>=</mo> <mfrac> <mrow> <mn>3</mn> <mi>D</mi> </mrow> <mrow> <mi>π</mi> <mi>R</mi> </mrow> </mfrac> </mrow> </semantics></math> to be within the bounds implied by <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>≥</mo> <mn>0</mn> </mrow> </semantics></math> of Equation (13) for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. We chose the force <math display="inline"><semantics> <mrow> <mi>f</mi> <mo>≡</mo> <mi>v</mi> <mi>T</mi> <msub> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mi>S</mi> <mi>S</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>N</mi> <mo>→</mo> <mo>∞</mo> <mo>)</mo> </mrow> <mo>=</mo> <mn>3</mn> <msub> <mi>k</mi> <mi>B</mi> </msub> <mi>T</mi> <mo>/</mo> <mi>π</mi> <mi>R</mi> </mrow> </semantics></math>. Inset: Damping constant <math display="inline"><semantics> <mrow> <mi>γ</mi> <mo>≡</mo> <mi>γ</mi> <mrow> <mo>(</mo> <mi>v</mi> <mo>)</mo> </mrow> <mi>D</mi> <mo>/</mo> <mrow> <mo>(</mo> <msub> <mi>k</mi> <mi>B</mi> </msub> <mi>T</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>T</mi> <mi>D</mi> <msub> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mi>S</mi> <mi>S</mi> </mrow> </msub> <mo>/</mo> <mrow> <mo>(</mo> <msup> <mi>v</mi> <mn>2</mn> </msup> <msub> <mi>k</mi> <mi>B</mi> </msub> <mi>T</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> in dependence of the velocity for different <span class="html-italic">N</span>.</p>
Full article ">Figure 4
<p>Diffusion constant <span class="html-italic">D</span> plotted against the number <span class="html-italic">N</span> of sites per cycle by keeping the entropy <math display="inline"><semantics> <mi>σ</mi> </semantics></math> per cycle and velocity <span class="html-italic">v</span> constant for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. We chose the produced entropy per cycle to be <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>/</mo> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math>. The red line is the value <math display="inline"><semantics> <mrow> <mi>D</mi> <mrow> <mo>(</mo> <mi>N</mi> <mo>→</mo> <mo>∞</mo> <mo>)</mo> </mrow> <mo>→</mo> <mi>v</mi> <mn>2</mn> <mi>π</mi> <mi>R</mi> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>/</mo> <mi>σ</mi> </mrow> </semantics></math> in the limit of <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>→</mo> <mo>∞</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Velocity <span class="html-italic">v</span> plotted against the number <span class="html-italic">N</span> of sites per cycle by keeping the entropy <math display="inline"><semantics> <mi>σ</mi> </semantics></math> per cycle and the diffusion coefficient <span class="html-italic">D</span> constant for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. We chose the produced entropy per cycle to be <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>/</mo> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>5</mn> </mrow> </semantics></math>. The red line is the value <math display="inline"><semantics> <mrow> <mi>v</mi> <mrow> <mo>(</mo> <mi>N</mi> <mo>→</mo> <mo>∞</mo> <mo>)</mo> </mrow> <mo>→</mo> <mi>D</mi> <mi>σ</mi> <mo>/</mo> <mi>π</mi> <mi>R</mi> <msub> <mi>k</mi> <mi>B</mi> </msub> </mrow> </semantics></math> in the limit of <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>→</mo> <mo>∞</mo> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Variance in cycle completion time <math display="inline"><semantics> <mrow> <mo>〈</mo> <mi>δ</mi> <msup> <mi>τ</mi> <mn>2</mn> </msup> <mo>〉</mo> </mrow> </semantics></math> plotted against the number <span class="html-italic">N</span> of sites per cycle by keeping the entropy <math display="inline"><semantics> <mi>σ</mi> </semantics></math> per cycle and the diffusion coefficient <span class="html-italic">D</span> constant for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>, while the velocity <math display="inline"><semantics> <mrow> <mi>v</mi> <mo>(</mo> <mi>N</mi> <mo>)</mo> </mrow> </semantics></math> results from Equation (<a href="#FD24-entropy-25-01218" class="html-disp-formula">24</a>). We show <math display="inline"><semantics> <mrow> <mo>〈</mo> <mi>δ</mi> <msup> <mi>τ</mi> <mn>2</mn> </msup> <mo>〉</mo> </mrow> </semantics></math> for three different choices of <math display="inline"><semantics> <mi>σ</mi> </semantics></math>.</p>
Full article ">Figure 7
<p>Entropy production rate at steady state, <math display="inline"><semantics> <msub> <mover accent="true"> <mi>σ</mi> <mo>˙</mo> </mover> <mrow> <mi>S</mi> <mi>S</mi> </mrow> </msub> </semantics></math>, against the number per cycle <span class="html-italic">N</span> by keeping the velocity <span class="html-italic">v</span> and diffusion coefficient <span class="html-italic">D</span> constant. Here, <span class="html-italic">v</span> (chosen to be <math display="inline"><semantics> <mrow> <mi>v</mi> <mo>=</mo> <mfrac> <mrow> <mn>3</mn> <mi>D</mi> </mrow> <mrow> <mn>2</mn> <mi>π</mi> <mi>R</mi> </mrow> </mfrac> </mrow> </semantics></math>) needs to be within the bound implied by <math display="inline"><semantics> <mrow> <mi>β</mi> <mo>≥</mo> <mn>0</mn> </mrow> </semantics></math> of Equation (38) for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>. (i) The blue circled line represents the entropy production rate in the continuous time limit <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> <mo>→</mo> <mn>0</mn> </mrow> </semantics></math>. (ii) The black squared line is the entropy production rate for a discrete time process using the maximal <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> </mrow> </semantics></math> allowed by Equation (<a href="#FD39-entropy-25-01218" class="html-disp-formula">39</a>), <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> <mo>=</mo> <mo>−</mo> <mfrac> <mi>D</mi> <msup> <mi>v</mi> <mn>2</mn> </msup> </mfrac> <mo>+</mo> <msqrt> <mrow> <mfrac> <msup> <mi>D</mi> <mn>2</mn> </msup> <msup> <mi>v</mi> <mn>2</mn> </msup> </mfrac> <mo>+</mo> <mfrac> <mrow> <mo>Δ</mo> <msup> <mi>x</mi> <mn>2</mn> </msup> </mrow> <msup> <mi>v</mi> <mn>2</mn> </msup> </mfrac> </mrow> </msqrt> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>The diffusion coefficient <span class="html-italic">D</span> plotted against the number of sites <span class="html-italic">N</span> per cycle by keeping the entropy production per cycle <math display="inline"><semantics> <mi>σ</mi> </semantics></math> and velocity <span class="html-italic">v</span> constant. The chosen time interval <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> </mrow> </semantics></math> for given <span class="html-italic">N</span> is restricted by the inequality (<a href="#FD46-entropy-25-01218" class="html-disp-formula">46</a>). We take <math display="inline"><semantics> <mrow> <mo>Δ</mo> <mi>t</mi> <mrow> <mo>(</mo> <mi>a</mi> <mo>,</mo> <mi>N</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>a</mi> <mfrac> <mrow> <mo>Δ</mo> <mi>x</mi> </mrow> <mi>v</mi> </mfrac> <mo form="prefix">tanh</mo> <mfenced open="[" close="]"> <mfrac> <mi>σ</mi> <mrow> <mn>2</mn> <mi>N</mi> <msub> <mi>k</mi> <mi>B</mi> </msub> </mrow> </mfrac> </mfenced> </mrow> </semantics></math> (where <math display="inline"><semantics> <mrow> <mn>0</mn> <mo>≤</mo> <mi>a</mi> <mo>≤</mo> <mn>1</mn> </mrow> </semantics></math>) and depict <math display="inline"><semantics> <mrow> <mi>D</mi> <mo>(</mo> <mi>a</mi> <mo>,</mo> <mi>N</mi> <mo>)</mo> </mrow> </semantics></math> with <math display="inline"><semantics> <mrow> <mi>a</mi> <mo>=</mo> <mn>0</mn> </mrow> </semantics></math> (blue curve), <math display="inline"><semantics> <mrow> <mi>a</mi> <mo>=</mo> <mn>0.6</mn> </mrow> </semantics></math> (black curve), and <math display="inline"><semantics> <mrow> <mi>a</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math> (green curve). We chose the produced entropy per cycle to be <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>/</mo> <msub> <mi>k</mi> <mi>B</mi> </msub> <mo>=</mo> <mn>10</mn> </mrow> </semantics></math> for <math display="inline"><semantics> <mrow> <mi>N</mi> <mo>≥</mo> <mn>3</mn> </mrow> </semantics></math>.</p>
Full article ">
11 pages, 823 KiB  
Article
A Joint Extraction Model for Entity Relationships Based on Span and Cascaded Dual Decoding
by Tao Liao, Haojie Sun and Shunxiang Zhang
Entropy 2023, 25(8), 1217; https://doi.org/10.3390/e25081217 - 16 Aug 2023
Cited by 2 | Viewed by 1370
Abstract
The entity–relationship joint extraction model plays a significant role in entity relationship extraction. The existing entity–relationship joint extraction model cannot effectively identify entity–relationship triples in overlapping relationships. This paper proposes a new joint entity–relationship extraction model based on the span and a cascaded [...] Read more.
The entity–relationship joint extraction model plays a significant role in entity relationship extraction. The existing entity–relationship joint extraction model cannot effectively identify entity–relationship triples in overlapping relationships. This paper proposes a new joint entity–relationship extraction model based on the span and a cascaded dual decoding. The model includes a Bidirectional Encoder Representations from Transformers (BERT) encoding layer, a relational decoding layer, and an entity decoding layer. The model first converts the text input into the BERT pretrained language model into word vectors. Then, it divides the word vectors based on the span to form a span sequence and decodes the relationship between the span sequence to obtain the relationship type in the span sequence. Finally, the entity decoding layer fuses the span sequences and the relationship type obtained by relation decoding and uses a bi-directional long short-term memory (Bi-LSTM) neural network to obtain the head entity and tail entity in the span sequence. Using the combination of span division and cascaded double decoding, the overlapping relations existing in the text can be effectively identified. Experiments show that compared with other baseline models, the F1 value of the model is effectively improved on the NYT dataset and WebNLG dataset. Full article
(This article belongs to the Section Information Theory, Probability and Statistics)
Show Figures

Figure 1

Figure 1
<p>The framework of the model.</p>
Full article ">Figure 2
<p>Results for various phrase kinds based on how closely they overlap when using the exact match method.</p>
Full article ">
18 pages, 2746 KiB  
Article
Hybrid DAER Based Cross-Modal Retrieval Exploiting Deep Representation Learning
by Zhao Huang, Haowu Hu and Miao Su
Entropy 2023, 25(8), 1216; https://doi.org/10.3390/e25081216 - 16 Aug 2023
Viewed by 1276
Abstract
Information retrieval across multiple modes has attracted much attention from academics and practitioners. One key challenge of cross-modal retrieval is to eliminate the heterogeneous gap between different patterns. Most of the existing methods tend to jointly construct a common subspace. However, very little [...] Read more.
Information retrieval across multiple modes has attracted much attention from academics and practitioners. One key challenge of cross-modal retrieval is to eliminate the heterogeneous gap between different patterns. Most of the existing methods tend to jointly construct a common subspace. However, very little attention has been given to the study of the importance of different fine-grained regions of various modalities. This lack of consideration significantly influences the utilization of the extracted information of multiple modalities. Therefore, this study proposes a novel text-image cross-modal retrieval approach that constructs a dual attention network and an enhanced relation network (DAER). More specifically, the dual attention network tends to precisely extract fine-grained weight information from text and images, while the enhanced relation network is used to expand the differences between different categories of data in order to improve the computational accuracy of similarity. The comprehensive experimental results on three widely-used major datasets (i.e., Wikipedia, Pascal Sentence, and XMediaNet) show that our proposed approach is effective and superior to existing cross-modal retrieval methods. Full article
(This article belongs to the Special Issue Information Theory for Data Science)
Show Figures

Figure 1

Figure 1
<p>The framework of the DAER approach for cross-modal retrieval.</p>
Full article ">Figure 2
<p>The structure of bottleneck module with dual spatial attention network.</p>
Full article ">Figure 3
<p>Normal distribution with two different powers (<b>left</b>: power = 1; <b>right</b>: power = 0.6).</p>
Full article ">Figure 4
<p>Example of retrieval tasks using the proposed DAER.</p>
Full article ">Figure 5
<p>Comparison of DAER with the selected methods in three datasets.</p>
Full article ">Figure 6
<p>Comparison of mAP values of each method used in two tasks in three datasets.</p>
Full article ">Figure 7
<p>The improvement of our proposed approach in three databases.</p>
Full article ">
31 pages, 25254 KiB  
Article
Gaussian of Differences: A Simple and Efficient General Image Fusion Method
by Rifat Kurban
Entropy 2023, 25(8), 1215; https://doi.org/10.3390/e25081215 - 15 Aug 2023
Cited by 11 | Viewed by 2284
Abstract
The separate analysis of images obtained from a single source using different camera settings or spectral bands, whether from one or more than one sensor, is quite difficult. To solve this problem, a single image containing all of the distinctive pieces of information [...] Read more.
The separate analysis of images obtained from a single source using different camera settings or spectral bands, whether from one or more than one sensor, is quite difficult. To solve this problem, a single image containing all of the distinctive pieces of information in each source image is generally created by combining the images, a process called image fusion. In this paper, a simple and efficient, pixel-based image fusion method is proposed that relies on weighting the edge information associated with each pixel of all of the source images proportional to the distance from their neighbors by employing a Gaussian filter. The proposed method, Gaussian of differences (GD), was evaluated using multi-modal medical images, multi-sensor visible and infrared images, multi-focus images, and multi-exposure images, and was compared to existing state-of-the-art fusion methods by utilizing objective fusion quality metrics. The parameters of the GD method are further enhanced by employing the pattern search (PS) algorithm, resulting in an adaptive optimization strategy. Extensive experiments illustrated that the proposed GD fusion method ranked better on average than others in terms of objective quality metrics and CPU time consumption. Full article
(This article belongs to the Section Signal and Data Analysis)
Show Figures

Figure 1

Figure 1
<p>Proposed general image fusion method based on pixel-based linear weighting using the Gaussian of differences (GD).</p>
Full article ">Figure 2
<p>Sample input images (<span class="html-italic">I</span><sub>1</sub> and <span class="html-italic">I</span><sub>2</sub>) [<a href="#B54-entropy-25-01215" class="html-bibr">54</a>] and their column and row differences.</p>
Full article ">Figure 3
<p>Combined difference images (<span class="html-italic">D</span>) of the input images.</p>
Full article ">Figure 4
<p>Gaussian of differences (<span class="html-italic">GD</span>) of the input images.</p>
Full article ">Figure 5
<p>Weighting factors (<span class="html-italic">fw</span>) for the input images.</p>
Full article ">Figure 6
<p>Fused image (<span class="html-italic">F</span>).</p>
Full article ">Figure 7
<p>Gaussian kernel (<span class="html-italic">w</span>) for <span class="html-italic">s</span> = 3 and <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>=</mo> <mn>1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 8
<p>Optimization of the parameters of the proposed GD fusion method.</p>
Full article ">Figure 9
<p>Multi-modal medical images used in the experiments.</p>
Full article ">Figure 10
<p>Multi-sensor infrared and visible images used in the experiments.</p>
Full article ">Figure 11
<p>Multi-focus images used in the experiments.</p>
Full article ">Figure 12
<p>Multi-exposure images used in the experiments.</p>
Full article ">Figure 13
<p>Medical image set M#2 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 14
<p>Medical image set M#5 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 15
<p>Infrared and visible image set IV#4 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 16
<p>Infrared and visible image set IV#5 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 17
<p>Multi-focus image set F#11 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 18
<p>Multi-focus image set F#15 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 19
<p>Multi-exposure image set E#5 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">Figure 20
<p>Multi-exposure image set E#6 (Images A and B) and their fusion image results, obtained using comparison methods.</p>
Full article ">
30 pages, 983 KiB  
Article
A Machine Learning Approach to Simulate Gene Expression and Infer Gene Regulatory Networks
by Francesco Zito, Vincenzo Cutello and Mario Pavone
Entropy 2023, 25(8), 1214; https://doi.org/10.3390/e25081214 - 15 Aug 2023
Cited by 7 | Viewed by 3322
Abstract
The ability to simulate gene expression and infer gene regulatory networks has vast potential applications in various fields, including medicine, agriculture, and environmental science. In recent years, machine learning approaches to simulate gene expression and infer gene regulatory networks have gained significant attention [...] Read more.
The ability to simulate gene expression and infer gene regulatory networks has vast potential applications in various fields, including medicine, agriculture, and environmental science. In recent years, machine learning approaches to simulate gene expression and infer gene regulatory networks have gained significant attention as a promising area of research. By simulating gene expression, we can gain insights into the complex mechanisms that control gene expression and how they are affected by various environmental factors. This knowledge can be used to develop new treatments for genetic diseases, improve crop yields, and better understand the evolution of species. In this article, we address this issue by focusing on a novel method capable of simulating the gene expression regulation of a group of genes and their mutual interactions. Our framework enables us to simulate the regulation of gene expression in response to alterations or perturbations that can affect the expression of a gene. We use both artificial and real benchmarks to empirically evaluate the effectiveness of our methodology. Furthermore, we compare our method with existing ones to understand its advantages and disadvantages. We also present future ideas for improvement to enhance the effectiveness of our method. Overall, our approach has the potential to greatly improve the field of gene expression simulation and gene regulatory network inference, possibly leading to significant advancements in genetics. Full article
Show Figures

Figure 1

Figure 1
<p>An example of a gene regulatory network that includes gene regulation information.</p>
Full article ">Figure 2
<p>Process to infer a gene regulatory network.</p>
Full article ">Figure 3
<p>Visual representation of an agent.</p>
Full article ">Figure 4
<p>Representation of the perturbation functions considered. The two perturbation functions (<b>a</b>,<b>b</b>) share the same parameters <math display="inline"><semantics> <msub> <mi>φ</mi> <mi>b</mi> </msub> </semantics></math>, <math display="inline"><semantics> <msub> <mi>φ</mi> <mi>d</mi> </msub> </semantics></math>, and <math display="inline"><semantics> <msub> <mi>φ</mi> <mi>w</mi> </msub> </semantics></math>, which denote the initial value of the <span class="html-italic">i</span>-th gene to be perturbed, the overall duration of the perturbation and the width of the perturbation, respectively. Additionally, the trapezium perturbation function (<b>b</b>) requires another parameter <math display="inline"><semantics> <msub> <mi>φ</mi> <mi>p</mi> </msub> </semantics></math>, which represents the number of time steps for which the peak value is maintained.</p>
Full article ">Figure 5
<p>Function to transform a regulatory value into a probability value.</p>
Full article ">Figure 6
<p>Regulation of expression of eight genes using the dataset with ID 17.</p>
Full article ">Figure 7
<p>Regulation of expression of ten genes using the dataset with ID 10.</p>
Full article ">Figure 8
<p>Comparing gene expression regulation performed by different models on the SOS DNA Repair dataset. The solid lines represent the actual values of gene expression for the two selected genes, while the dashed lines are the predictions made by the models.</p>
Full article ">Figure 9
<p>SOS DNA Repair [<a href="#B39-entropy-25-01214" class="html-bibr">39</a>].</p>
Full article ">Figure 10
<p>Trapezium perturbation function on the gene lexA in the SOS DNA Repair dataset.</p>
Full article ">Figure 11
<p>Results obtained by our methodology taking into account the two types of perturbations: instant perturbation function and trapezium perturbation function. The dataset ID is an identifier that represents the dataset used in that experiment. The full list of datasets is reported in <a href="#entropy-25-01214-t003" class="html-table">Table 3</a>.</p>
Full article ">Figure 12
<p>This figure presents a comparison between our approach (labeled as “Our”) and the state-of-the-art method for the SOS DNA Repair dataset, with the results sourced from [<a href="#B11-entropy-25-01214" class="html-bibr">11</a>].</p>
Full article ">Figure 13
<p>This figure compares the performance of our approach (labeled as “Our”) with the state-of-the-art method for DREAM4 datasets. The values represent the average of the Area Under the Curve (AUC) obtained for each instance, as per [<a href="#B11-entropy-25-01214" class="html-bibr">11</a>], where the results from other methods are used for comparison.</p>
Full article ">
Previous Issue
Back to TopTop