Search

The research groups in computer vision, graphics, and machine learning have dedicated a substantial amount of attention to the areas of 3D object reconstruction, augmentation, and registration. Deep learning is the predominant method used in artificial intelligence for addressing computer vision challenges. However, deep learning on three-dimensional data presents distinct obstacles and is now in its nascent phase. There have been significant advancements in deep learning specifically for three-dimensional data, offering a range of ways to address these issues. This study offers a comprehensive examination of the latest advancements in deep learning methodologies. We examine many benchmark models for the tasks of 3D object registration, augmentation, and reconstruction. We thoroughly analyse their architectures, advantages, and constraints. In summary, this report provides a comprehensive overview of recent advancements in three-dimensional deep learning and highlights unresolved research areas that will need to be addressed in the future. [ABSTRACT FROM AUTHOR]

As such, entropy in an economic system is a sum of the entropy production in the system itself and the exchange of entropy with the environment. Entropy economics has also laid the groundwork for new avenues of economic research, such as econophysics, complexity economics, and quantum economics. The Role of Entropy in the Development of Economics [[2]] B Aleksander Jakimowicz b B I Entropy i 2020, 22(4), 452; b https://doi.org/10.3390/e22040452 Graph Economics and physics have been feeding into each other for at least 170 years. A new field of study has also appeared - thermoeconomics - which applies the analogues of thermodynamic entropy in economics, as best exemplified by money entropy. [Extracted from the article]

The Gaussian wiretap channel with noncausal state interference available at the transmitter, which is also called the dirty paper wiretap channel (DP-WTC), has been extensively studied in the literature. Recently, it has been shown that taking actions on the corrupted state interference of the DP-WTC (also called the action-dependent DP-WTC) helps to increase the secrecy capacity of the DP-WTC. Subsequently, it has been shown that channel feedback further increases the secrecy capacity of the action-dependent DP-WTC (AD-DP-WTC), and a sub-optimal feedback scheme is proposed for this feedback model. In this paper, a two-step hybrid scheme and a corresponding new lower bound on the secrecy capacity of the AD-DP-WTC with noiseless feedback are proposed. The proposed new lower bound is shown to be optimal (achieving the secrecy capacity) and tighter than the existing one in the literature for some cases, and the results of this paper are further explained via numerical examples. [ABSTRACT FROM AUTHOR]

Translation of the seminal 1877 paper by Ludwig Boltzmann which for the first time established the probabilistic basis of entropy. Includes a scientific commentary. [ABSTRACT FROM AUTHOR]

The article presents information on the recipients of the Entropy Best Paper Award that been have selected by Editor-in-Chief and designated Editorial Board Members from all research papers published in 2011. Topics discussed include an article on amines in Earth's atmosphere by Alexey B. Nadykto that won the third prize in Article Award category, a review paper "Thermodynamics of Thermoelectric Phenomena and Applications and periodical's editor-in-chief Prof. Dr. Kevin H. Knuth.

Joint communications and sensing functionalities integrated into the same communication network have become increasingly relevant due to the large bandwidth requirements of next-generation wireless communication systems and the impending spectral shortage. While there exist system-level guidelines and waveform design specifications for such systems, an information-theoretic analysis of the absolute performance capabilities of joint sensing and communication systems that take into account practical limitations such as fading has not been addressed in the literature. Motivated by this, we undertake a network information-theoretic analysis of a typical joint communications and sensing system in this paper. Towards this end, we consider a state-dependent fading Gaussian multiple access channel (GMAC) setup with an additive state. The state process is assumed to be independent and identically distributed (i.i.d.) Gaussian, and non-causally available to all the transmitting nodes. The fading gains on the respective links are assumed to be stationary and ergodic and available only at the receiver. In this setting, with no knowledge of fading gains at the transmitters, we are interested in joint message communication and estimation of the state at the receiver to meet a target distortion in the mean-squared error sense. Our main contribution here is a complete characterization of the distortion-rate trade-off region between the communication rates and the state estimation distortion for a two-sender GMAC. Our results show that the optimal strategy is based on static power allocation and involves uncoded transmissions to amplify the state, along with the superposition of the digital message streams using appropriate Gaussian codebooks and dirty paper coding (DPC). This acts as a design directive for realistic systems using joint sensing and transmission in next-generation wireless standards and points to the relative benefits of uncoded communications and joint source-channel coding in such systems. [ABSTRACT FROM AUTHOR]

The article announces recipients of the "Entropy Best Paper Award" for 2014 including Alexander N. Gorban, Andrzej Cichocki and Katherine L. Brown for articles related to Markov process, Alpha, Beta and Gamma divergences and quantum computers, published in the 2010 issue of the journal.

The analysis of research paper collections is an interesting topic that can give insights on whether a research area is stalled in the same problems, or there is a great amount of novelty every year. Previous research has addressed similar tasks by the analysis of keywords or reference lists, with different degrees of human intervention. In this paper, we demonstrate how, with the use of Normalized Relative Compression, together with a set of automated data-processing tasks, we can successfully visually compare research articles and document collections. We also achieve very similar results with Normalized Conditional Compression that can be applied with a regular compressor. With our approach, we can group papers of different disciplines, analyze how a conference evolves throughout the different editions, or how the profile of a researcher changes through the time. We provide a set of tests that validate our technique, and show that it behaves better for these tasks than other techniques previously proposed. [ABSTRACT FROM AUTHOR]

This paper presents a novel method for finding features in the analysis of variable distributions stemming from time series. We apply the methodology to the case of submitted and accepted papers in peer-reviewed journals. We provide a comparative study of editorial decisions for papers submitted to two peer-reviewed journals: the Journal of the Serbian Chemical Society (JSCS) and this MDPI Entropy journal. We cover three recent years for which the fate of submitted papers—about 600 papers to JSCS and 2500 to Entropy—is completely determined. Instead of comparing the number distributions of these papers as a function of time with respect to a uniform distribution, we analyze the relevant probabilities, from which we derive the information entropy. It is argued that such probabilities are indeed more relevant for authors than the actual number of submissions. We tie this entropy analysis to the so called diversity of the variable distributions. Furthermore, we emphasize the correspondence between the entropy and the diversity with inequality measures, like the Herfindahl-Hirschman index and the Theil index, itself being in the class of entropy measures; the Gini coefficient which also measures the diversity in ranking is calculated for further discussion. In this sample, the seasonal aspects of the peer review process are outlined. It is found that the use of such indices, non linear transformations of the data distributions, allow us to distinguish features and evolutions of the peer review process as a function of time as well as comparing the non-uniformity of distributions. Furthermore, t- and z-statistical tests are applied in order to measure the significance (p-level) of the findings, that is, whether papers are more likely to be accepted if they are submitted during a few specific months or during a particular "season"; the predictability strength depends on the journal. [ABSTRACT FROM AUTHOR]

Medical image diagnosis using deep learning has shown significant promise in clinical medicine. However, it often encounters two major difficulties in real-world applications: (1) domain shift, which invalidates the trained model on new datasets, and (2) class imbalance problems leading to model biases towards majority classes. To address these challenges, this paper proposes a transfer learning solution, named Dynamic Weighting Translation Transfer Learning (DTTL), for imbalanced medical image classification. The approach is grounded in information and entropy theory and comprises three modules: Cross-domain Discriminability Adaptation (CDA), Dynamic Domain Translation (DDT), and Balanced Target Learning (BTL). CDA connects discriminative feature learning between source and target domains using a synthetic discriminability loss and a domain-invariant feature learning loss. The DDT unit develops a dynamic translation process for imbalanced classes between two domains, utilizing a confidence-based selection approach to select the most useful synthesized images to create a pseudo-labeled balanced target domain. Finally, the BTL unit performs supervised learning on the reassembled target set to obtain the final diagnostic model. This paper delves into maximizing the entropy of class distributions, while simultaneously minimizing the cross-entropy between the source and target domains to reduce domain discrepancies. By incorporating entropy concepts into our framework, our method not only significantly enhances medical image classification in practical settings but also innovates the application of entropy and information theory within deep learning and medical image processing realms. Extensive experiments demonstrate that DTTL achieves the best performance compared to existing state-of-the-art methods for imbalanced medical image classification tasks. [ABSTRACT FROM AUTHOR]

Underwriters play a pivotal role in the IPO process. Information entropy, a tool for measuring the uncertainty and complexity of information, has been widely applied to various issues in complex networks. Information entropy can quantify the uncertainty and complexity of nodes in the network, providing a unique analytical perspective and methodological support for this study. This paper employs a bipartite network analysis method to construct the relationship network between underwriters and accounting firms, using the centrality of underwriters in the network as a measure of their influence to explore the impact of underwriters' influence on the distribution of interests and audit outcomes. The findings indicate that a more pronounced influence of underwriters significantly increases the ratio of underwriting fees to audit fees. Higher influence often accompanies an increase in abnormal underwriting fees. Further research reveals that companies underwritten by more influential underwriters experience a decline in audit quality. Finally, the study reveals that a well-structured audit committee governance and the rationalization of market sentiments can mitigate the negative impacts of underwriters' influence. The innovation of this paper is that it enriches the content related to underwriters by constructing the relationship network between underwriters and accounting firms for the first time using a bipartite network through the lens of information entropy. This conclusion provides new directions for thinking about the motives and possibilities behind financial institutions' cooperation, offering insights for market regulation and policy formulation. [ABSTRACT FROM AUTHOR]

Domestic and international risk shocks have greatly increased the demand for systemic risk management in China. This paper estimates China's multi-layer financial network based on multiple financial relationships among banks, assets, and firms, using China's banking system data in 2021. An improved PageRank algorithm is proposed to identify systemically important banks and other economic sectors, and a stress test is conducted. This study finds that China's multi-layer financial network is sparse, and the distribution of transactions across financial markets is uneven. Regulatory authorities should support economic recovery and adjust the money supply, while banks should differentiate competition and manage risks better. Based on the PageRank index, this paper assesses the systemic importance of large commercial banks from the perspective of network structure, emphasizing the role of banks' transaction behavior and market participation. Different industries and asset classes are also assessed, suggesting that increased attention should be paid to industry risks and regulatory oversight of bank investments. Finally, stress tests confirm that the improved PageRank algorithm is applicable within the multi-layer financial network, reinforcing the need for prudential supervision of the banking system and revealing that the degree of transaction concentration will affect the systemic importance of financial institutions. [ABSTRACT FROM AUTHOR]

Categorical data analysis of 2 × 2 contingency tables is extremely common, not least because they provide risk difference, risk ratio, odds ratio, and log odds statistics in medical research. A χ 2 test analysis is most often used, although some researchers use likelihood ratio test (LRT) analysis. Does it matter which test is used? A review of the literature, examination of the theoretical foundations, and analyses of simulations and empirical data are used by this paper to argue that only the LRT should be used when we are interested in testing whether the binomial proportions are equal. This so-called test of independence is by far the most popular, meaning the χ 2 test is widely misused. By contrast, the χ 2 test should be reserved for where the data appear to match too closely a particular hypothesis (e.g., the null hypothesis), where the variance is of interest, and is less than expected. Low variance can be of interest in various scenarios, particularly in investigations of data integrity. Finally, it is argued that the evidential approach provides a consistent and coherent method that avoids the difficulties posed by significance testing. The approach facilitates the calculation of appropriate log likelihood ratios to suit our research aims, whether this is to test the proportions or to test the variance. The conclusions from this paper apply to larger contingency tables, including multi-way tables. [ABSTRACT FROM AUTHOR]

Linear complementary dual (LCD) codes, which are a class of linear codes introduced by Massey, have been extensively studied in the literature recently. It has been shown that LCD codes play a role in measures to counter passive and active side-channel analyses on embedded cryptosystems. In this paper, tables are presented of good quaternary Hermitian LCD codes and they are used in the construction of puncturing, shortening and combination codes. The results of this, including three tables of the best-known quaternary Hermitian LCD codes of any length n ≤ 25 with corresponding dimension k, are presented. In addition, many of these quaternary Hermitian LCD codes given in this paper are optimal and saturate the lower or upper bound of Grassl's code table, and some of them are nearly optimal. [ABSTRACT FROM AUTHOR]

New insights into intractable industrial challenges can be revealed by framing them in terms of natural science. One intractable industrial challenge is that creative production can be much more financially expensive and time consuming than standardized production. Creative products include a wide range of goods that have one or more original characteristics. The scaling up of creative production is hindered by high financial production costs and long production durations. In this paper, creative production is framed in terms of interactions between entropy and complexity during progressions from emergent pragmatics to action semantics. An analysis of interactions between entropy and complexity is provided that relates established practice in creative production to organizational survival in changing environments. The analysis in this paper is related to assembly theory, which is a recent theoretical development in natural science that addresses how open-ended generation of complex physical objects can emerge from selection in biology. Parallels between assembly practice in industrial production and assembly theory in natural science are explained through constructs that are common to both, such as assembly index. Overall, analyses reported in the paper reveal that interactions between entropy and complexity underlie intractable challenges in creative production, from the production of individual products to the survival of companies. [ABSTRACT FROM AUTHOR]

The article announces the "Best Paper Award 2013" from the periodical given to the authors including Bhashyam Balaji, Arto Annila and Stanley Salthe, and Michel Feidt for their papers in the area of entropy and information studies.

The quiet-time solar wind electrons feature non-thermal characteristics when viewed from the perspective of their velocity distribution functions. They typically have an appearance of being composed of a denser thermal "core" population plus a tenuous energetic "halo" population. At first, such a feature was empirically fitted with the kappa velocity space distribution function, but ever since the ground-breaking work by Tsallis, the space physics community has embraced the potential implication of the kappa distribution as reflecting the non-extensive nature of the space plasma. From the viewpoint of microscopic plasma theory, the formation of the non-thermal electron velocity distribution function can be interpreted in terms of the plasma being in a state of turbulent quasi-equilibrium. Such a finding brings forth the possible existence of a profound inter-relationship between the non-extensive statistical state and the turbulent quasi-equilibrium state. The present paper further develops the idea of solar wind electrons being in the turbulent equilibrium, but, unlike the previous model, which involves the electrostatic turbulence near the plasma oscillation frequency (i.e., Langmuir turbulence), the present paper considers the impact of transverse electromagnetic turbulence, particularly, the turbulence in the whistler-mode frequency range. It is found that the coupling of spontaneously emitted thermal fluctuations and the background turbulence leads to the formation of a non-thermal electron velocity distribution function of the type observed in the solar wind during quiet times. This demonstrates that the whistler-range turbulence represents an alternative mechanism for producing the kappa-like non-thermal distribution, especially close to the Sun and in the near-Earth space environment. [ABSTRACT FROM AUTHOR]

This paper shows that the empirical distribution of cross-sectional analyst coverage in China's stock markets follows an exponential law in a given month from 2011 to 2020. The findings hold in both the emerging (Shanghai) and the developed market (Hong Kong). Moreover, the unique distribution parameter (i.e., mean) is directly related to the amount of market-wide information. Average analyst coverage exhibits a significant negative predictive power for stock-market uncertainty, highlighting the role of security analysts in diminishing the total uncertainty. The exponential law can be derived from the maximum entropy principle (MEP). When analysts, who are constrained by average ability in generating information (i.e., the first-order moment), strive to maximize the amount of market-wide information, this objective yields the exponential distribution. Contrary to the conventional wisdom that security analysts specialize in the generation of firm-specific information, empirical findings suggest that analysts primarily produce market-wide information for 25 countries. Nevertheless, it remains unclear why cross-sectional analyst coverage reflects market-wide information, this paper provides an entropy-based explanation. [ABSTRACT FROM AUTHOR]

A unifying setup for opinion models originating in statistical physics and stochastic opinion dynamics are developed and used to analyze election data. The results are interpreted in the light of political theory. We investigate the connection between Potts (Curie–Weiss) models and stochastic opinion models in the view of the Boltzmann distribution and stochastic Glauber dynamics. We particularly find that the q-voter model can be considered as a natural extension of the Zealot model, which is adapted by Lagrangian parameters. We also discuss weak and strong effects (also called extensive and nonextensive) continuum limits for the models. The results are used to compare the Curie–Weiss model, two q-voter models (weak and strong effects), and a reinforcement model (weak effects) in explaining electoral outcomes in four western democracies (United States, Great Britain, France, and Germany). We find that particularly the weak effects models are able to fit the data (Kolmogorov–Smirnov test) where the weak effects reinforcement model performs best (AIC). Additionally, we show how the institutional structure shapes the process of opinion formation. By focusing on the dynamics of opinion formation preceding the act of voting, the models discussed in this paper give insights both into the empirical explanation of elections as such, as well as important aspects of the theory of democracy. Therefore, this paper shows the usefulness of an interdisciplinary approach in studying real world political outcomes by using mathematical models. [ABSTRACT FROM AUTHOR]

Since financial assets on stock exchanges were created, investors have sought to predict their future values. Currently, cryptocurrencies are also seen as assets. Machine learning is increasingly adopted to assist and automate investments. The main objective of this paper is to make daily predictions about the movement direction of financial time series through classification models, financial time series preprocessing methods, and feature selection with genetic algorithms. The target time series are Bitcoin, Ibovespa, and Vale. The methodology of this paper includes the following steps: collecting time series of financial assets; data preprocessing; feature selection with genetic algorithms; and the training and testing of machine learning models. The results were obtained by evaluating the models with the area under the ROC curve metric. For the best prediction models for Bitcoin, Ibovespa, and Vale, values of 0.61, 0.62, and 0.58 were obtained, respectively. In conclusion, the feature selection allowed the improvement of performance in most models, and the input series in the form of percentage variation obtained a good performance, although it was composed of fewer attributes in relation to the other sets tested. [ABSTRACT FROM AUTHOR]

Federated learning (FL) is a distributed machine learning framework that enables scattered participants to collaboratively train machine learning models without revealing information to other participants. Due to its distributed nature, FL is susceptible to being manipulated by malicious clients. These malicious clients can launch backdoor attacks by contaminating local data or tampering with local model gradients, thereby damaging the global model. However, existing backdoor attacks in distributed scenarios have several vulnerabilities. For example, (1) the triggers in distributed backdoor attacks are mostly visible and easily perceivable by humans; (2) these triggers are mostly applied in the spatial domain, inevitably corrupting the semantic information of the contaminated pixels. To address these issues, this paper introduces a frequency-domain injection-based backdoor attack in FL. Specifically, by performing a Fourier transform, the trigger and the clean image are linearly mixed in the frequency domain, injecting the low-frequency information of the trigger into the clean image while preserving its semantic information. Experiments on multiple image classification datasets demonstrate that the attack method proposed in this paper is stealthier and more effective in FL scenarios compared to existing attack methods. [ABSTRACT FROM AUTHOR]

The paper analyzes the probability distribution of the occupancy numbers and the entropy of a system at the equilibrium composed by an arbitrary number of non-interacting bosons. The probability distribution is obtained through two approaches: one involves tracing out the environment from a bosonic eigenstate of the combined environment and system of interest (the empirical approach), while the other involves tracing out the environment from the mixed state of the combined environment and system of interest (the Bayesian approach). In the thermodynamic limit, the two coincide and are equal to the multinomial distribution. Furthermore, the paper proposes to identify the physical entropy of the bosonic system with the Shannon entropy of the occupancy numbers, fixing certain contradictions that arise in the classical analysis of thermodynamic entropy. Finally, by leveraging an information-theoretic inequality between the entropy of the multinomial distribution and the entropy of the multivariate hypergeometric distribution, Bayesianism of information theory and empiricism of statistical mechanics are integrated into a common "infomechanical" framework. [ABSTRACT FROM AUTHOR]

The paper makes a case that the current discussions on replicability and the abuse of significance testing have overlooked a more general contributor to the untrustworthiness of published empirical evidence, which is the uninformed and recipe-like implementation of statistical modeling and inference. It is argued that this contributes to the untrustworthiness problem in several different ways, including [a] statistical misspecification, [b] unwarranted evidential interpretations of frequentist inference results, and [c] questionable modeling strategies that rely on curve-fitting. What is more, the alternative proposals to replace or modify frequentist testing, including [i] replacing p-values with observed confidence intervals and effects sizes, and [ii] redefining statistical significance, will not address the untrustworthiness of evidence problem since they are equally vulnerable to [a]–[c]. The paper calls for distinguishing between unduly data-dependant 'statistical results', such as a point estimate, a p-value, and accept/reject H 0 , from 'evidence for or against inferential claims'. The post-data severity (SEV) evaluation of the accept/reject H 0 results, converts them into evidence for or against germane inferential claims. These claims can be used to address/elucidate several foundational issues, including (i) statistical vs. substantive significance, (ii) the large n problem, and (iii) the replicability of evidence. Also, the SEV perspective sheds light on the impertinence of the proposed alternatives [i]–[iii], and oppugns [iii] the alleged arbitrariness of framing H 0 and H 1 which is often exploited to undermine the credibility of frequentist testing. [ABSTRACT FROM AUTHOR]

Slope Entropy (SlpEn) is a novel method recently proposed in the field of time series entropy estimation. In addition to the well-known embedded dimension parameter, m, used in other methods, it applies two additional thresholds, denoted as δ and γ , to derive a symbolic representation of a data subsequence. The original paper introducing SlpEn provided some guidelines for recommended specific values of these two parameters, which have been successfully followed in subsequent studies. However, a deeper understanding of the role of these thresholds is necessary to explore the potential for further SlpEn optimisations. Some works have already addressed the role of δ , but in this paper, we extend this investigation to include the role of γ and explore the impact of using an asymmetric scheme to select threshold values. We conduct a comparative analysis between the standard SlpEn method as initially proposed and an optimised version obtained through a grid search to maximise signal classification performance based on SlpEn. The results confirm that the optimised version achieves higher time series classification accuracy, albeit at the cost of significantly increased computational complexity. [ABSTRACT FROM AUTHOR]

A damaged stator vane can disrupt the circumferential symmetry of the design flow for turbine assemblies, which can lead to a low-engine-order (LEO) forced response of rotor blades. To help engineers be able to better address sudden vane damage failures, this paper conducts a mechanism analysis of the LEO forced response of rotor blades induced by a single damaged vane using an in-house computational fluid dynamic code (Hybrid Grid Aeroelasticity Environment). Firstly, it is found that the damaged vane introduces a family of LEO aerodynamic excitations with high amplitudes by full-annulus unsteady aeroelastic simulations of a single-stage turbine. In particular, the LEO forced response of the rotor blades excited by 3EO is 2.01 times higher than the resonance response excited by vane passing frequency, and the LEO resonance risk of the rotor blades is greatly increased. Then, by analyzing the flow characteristics of the wake and potential field of the stator row with a damaged vane, the localized high transient pressure in the notch cavity and the radial redistribution of the secondary vortex at the stator exit are the main sources of the low-order harmonic components in the flow field. Importantly, the interaction mechanisms in two regions with high LEO excitation amplitude on the rotor blade surface are revealed separately. Finally, an evaluation and comparison of a single damaged vane in terms of aerodynamic performance and LEO forced response was carried out. The results of this paper provide a good theoretical basis for engineers to effectively control the resonance response of rotor blades caused by a damaged stator vane in turbine design. [ABSTRACT FROM AUTHOR]

This paper investigates the mathematical model of the quantum wavelength-division-multiplexing (WDM) network based on the entanglement distribution with the least required wavelengths and passive devices. By adequately utilizing wavelength multiplexers, demultiplexers, and star couplers, N wavelengths are enough to distribute the entanglement among each pair of N users. Moreover, the number of devices employed is reduced by substituting a waveguide grating router for multiplexers and demultiplexers. Furthermore, this study examines implementing the BBM92 quantum key distribution in an entangled-based quantum WDM network. The proposed scheme in this paper may be applied to potential applications such as teleportation in entangled-based quantum WDM networks. [ABSTRACT FROM AUTHOR]

To address the problem that traditional spectral clustering algorithms cannot obtain the complete structural information of networks, this paper proposes a spectral clustering community detection algorithm, PMIK-SC, based on the point-wise mutual information (PMI) graph kernel. The kernel is constructed according to the point-wise mutual information between nodes, which is then used as a proximity matrix to reconstruct the network and obtain the symmetric normalized Laplacian matrix. Finally, the network is partitioned by the eigendecomposition and eigenvector clustering of the Laplacian matrix. In addition, to determine the number of clusters during spectral clustering, this paper proposes a fast algorithm, BI-CNE, for estimating the number of communities. For a specific network, the algorithm first reconstructs the original network and then runs Monte Carlo sampling to estimate the number of communities by Bayesian inference. Experimental results show that the detection speed and accuracy of the algorithm are superior to other existing algorithms for estimating the number of communities. On this basis, the spectral clustering community detection algorithm PMIK-SC also has high accuracy and stability compared with other community detection algorithms and spectral clustering algorithms. [ABSTRACT FROM AUTHOR]

This paper studies the performance of location-based beamforming with the presence of artificial noise (AN). Secure transmission can be achieved using the location information of the user. However, the shape of the beam depends on the number of antennas used. When the scale of the antenna array is not sufficiently large, it becomes difficult to differentiate the performance between the legitimate user and eavesdroppers nearby. In this paper, we leverage AN to minimize the area near the user with eavesdropping risk. The impact of AN is considered for both the legitimate user and the eavesdropper. Closed-form expressions are derived for the expectations of the signal to interference plus noise ratios (SINRs) and the bit error rates. Then, a secure beamforming scheme is proposed to ensure a minimum SINR requirement for the legitimate user and minimize the SINR of the eavesdropper. Numerical results show that, even with a small number of antennas, the proposed beamforming scheme can effectively degrade the performance of eavesdroppers near the legitimate user. [ABSTRACT FROM AUTHOR]

Due to the asymmetry of quantum errors, phase-shift errors are more likely to occur than qubit-flip errors. Consequently, there is a need to develop asymmetric quantum error-correcting (QEC) codes that can safeguard quantum information transmitted through asymmetric channels. Currently, a significant body of literature has investigated the construction of asymmetric QEC codes. However, the asymmetry of most QEC codes identified in the literature is limited by the dual-containing condition within the Calderbank-Shor-Steane (CSS) framework. This limitation restricts the exploration of their full potential in terms of asymmetry. In order to enhance the asymmetry of asymmetric QEC codes, we utilize entanglement-assisted technology and exploit the algebraic structure of cyclotomic cosets of constacyclic codes to achieve this goal. In this paper, we generalize the decomposition method of the defining set for constacyclic codes and apply it to count the number of pre-shared entangled states in order to construct four new classes of asymmetric entanglement-assisted quantum maximal-distance separable (EAQMDS) codes that satisfy the asymmetric entanglement-assisted quantum Singleton bound. Compared with the codes existing in the literature, the lengths of the constructed EAQMDS codes and the number of pre-shared entangled states are more general, and the codes constructed in this paper have greater asymmetry. [ABSTRACT FROM AUTHOR]

This paper introduces a novel three-parameter invertible bimodal Gumbel distribution, addressing the need for a versatile statistical tool capable of simultaneously modeling maximum and minimum extremes in various fields such as hydrology, meteorology, finance, and insurance. Unlike previous bimodal Gumbel distributions available in the literature, our proposed model features a simple closed-form cumulative distribution function, enhancing its computational attractiveness and applicability. This paper elucidates the behavior and advantages of the invertible bimodal Gumbel distribution through detailed mathematical formulations, graphical illustrations, and exploration of distributional characteristics. We illustrate using financial data to estimate Value at Risk (VaR) from our suggested model, considering maximum and minimum blocks simultaneously. [ABSTRACT FROM AUTHOR]

Based on authorized patents of China's artificial intelligence industry from 2013 to 2022, this paper constructs an Industry–University–Research institution (IUR) collaboration network and an Inter-Firm (IF) collaboration network and used the entropy weight method to take both the quantity and quality of patents into account to calculate the innovation performance of firms. Through the hierarchical clustering algorithm and classification and regression trees (CART) algorithm, in-depth analysis has been conducted on the intricate non-linear influence mechanisms between multiple variables and a firm's innovation performance. The findings indicate the following: (1) Based on the network centrality (NC), structural hole (SH), collaboration breadth (CB), and collaboration depth (CD) of both IUR and IF collaboration networks, two types of focal firms are identified. (2) For different types of focal firms, the combinations of network characteristics affecting their innovation performance are various. (3) In the IUR collaboration network, focal firms with a wide range of heterogeneous collaborative partners can obtain high innovation performance. However, focal firms in the IF collaboration network can achieve the same aim by maintaining deep collaboration with other focal firms. This paper not only helps firms make scientific decisions for development but also provides valuable suggestions for government policymakers. [ABSTRACT FROM AUTHOR]

Network attack and defence games are gradually becoming a new approach through which to study the protection of infrastructure networks such as power grids and transportation networks. Uncertainty factors, such as the subjective decision preferences of attackers and defenders, are not considered in existing attack and defence game studies for infrastructure networks. In this paper, we introduce, respectively, the attacker's and defender's expectation value, rejection value, and hesitation degree of the target, as well as construct an intuitionistic fuzzy goal-based attack and defence game model for infrastructure networks that are based on the maximum connectivity slice size, which is a network performance index. The intuitionistic fuzzy two-player, zero-sum game model is converted into a linear programming problem for solving, and the results are analysed to verify the applicability and feasibility of the model proposed in this paper. Furthermore, different situations, such as single-round games and multi-round repeated games, are also considered. The experimental results show that, when attacking the network, the attacker rarely attacks the nodes with higher importance in the network, but instead pays more attention to the nodes that are not prominent in the network neutrality and median; meanwhile, the defender is more inclined to protect the more important nodes in the network to ensure the normal performance of the network. [ABSTRACT FROM AUTHOR]

Federated learning, as one of the three main technical routes for privacy computing, has been widely studied and applied in both academia and industry. However, malicious nodes may tamper with the algorithm execution process or submit false learning results, which directly affects the performance of federated learning. In addition, learning nodes can easily obtain the global model. In practical applications, we would like to obtain the federated learning results only by the demand side. Unfortunately, no discussion on protecting the privacy of the global model is found in the existing research. As emerging cryptographic tools, the zero-knowledge virtual machine (ZKVM) and homomorphic encryption provide new ideas for the design of federated learning frameworks. We have introduced ZKVM for the first time, creating learning nodes as local computing provers. This provides execution integrity proofs for multi-class machine learning algorithms. Meanwhile, we discuss how to generate verifiable proofs for large-scale machine learning tasks under resource constraints. In addition, we implement the fully homomorphic encryption (FHE) scheme in ZKVM. We encrypt the model weights so that the federated learning nodes always collaborate in the ciphertext space. The real results can be obtained only after the demand side decrypts them using the private key. The innovativeness of this paper is demonstrated in the following aspects: 1. We introduce the ZKVM for the first time, which achieves zero-knowledge proofs (ZKP) for machine learning tasks with multiple classes and arbitrary scales. 2. We encrypt the global model, which protects the model privacy during local computation and transmission. 3. We propose and implement a new federated learning framework. We measure the verification costs under different federated learning rounds on the IRIS dataset. Despite the impact of homomorphic encryption on computational accuracy, the framework proposed in this paper achieves a satisfactory 90% model accuracy. Our framework is highly secure and is expected to further improve the overall efficiency as cryptographic tools continue to evolve. [ABSTRACT FROM AUTHOR]

Quantum obfuscation is one of the important primitives in quantum cryptography that can be used to enhance the security of various quantum cryptographic schemes. The research on quantum obfuscation focuses mainly on the obfuscatability of quantum functions. As a primary quantum function, the quantum power function has led to the development of quantum obfuscation because it is applicable to construct new obfuscation applications such as quantum encryption schemes. However, the previous definition of quantum power functions is constrained and cannot be beneficial to the further construction of other quantum functions. Thus, it is essential to extend the definition of the basic quantum power function in a more general manner. In this paper, we provide a formal definition of two quantum power functions called generalized quantum power functions with coefficients, each of which is characterized by a leading coefficient and an exponent that corresponds to either a quantum or classical state, indicating the generality. The first is the quantum power function with a leading coefficient, and the second is the quantum n-th power function, which are both fundamental components of quantum polynomial functions. In addition, obfuscation schemes for the functions are constructed by quantum teleportation and quantum superdense coding, and demonstrations of their obfuscatability are also provided in this paper. This work establishes the fundamental basis for constructing more quantum functions that can be utilized for quantum obfuscation, therefore contributing to the theory of quantum obfuscation. [ABSTRACT FROM AUTHOR]

This paper explores the potential of using the SAM (Segment-Anything Model) segmentator to enhance the segmentation capability of known methods. SAM is a promptable segmentation system that offers zero-shot generalization to unfamiliar objects and images, eliminating the need for additional training. The open-source nature of SAM allows for easy access and implementation. In our experiments, we aim to improve the segmentation performance by providing SAM with checkpoints extracted from the masks produced by mainstream segmentators, and then merging the segmentation masks provided by these two networks. We examine the "oracle" method (as upper bound baseline performance), where segmentation masks are inferred only by SAM with checkpoints extracted from the ground truth. One of the main contributions of this work is the combination (fusion) of the logit segmentation masks produced by the SAM model with the ones provided by specialized segmentation models such as DeepLabv3+ and PVTv2. This combination allows for a consistent improvement in segmentation performance in most of the tested datasets. We exhaustively tested our approach on seven heterogeneous public datasets, obtaining state-of-the-art results in two of them (CAMO and Butterfly) with respect to the current best-performing method with a combination of an ensemble of mainstream segmentator transformers and the SAM segmentator. The results of our study provide valuable insights into the potential of incorporating the SAM segmentator into existing segmentation techniques. We release with this paper the open-source implementation of our method. [ABSTRACT FROM AUTHOR]

As with probability theory, uncertainty theory has been developed, in recent years, to portray indeterminacy phenomena in various application scenarios. We are concerned, in this paper, with the convergence property of state trajectories to equilibrium states (or fixed points) of time delayed uncertain cellular neural networks driven by the Liu process. By applying the classical Banach's fixed-point theorem, we prove, under certain conditions, that the delayed uncertain cellular neural networks, concerned in this paper, have unique equilibrium states (or fixed points). By carefully designing a certain Lyapunov–Krasovskii functional, we provide a convergence criterion, for state trajectories of our concerned uncertain cellular neural networks, based on our developed Lyapunov–Krasovskii functional. We demonstrate under our proposed convergence criterion that the existing equilibrium states (or fixed points) are exponentially stable almost surely, or equivalently that state trajectories converge exponentially to equilibrium states (or fixed points) almost surely. We also provide an example to illustrate graphically and numerically that our theoretical results are all valid. There seem to be rare results concerning the stability of equilibrium states (or fixed points) of neural networks driven by uncertain processes, and our study in this paper would provide some new research clues in this direction. The conservatism of the main criterion obtained in this paper is reduced by introducing quite general positive definite matrices in our designed Lyapunov–Krasovskii functional. [ABSTRACT FROM AUTHOR]

Protecting digital data, especially digital images, from unauthorized access and malicious activities is crucial in today's digital era. This paper introduces a novel approach to enhance image encryption by combining the strengths of the RSA algorithm, homomorphic encryption, and chaotic maps, specifically the sine and logistic map, alongside the self-similar properties of the fractal Sierpinski triangle. The proposed fractal-based hybrid cryptosystem leverages Paillier encryption for maintaining security and privacy, while the chaotic maps introduce randomness, periodicity, and robustness. Simultaneously, the fractal Sierpinski triangle generates intricate shapes at different scales, resulting in a substantially expanded key space and heightened sensitivity through randomly selected initial points. The secret keys derived from the chaotic maps and Sierpinski triangle are employed for image encryption. The proposed scheme offers simplicity, efficiency, and robust security, effectively safeguarding against statistical, differential, and brute-force attacks. Through comprehensive experimental evaluations, we demonstrate the superior performance of the proposed scheme compared to existing methods in terms of both security and efficiency. This paper makes a significant contribution to the field of digital image encryption, paving the way for further exploration and optimization in the future. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

Quantum computation offers unique properties that cannot be paralleled by conventional computers. In particular, reading 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. [ABSTRACT FROM AUTHOR]

Three-phase asynchronous motors have a wide range of applications in the machinery industry and fault diagnosis aids in the healthy operation of a motor. In order to improve the accuracy and generalization of fault diagnosis in three-phase asynchronous motors, this paper proposes a three-phase asynchronous motor fault diagnosis method based on the combination of multiscale Weibull dispersive entropy (WB-MDE) and particle swarm optimization–support vector machine (PSO-SVM). Firstly, the Weibull distribution (WB) is used to linearize and smooth the vibration signals to obtain sharper information about the motor state. Secondly, the quantitative features of the regularity and orderliness of a given sequence are extracted using multiscale dispersion entropy (MDE). Then, a support vector machine (SVM) is used to construct a classifier, the parameters are optimized via the particle swarm optimization (PSO) algorithm, and the extracted feature vectors are fed into the optimized SVM model for classification and recognition. Finally, the accuracy and generalization of the model proposed in this paper are tested by adding raw data with Gaussian white noise with different signal-to-noise ratios and the CHIST-ERA SOON public dataset. This paper builds a three-phase asynchronous motor vibration signal experimental platform, through a piezoelectric acceleration sensor to discern the four states of the motor data, to verify the effectiveness of the proposed method. The accuracy of the collected data using the WB-MDE method proposed in this paper for feature extraction and the extracted features using the optimization of the PSO-SVM method for fault classification and identification is 100%. Additionally, the proposed model is tested for noise resistance and generalization. Finally, the superiority of the present method is verified through experiments as well as noise immunity and generalization tests. [ABSTRACT FROM AUTHOR]

In this paper, we present the derivation of Jeffreys divergence, generalized Fisher divergence, and the corresponding De Bruijn identities for space–time random field. First, we establish the connection between Jeffreys divergence and generalized Fisher information of a single space–time random field with respect to time and space variables. Furthermore, we obtain the Jeffreys divergence between two space–time random fields obtained by different parameters under the same Fokker–Planck equations. Then, the identities between the partial derivatives of the Jeffreys divergence with respect to space–time variables and the generalized Fisher divergence are found, also known as the De Bruijn identities. Later, at the end of the paper, we present three examples of the Fokker–Planck equations on space–time random fields, identify their density functions, and derive the Jeffreys divergence, generalized Fisher information, generalized Fisher divergence, and their corresponding De Bruijn identities. [ABSTRACT FROM AUTHOR]