EntropyPub Date : 2023-10-19DOI: 10.3390/e25101464
Tomasz Starczewski
{"title":"Simulation Research on the Relationship between Selected Inconsistency Indices Used in AHP.","authors":"Tomasz Starczewski","doi":"10.3390/e25101464","DOIUrl":"10.3390/e25101464","url":null,"abstract":"<p><p>The Analytic Hierarchy Process (AHP) is a widely used used multi-criteria decision-making method (MCDM). This method is based on pairwise comparison, which forms the so-called Pairwise Comparison Matrix (PCM). PCMs usually contain some errors, which can have an influence on the eventual results. In order to avoid incorrect values of priorities, the inconsistency index (ICI) has been introduced in the AHP by Saaty. However, the user of the AHP can encounter many definitions of ICIs, of which values are usually different. Nevertheless, a lot of these indices are based on a similar idea. The values of some pairs of these indices are characterized by high values of a correlation coefficient. In my work, I present some results of Monte Carlo simulation, which allow us to observe the dependencies in AHP. I select some pairs of ICIs and I evaluate values of the Pearson correlation coefficient for them. The results are compared with some scatter plots that show the type of dependencies between selected ICIs. The presented research shows some pairs of indices are closely correlated so that they can be used interchangeably.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606368/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561666","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 : 2023-10-19DOI: 10.3390/e25101466
Hideki Yagi, Te Sun Han
{"title":"Variable-Length Resolvability for General Sources and Channels.","authors":"Hideki Yagi, Te Sun Han","doi":"10.3390/e25101466","DOIUrl":"10.3390/e25101466","url":null,"abstract":"<p><p>We introduce the problem of variable-length (VL) source resolvability, in which a given target probability distribution is approximated by encoding a VL uniform random number, and the asymptotically minimum average length rate of the uniform random number, called the VL resolvability, is investigated. We first analyze the VL resolvability with the variational distance as an approximation measure. Next, we investigate the case under the divergence as an approximation measure. When the asymptotically exact approximation is required, it is shown that the resolvability under two kinds of approximation measures coincides. We then extend the analysis to the case of channel resolvability, where the target distribution is the output distribution via a general channel due to a fixed general source as an input. The obtained characterization of channel resolvability is fully general in the sense that, when the channel is just an identity mapping, it reduces to general formulas for source resolvability. We also analyze the second-order VL resolvability.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606717/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561682","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 : 2023-10-19DOI: 10.3390/e25101463
Vladimir Perovic, Sanja Glisic, Milena Veljkovic, Slobodan Paessler, Veljko Veljkovic
{"title":"Novel Entropy-Based Phylogenetic Algorithm: A New Approach for Classifying SARS-CoV-2 Variants.","authors":"Vladimir Perovic, Sanja Glisic, Milena Veljkovic, Slobodan Paessler, Veljko Veljkovic","doi":"10.3390/e25101463","DOIUrl":"10.3390/e25101463","url":null,"abstract":"<p><p>The SARS-CoV-2 virus, the causative agent of COVID-19, is known for its genetic diversity. Virus variants of concern (VOCs) as well as variants of interest (VOIs) are classified by the World Health Organization (WHO) according to their potential risk to global health. This study seeks to enhance the identification and classification of such variants by developing a novel bioinformatics criterion centered on the virus's spike protein (SP1), a key player in host cell entry, immune response, and a mutational hotspot. To achieve this, we pioneered a unique phylogenetic algorithm which calculates EIIP-entropy as a distance measure based on the distribution of the electron-ion interaction potential (EIIP) of amino acids in SP1. This method offers a comprehensive, scalable, and rapid approach to analyze large genomic data sets and predict the impact of specific mutations. This innovative approach provides a robust tool for classifying emergent SARS-CoV-2 variants into potential VOCs or VOIs. It could significantly augment surveillance efforts and understanding of variant characteristics, while also offering potential applicability to the analysis and classification of other emerging viral pathogens and enhancing global readiness against emerging and re-emerging viral pathogens.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606860/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561642","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 : 2023-10-18DOI: 10.3390/e25101462
Mohamed Amazioug, Shailendra Singh, Berihu Teklu, Muhammad Asjad
{"title":"Feedback Control of Quantum Correlations in a Cavity Magnomechanical System with Magnon Squeezing.","authors":"Mohamed Amazioug, Shailendra Singh, Berihu Teklu, Muhammad Asjad","doi":"10.3390/e25101462","DOIUrl":"10.3390/e25101462","url":null,"abstract":"<p><p>We suggest a method to improve quantum correlations in cavity magnomechanics, through the use of a coherent feedback loop and magnon squeezing. The entanglement of three bipartition subsystems: photon-phonon, photon-magnon, and phonon-magnon, is significantly improved by the coherent feedback-control method that has been proposed. In addition, we investigate Einstein-Podolsky-Rosen steering under thermal effects in each of the subsystems. We also evaluate the scheme's performance and sensitivity to magnon squeezing. Furthermore, we study the comparison between entanglement and Gaussian quantum discord in both steady and dynamical states.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606175/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561618","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 : 2023-10-18DOI: 10.3390/e25101461
Naya Nagy, Marius Nagy, Ghadeer Alazman, Zahra Hawaidi, Saja Mustafa Alsulaibikh, Layla Alabbad, Sadeem Alfaleh, Areej Aljuaid
{"title":"Quantum Honeypots.","authors":"Naya Nagy, Marius Nagy, Ghadeer Alazman, Zahra Hawaidi, Saja Mustafa Alsulaibikh, Layla Alabbad, Sadeem Alfaleh, Areej Aljuaid","doi":"10.3390/e25101461","DOIUrl":"10.3390/e25101461","url":null,"abstract":"<p><p>Quantum computation offers unique properties that cannot be paralleled by conventional computers. In particular, <i>reading</i> qubits may change their state and thus signal the presence of an intruder. This paper develops a proof-of-concept for a quantum honeypot that allows the detection of intruders on reading. The idea is to place quantum sentinels within all resources offered within the honeypot. Additional to classical honeypots, honeypots with quantum sentinels can trace the reading activity of the intruder within any resource. Sentinels can be set to be either visible and accessible to the intruder or hidden and unknown to intruders. Catching the intruder using quantum sentinels has a low theoretical probability per sentinel, but the probability can be increased arbitrarily higher by adding more sentinels. The main contributions of this paper are that the monitoring of the intruder can be carried out at the level of the information unit, such as the bit, and quantum monitoring activity is fully hidden from the intruder. Practical experiments, as performed in this research, show that the error rate of quantum computers has to be considerably reduced before implementations of this concept are feasible.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606432/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561657","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 : 2023-10-18DOI: 10.3390/e25101460
Yong Tang, Jason Xiong, Zhitao Cheng, Yan Zhuang, Kunqi Li, Jingcong Xie, Yicheng Zhang
{"title":"Looking into the Market Behaviors through the Lens of Correlations and Eigenvalues: An Investigation on the Chinese and US Markets Using RMT.","authors":"Yong Tang, Jason Xiong, Zhitao Cheng, Yan Zhuang, Kunqi Li, Jingcong Xie, Yicheng Zhang","doi":"10.3390/e25101460","DOIUrl":"10.3390/e25101460","url":null,"abstract":"<p><p>This research systematically analyzes the behaviors of correlations among stock prices and the eigenvalues for correlation matrices by utilizing random matrix theory (RMT) for Chinese and US stock markets. Results suggest that most eigenvalues of both markets fall within the predicted distribution intervals by RMT, whereas some larger eigenvalues fall beyond the noises and carry market information. The largest eigenvalue represents the market and is a good indicator for averaged correlations. Further, the average largest eigenvalue shows similar movement with the index for both markets. The analysis demonstrates the fraction of eigenvalues falling beyond the predicted interval, pinpointing major market switching points. It has identified that the average of eigenvector components corresponds to the largest eigenvalue switch with the market itself. The investigation on the second largest eigenvalue and its eigenvector suggests that the Chinese market is dominated by four industries whereas the US market contains three leading industries. The study later investigates how it changes before and after a market crash, revealing that the two markets behave differently, and a major market structure change is observed in the Chinese market but not in the US market. The results shed new light on mining hidden information from stock market data.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606484/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561632","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 : 2023-10-17DOI: 10.3390/e25101457
Juanxia Zhao, Yinhe Wang, Peitao Gao, Shengping Li, Yi Peng
{"title":"Synchronization of Complex Dynamical Networks with Stochastic Links Dynamics.","authors":"Juanxia Zhao, Yinhe Wang, Peitao Gao, Shengping Li, Yi Peng","doi":"10.3390/e25101457","DOIUrl":"10.3390/e25101457","url":null,"abstract":"<p><p>The mean square synchronization problem of the complex dynamical network (CDN) with the stochastic link dynamics is investigated. In contrast to previous literature, the CDN considered in this paper can be viewed as consisting of two subsystems coupled to each other. One subsystem consists of all nodes, referred to as the nodes subsystem, and the other consists of all links, referred to as the network topology subsystem, where the weighted values can quantitatively reflect changes in the network's topology. Based on the above understanding of CDN, two vector stochastic differential equations with Brownian motion are used to model the dynamic behaviors of nodes and links, respectively. The control strategy incorporates not only the controller in the nodes but also the coupling term in the links, through which the CDN is synchronized in the mean-square sense. Meanwhile, the dynamic stochastic signal is proposed in this paper, which is regarded as the auxiliary reference tracking target of links, such that the links can track the reference target asymptotically when synchronization occurs in nodes. This implies that the eventual topological structure of CDN is stochastic. Finally, a comparison simulation example confirms the superiority of the control strategy in this paper.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606096/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561672","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 : 2023-10-17DOI: 10.3390/e25101456
Morteza Shoushtari, Willie Harrison
{"title":"Optimizing Finite-Blocklength Nested Linear Secrecy Codes: Using the Worst Code to Find the Best Code.","authors":"Morteza Shoushtari, Willie Harrison","doi":"10.3390/e25101456","DOIUrl":"10.3390/e25101456","url":null,"abstract":"<p><p>Nested linear coding is a widely used technique in wireless communication systems for improving both security and reliability. Some parameters, such as the relative generalized Hamming weight and the relative dimension/length profile, can be used to characterize the performance of nested linear codes. In addition, the rank properties of generator and parity-check matrices can also precisely characterize their security performance. Despite this, finding optimal nested linear secrecy codes remains a challenge in the finite-blocklength regime, often requiring brute-force search methods. This paper investigates the properties of nested linear codes, introduces a new representation of the relative generalized Hamming weight, and proposes a novel method for finding the best nested linear secrecy code for the binary erasure wiretap channel by working from the worst nested linear secrecy code in the dual space. We demonstrate that our algorithm significantly outperforms the brute-force technique in terms of speed and efficiency.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606228/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561647","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 : 2023-10-17DOI: 10.3390/e25101455
Fenghua Wang, Hale Cetinay, Zhidong He, Le Liu, Piet Van Mieghem, Robert E Kooij
{"title":"Recovering Power Grids Using Strategies Based on Network Metrics and Greedy Algorithms.","authors":"Fenghua Wang, Hale Cetinay, Zhidong He, Le Liu, Piet Van Mieghem, Robert E Kooij","doi":"10.3390/e25101455","DOIUrl":"10.3390/e25101455","url":null,"abstract":"<p><p>For this study, we investigated efficient strategies for the recovery of individual links in power grids governed by the direct current (DC) power flow model, under random link failures. Our primary objective was to explore the efficacy of recovering failed links based solely on topological network metrics. In total, we considered 13 recovery strategies, which encompassed 2 strategies based on link centrality values (link betweenness and link flow betweenness), 8 strategies based on the products of node centrality values at link endpoints (degree, eigenvector, weighted eigenvector, closeness, electrical closeness, weighted electrical closeness, zeta vector, and weighted zeta vector), and 2 heuristic strategies (greedy recovery and two-step greedy recovery), in addition to the random recovery strategy. To evaluate the performance of these proposed strategies, we conducted simulations on three distinct power systems: the IEEE 30, IEEE 39, and IEEE 118 systems. Our findings revealed several key insights: Firstly, there were notable variations in the performance of the recovery strategies based on topological network metrics across different power systems. Secondly, all such strategies exhibited inferior performance when compared to the heuristic recovery strategies. Thirdly, the two-step greedy recovery strategy consistently outperformed the others, with the greedy recovery strategy ranking second. Based on our results, we conclude that relying solely on a single metric for the development of a recovery strategy is insufficient when restoring power grids following link failures. By comparison, recovery strategies employing greedy algorithms prove to be more effective choices.</p>","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606524/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561660","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 : 2023-10-17DOI: 10.3390/e25101454
Yiqian Zhang, Tiantian Zhu, Congduan Li
{"title":"Efficient Communications in V2V Networks with Two-Way Lanes Based on Random Linear Network Coding.","authors":"Yiqian Zhang, Tiantian Zhu, Congduan Li","doi":"10.3390/e25101454","DOIUrl":"10.3390/e25101454","url":null,"abstract":"Vehicle-to-vehicle (V2V) communication has gained significant attention in the field of intelligent transportation systems. In this paper, we focus on communication scenarios involving vehicles moving in the same and opposite directions. Specifically, we model a V2V network as a dynamic multi-source single-sink network with two-way lanes. To address rapid changes in network topology, we employ random linear network coding (RLNC), which eliminates the need for knowledge of the network topology. We begin by deriving the lower bound for the generation probability. Through simulations, we analyzed the probability distribution and cumulative probability distribution of latency under varying packet loss rates and batch sizes. Our results demonstrated that our RLNC scheme significantly reduced the communication latency, even under challenging channel conditions, when compared to the non-coding case.","PeriodicalId":11694,"journal":{"name":"Entropy","volume":"25 10","pages":""},"PeriodicalIF":2.7,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10606670/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"61561610","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}