EntropyPub Date : 2025-07-11DOI: 10.3390/e27070743
Eric A Butcher, Vianella Spaeth
{"title":"Decentralized Consensus Protocols on <i>SO</i>(4)<sup><i>N</i></sup> and <i>TSO</i>(4)<sup><i>N</i></sup> with Reshaping.","authors":"Eric A Butcher, Vianella Spaeth","doi":"10.3390/e27070743","DOIUrl":"10.3390/e27070743","url":null,"abstract":"<p><p>Consensus protocols for a multi-agent networked system consist of strategies that align the states of all agents that share information according to a given network topology, despite challenges such as communication limitations, time-varying networks, and communication delays. The special orthogonal group SO(n) plays a key role in applications from rigid body attitude synchronization to machine learning on Lie groups, particularly in fields like physics-informed learning and geometric deep learning. In this paper, N-agent consensus protocols are proposed on the Lie group SO(4) and the corresponding tangent bundle TSO(4), in which the state spaces are SO(4)N and TSO(4)N, respectively. In particular, when using communication topologies such as a ring graph for which the local stability of non-consensus equilibria is retained in the closed loop, a consensus protocol that leverages a reshaping strategy is proposed to destabilize non-consensus equilibria and produce consensus with almost global stability on SO(4)N or TSO(4)N. Lyapunov-based stability guarantees are obtained, and simulations are conducted to illustrate the advantages of these proposed consensus protocols.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294611/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-10DOI: 10.3390/e27070738
Ye Wang, Zhentao Yu, Cheng Chi, Bozhong Lei, Jianxin Pei, Dan Wang
{"title":"Harmonic Aggregation Entropy: A Highly Discriminative Harmonic Feature Estimator for Time Series.","authors":"Ye Wang, Zhentao Yu, Cheng Chi, Bozhong Lei, Jianxin Pei, Dan Wang","doi":"10.3390/e27070738","DOIUrl":"10.3390/e27070738","url":null,"abstract":"<p><p>Harmonics are a common phenomenon widely present in power systems. The presence of harmonics not only increases the energy consumption of equipment but also poses hidden risks to the safety and stealth performance of large ships. Thus, there is an urgent need for a detection method for the harmonic characteristics of time series. We propose a novel harmonic feature estimation method, termed Harmonic Aggregation Entropy (HaAgEn), which effectively discriminates against background noise. The method is based on bispectrum analysis; utilizing the distribution characteristics of harmonic signals in the bispectrum matrix, a new Diagonal Bi-directional Integral Bispectrum (DBIB) method is employed to effectively extract harmonic features within the bispectrum matrix. This approach addresses the issues associated with traditional time-frequency analysis methods, such as the large computational burden and lack of specificity in feature extraction. The integration results, Ix and Iy, of DBIB on different frequency axes are calculated using cross-entropy to derive HaAgEn. It is verified that HaAgEn is significantly more sensitive to harmonic components in the signal compared to other types of entropy, thereby better addressing harmonic detection issues and reducing feature redundancy. The detection accuracy of harmonic components in the shaft-rate electromagnetic field signal, as evidenced by sea trial data, reaches 96.8%, which is significantly higher than that of other detection methods. This provides a novel technical approach for addressing the issue of harmonic detection in industrial applications.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12295265/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-10DOI: 10.3390/e27070739
Vsevolod Kapatsinski
{"title":"Can Informativity Effects Be Predictability Effects in Disguise?","authors":"Vsevolod Kapatsinski","doi":"10.3390/e27070739","DOIUrl":"10.3390/e27070739","url":null,"abstract":"<p><p>Recent work in corpus linguistics has observed that informativity predicts articulatory reduction of a linguistic unit above and beyond the unit's predictability in the local context, i.e., the unit's probability given the current context. Informativity of a unit is the inverse of average (log-scaled) predictability and corresponds to its information content. Research in the field has interpreted effects of informativity as speakers being sensitive to the information content of a unit in deciding how much effort to put into pronouncing it or as accumulation of memories of pronunciation details in long-term memory representations. However, average predictability can improve the estimate of local predictability of a unit above and beyond the observed predictability in that context, especially when that context is rare. Therefore, informativity can contribute to explaining variance in a dependent variable like reduction above and beyond local predictability simply because informativity improves the (inherently noisy) estimate of local predictability. This paper shows how to estimate the proportion of an observed informativity effect that is likely to be artifactual, due entirely to informativity improving the estimates of predictability, via simulation. The proposed simulation approach can be used to investigate whether an effect of informativity is likely to be real, under the assumption that corpus probabilities are an unbiased estimate of probabilities driving reduction behavior, and how much of it is likely to be due to noise in predictability estimates, in any real dataset.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294750/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-10DOI: 10.3390/e27070740
Adrian F Tuck
{"title":"The Generation of Wind Velocity via Scale Invariant Gibbs Free Energy: Turbulence Drives the General Circulation.","authors":"Adrian F Tuck","doi":"10.3390/e27070740","DOIUrl":"10.3390/e27070740","url":null,"abstract":"<p><p>The mechanism for the upscale deposition of energy into the atmosphere from molecules and photons up to organized wind systems is examined. This analysis rests on the statistical multifractal analysis of airborne observations. The results show that the persistence of molecular velocity after collision in breaking the continuous translational symmetry of an equilibrated gas is causative. The symmetry breaking may be caused by excited photofragments with the associated persistence of molecular velocity after collision, interaction with condensed phase surfaces (solid or liquid), or, in a scaling environment, an adjacent scale having a different velocity and temperature. The relationship of these factors for the solution to the Navier-Stokes equation in an atmospheric context is considered. The scale invariant version of Gibbs free energy, carried by the most energetic molecules, enables the acceleration of organized flow (winds) from the smallest planetary scales by virtue of the nonlinearity of the mechanism, subject to dissipation by the more numerous average molecules maintaining an operational temperature via infrared radiation to the cold sink of space. The fastest moving molecules also affect the transfer of infrared radiation because their higher kinetic energy and the associated more-energetic collisions contribute more to the far wings of the spectral lines, where the collisional displacement from the central energy level gap is greatest and the lines are less self-absorbed. The relationship of events at these scales to macroscopic variables such as the thermal wind equation and its components will be considered in the Discussion section. An attempt is made to synthesize the mechanisms by which winds are generated and sustained, on all scales, by appealing to published works since 2003. This synthesis produces a view of the general circulation that includes thermodynamics and the defining role of turbulence in driving it.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294902/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728924","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-09DOI: 10.3390/e27070736
Zijiang Yang, Jiandong Wang, Honghai Li, Song Gao
{"title":"Pre-Warning for the Remaining Time to Alarm Based on Variation Rates and Mixture Entropies.","authors":"Zijiang Yang, Jiandong Wang, Honghai Li, Song Gao","doi":"10.3390/e27070736","DOIUrl":"10.3390/e27070736","url":null,"abstract":"<p><p>Alarm systems play crucial roles in industrial process safety. To support tackling the accident that is about to occur after an alarm, a pre-warning method is proposed for a special class of industrial process variables to alert operators about the remaining time to alarm. The main idea of the proposed method is to estimate the remaining time to alarm based on variation rates and mixture entropies of qualitative trends in univariate variables. If the remaining time to alarm is no longer than the pre-warning threshold and its mixture entropy is small enough then a warning is generated to alert the operators. One challenge for the proposed method is how to determine an optimal pre-warning threshold by considering the uncertainties induced by the sample distribution of the remaining time to alarm, subject to the constraint of the required false warning rate. This challenge is addressed by utilizing Bayesian estimation theory to estimate the confidence intervals for all candidates of the pre-warning threshold, and the optimal one is selected as the one whose upper bound of the confidence interval is nearest to the required false warning rate. Another challenge is how to measure the possibility of the current trend segment increasing to the alarm threshold, and this challenge is overcome by adopting the mixture entropy as a possibility measurement. Numerical and industrial examples illustrate the effectiveness of the proposed method and the advantages of the proposed method over the existing methods.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294326/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728913","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-09DOI: 10.3390/e27070735
Yuchai Wan, Lili Zhang, Murong Wang
{"title":"RIS-UNet: A Multi-Level Hierarchical Framework for Liver Tumor Segmentation in CT Images.","authors":"Yuchai Wan, Lili Zhang, Murong Wang","doi":"10.3390/e27070735","DOIUrl":"10.3390/e27070735","url":null,"abstract":"<p><p>The deep learning-based analysis of liver CT images is expected to provide assistance for clinicians in the diagnostic decision-making process. However, the accuracy of existing methods still falls short of clinical requirements and needs to be further improved. Therefore, in this work, we propose a novel multi-level hierarchical framework for liver tumor segmentation. In the first level, we integrate inter-slice spatial information by a 2.5D network to resolve the accuracy-efficiency trade-off inherent in conventional 2D/3D segmentation strategies for liver tumor segmentation. Then, the second level extracts the inner-slice global and local features for enhancing feature representation. We propose the Res-Inception-SE Block, which combines residual connections, multi-scale Inception modules, and squeeze-excitation attention to capture comprehensive global and local features. Furthermore, we design a hybrid loss function combining Binary Cross Entropy (BCE) and Dice loss to solve the category imbalance problem and accelerate convergence. Extensive experiments on the LiTS17 dataset demonstrate the effectiveness of our method on accuracy, efficiency, and visual results for liver tumor segmentation.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12295949/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728917","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Asymmetric Protocols for Mode Pairing Quantum Key Distribution with Finite-Key Analysis.","authors":"Zhenhua Li, Tianqi Dou, Yuheng Xie, Weiwen Kong, Yang Liu, Haiqiang Ma, Jianjun Tang","doi":"10.3390/e27070737","DOIUrl":"10.3390/e27070737","url":null,"abstract":"<p><p>The mode pairing quantum key distribution (MP-QKD) protocol has attracted considerable attention for its capability to ensure high secure key rates over long distances without requiring global phase locking. However, ensuring symmetric channels for the MP-QKD protocol is challenging in practical quantum communication networks. Previous studies on the asymmetric MP-QKD protocol have relied on ideal decoy state assumptions and infinite-key analysis, which are unattainable for real-world deployment. In this paper, we conduct a security analysis of the asymmetric MP-QKD protocol with the finite-key analysis, where we discard the previously impractical assumptions made in the decoy state method. Combined with statistical fluctuation analysis, we globally optimized the 10 independent parameters in the asymmetric MP-QKD protocol by employing our modified particle swarm optimization. Through further analysis, the simulation results demonstrate that our work achieves improved secure key rates and transmission distances compared to the strategy with additional attenuation. We further investigate the relationship between the intensities and probabilities of signal, decoy, and vacuum states with transmission distance, facilitating their more efficient deployment in future quantum networks.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294653/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-08DOI: 10.3390/e27070733
Yaochong Li, Jing Zhang, Rigui Zhou, Yi Qu, Ruiqing Xu
{"title":"AQEA-QAS: An Adaptive Quantum Evolutionary Algorithm for Quantum Architecture Search.","authors":"Yaochong Li, Jing Zhang, Rigui Zhou, Yi Qu, Ruiqing Xu","doi":"10.3390/e27070733","DOIUrl":"10.3390/e27070733","url":null,"abstract":"<p><p>Quantum neural networks (QNNs) represent an emerging technology that uses a quantum computer for neural network computations. The QNNs have demonstrated potential advantages over classical neural networks in certain tasks. As a core component of a QNN, the parameterized quantum circuit (PQC) plays a crucial role in determining the QNN's overall performance. However, quantum circuit architectures designed manually based on experience or using specific hardware structures can suffer from inefficiency due to the introduction of redundant quantum gates, which amplifies the impact of noise on system performance. Recent studies have suggested that the advantages of quantum evolutionary algorithms (QEAs) in terms of precision and convergence speed can provide an effective solution to quantum circuit architecture-related problems. Currently, most QEAs adopt a fixed rotation mode in the evolution process, and a lack of an adaptive updating mode can cause the QEAs to fall into a local optimum and make it difficult for them to converge. To address these problems, this study proposes an adaptive quantum evolution algorithm (AQEA). First, an adaptive mechanism is introduced to the evolution process, and the strategy of combining two dynamic rotation angles is adopted. Second, to prevent the fluctuations of the population's offspring, the elite retention of the parents is used to ensure the inheritance of good genes. Finally, when the population falls into a local optimum, a quantum catastrophe mechanism is employed to break the current population state. The experimental results show that compared with the QNN structure based on manual design and QEA search, the proposed AQEA can reduce the number of network parameters by up to 20% and increase the accuracy by 7.21%. Moreover, in noisy environments, the AQEA-optimized circuit outperforms traditional circuits in maintaining high fidelity, and its excellent noise resistance provides strong support for the reliability of quantum computing.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12295456/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-08DOI: 10.3390/e27070732
Isaac Friend, Aleks Kissinger, Robert W Spekkens, Elie Wolfe
{"title":"Compositional Causal Identification from Imperfect or Disturbing Observations.","authors":"Isaac Friend, Aleks Kissinger, Robert W Spekkens, Elie Wolfe","doi":"10.3390/e27070732","DOIUrl":"10.3390/e27070732","url":null,"abstract":"<p><p>The usual inputs for a causal identification task are a graph representing qualitative causal hypotheses and a joint probability distribution for some of the causal model's variables when they are observed rather than intervened on. Alternatively, the available probabilities sometimes come from a combination of passive observations and controlled experiments. It also makes sense, however, to consider causal identification with data collected via schemes more generic than (perfect) passive observation or perfect controlled experiments. For example, observation procedures may be noisy, may disturb the variables, or may yield only coarse-grained specification of the variables' values. In this work, we investigate identification of causal quantities when the probabilities available for inference are the probabilities of outcomes of these more generic schemes. Using process theories (aka symmetric monoidal categories), we formulate graphical causal models as second-order processes that respond to such data collection instruments. We pose the causal identification problem relative to arbitrary sets of available instruments. Perfect passive observation instruments-those that produce the usual observational probabilities used in causal inference-satisfy an abstract process-theoretic property called <i>marginal informational completeness</i>. This property also holds for other (sets of) instruments. The main finding is that in the case of Markovian models, as long as the available instruments satisfy this property, the probabilities they produce suffice for identification of interventional quantities, just as those produced by perfect passive observations do. This finding sharpens the distinction between the Markovianity of a causal model and that of a probability distribution, suggesting a more extensive line of investigation of causal inference within a process-theoretic framework.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12294348/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
EntropyPub Date : 2025-07-08DOI: 10.3390/e27070734
Libo Wei, Aolin Zhang, Lei Liu, Jun Wang, Shuai Wang
{"title":"Video Coding Based on Ladder Subband Recovery and ResGroup Module.","authors":"Libo Wei, Aolin Zhang, Lei Liu, Jun Wang, Shuai Wang","doi":"10.3390/e27070734","DOIUrl":"10.3390/e27070734","url":null,"abstract":"<p><p>With the rapid development of video encoding technology in the field of computer vision, the demand for tasks such as video frame reconstruction, denoising, and super-resolution has been continuously increasing. However, traditional video encoding methods typically focus on extracting spatial or temporal domain information, often facing challenges of insufficient accuracy and information loss when reconstructing high-frequency details, edges, and textures of images. To address this issue, this paper proposes an innovative LadderConv framework, which combines discrete wavelet transform (DWT) with spatial and channel attention mechanisms. By progressively recovering wavelet subbands, it effectively enhances the video frame encoding quality. Specifically, the LadderConv framework adopts a stepwise recovery approach for wavelet subbands, first processing high-frequency detail subbands with relatively less information, then enhancing the interaction between these subbands, and ultimately synthesizing a high-quality reconstructed image through inverse wavelet transform. Moreover, the framework introduces spatial and channel attention mechanisms, which further strengthen the focus on key regions and channel features, leading to notable improvements in detail restoration and image reconstruction accuracy. To optimize the performance of the LadderConv framework, particularly in detail recovery and high-frequency information extraction tasks, this paper designs an innovative ResGroup module. By using multi-layer convolution operations along with feature map compression and recovery, the ResGroup module enhances the network's expressive capability and effectively reduces computational complexity. The ResGroup module captures multi-level features from low level to high level and retains rich feature information through residual connections, thus improving the overall reconstruction performance of the model. In experiments, the combination of the LadderConv framework and the ResGroup module demonstrates superior performance in video frame reconstruction tasks, particularly in recovering high-frequency information, image clarity, and detail representation.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"27 7","pages":""},"PeriodicalIF":2.0,"publicationDate":"2025-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12296159/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144728934","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}