Search

We deal with absolutely continuous probability distributions with finite all-positive integer-order moments. It is well known that any such distribution is either uniquely determined by its moments (M-determinate), or it is non-unique (M-indeterminate). In this paper, we follow the maximum entropy approach and establish a new criterion for the M-indeterminacy of distributions on the positive half-line (Stieltjes case). Useful corollaries are derived for M-indeterminate distributions on the whole real line (Hamburger case). We show how the maximum entropy is related to the symmetry property and the M-indeterminacy. [ABSTRACT FROM AUTHOR]

The paper provides a precise error estimate for an asymptotic expansion of a certain stochastic control problem related to relative entropy minimization. In particular, it is shown that the expansion error depends on the regularity of functionals on path space. An efficient numerical scheme based on a weak approximation with Monte Carlo simulation is employed to implement the asymptotic expansion in multidimensional settings. Throughout numerical experiments, it is confirmed that the approximation error of the proposed scheme is consistent with the theoretical rate of convergence. [ABSTRACT FROM AUTHOR]

This paper investigates achieving leader-following consensus in a class of multi-agent systems with nonlinear dynamics. Initially, it introduces a dynamic event-triggered strategy designed to effectively alleviate the strain on the system's communication resources. Subsequently, a distributed control strategy is proposed and implemented in the nonlinear leader-follower system using the dynamic event-triggered mechanism, aiming to ensure synchronization across all nodes at an exponential convergence speed. Thirdly, the research shows that under the dynamic event-triggered strategy the minimum event interval of any two consecutive triggers guarantees the elimination of Zeno behavior. Lastly, the validity of the calculation results is verified by a simulation example. [ABSTRACT FROM AUTHOR]

Emergence and causality are two fundamental concepts for understanding complex systems. They are interconnected. On one hand, emergence refers to the phenomenon where macroscopic properties cannot be solely attributed to the cause of individual properties. On the other hand, causality can exhibit emergence, meaning that new causal laws may arise as we increase the level of abstraction. Causal emergence (CE) theory aims to bridge these two concepts and even employs measures of causality to quantify emergence. This paper provides a comprehensive review of recent advancements in quantitative theories and applications of CE. It focuses on two primary challenges: quantifying CE and identifying it from data. The latter task requires the integration of machine learning and neural network techniques, establishing a significant link between causal emergence and machine learning. We highlight two problem categories: CE with machine learning and CE for machine learning, both of which emphasize the crucial role of effective information (EI) as a measure of causal emergence. The final section of this review explores potential applications and provides insights into future perspectives. [ABSTRACT FROM AUTHOR]

Despite their remarkable performance, deep learning models still lack robustness guarantees, particularly in the presence of adversarial examples. This significant vulnerability raises concerns about their trustworthiness and hinders their deployment in critical domains that require certified levels of robustness. In this paper, we introduce an information geometric framework to establish precise robustness criteria for l 2 white-box attacks in a multi-class classification setting. We endow the output space with the Fisher information metric and derive criteria on the input–output Jacobian to ensure robustness. We show that model robustness can be achieved by constraining the model to be partially isometric around the training points. We evaluate our approach using MNIST and CIFAR-10 datasets against adversarial attacks, revealing its substantial improvements over defensive distillation and Jacobian regularization for medium-sized perturbations and its superior robustness performance to adversarial training for large perturbations, all while maintaining the desired accuracy. [ABSTRACT FROM AUTHOR]

In recent years, semantic communication has received significant attention from both academia and industry, driven by the growing demands for ultra-low latency and high-throughput capabilities in emerging intelligent services. Nonetheless, a comprehensive and effective theoretical framework for semantic communication has yet to be established. In particular, finding the fundamental limits of semantic communication, exploring the capabilities of semantic-aware networks, or utilizing theoretical guidance for deep learning in semantic communication are very important yet still unresolved issues. In general, the mathematical theory of semantic communication and the mathematical representation of semantics are referred to as semantic information theory. In this paper, we introduce the pertinent advancements in semantic information theory. Grounded in the foundational work of Claude Shannon, we present the latest developments in semantic entropy, semantic rate-distortion, and semantic channel capacity. Additionally, we analyze some open problems in semantic information measurement and semantic coding, providing a theoretical basis for the design of a semantic communication system. Furthermore, we carefully review several mathematical theories and tools and evaluate their applicability in the context of semantic communication. Finally, we shed light on the challenges encountered in both semantic communication and semantic information theory. [ABSTRACT FROM AUTHOR]

Misinformation has posed significant threats to all aspects of people's lives. One of the most active areas of research in misinformation examines how individuals are misinformed. In this paper, we study how and to what extent agents are misinformed in an extended bounded confidence model, which consists of three parts: (i) online selective neighbors whose opinions differ from their own but not by more than a certain confidence level; (ii) offline neighbors, in a Watts–Strogatz small-world network, whom an agent has to communicate with even though their opinions are far different from their own; and (iii) a Bayesian analysis. Furthermore, we introduce two types of epistemically irresponsible agents: agents who hide their honest opinions and focus on disseminating misinformation and agents who ignore the messages received and follow the crowd mindlessly. Simulations show that, in an environment with only online selective neighbors, the misinforming is more successful with broader confidence intervals. Having offline neighbors contributes to being cautious of misinformation, while employing a Bayesian analysis helps in discovering the truth. Moreover, the agents who are only willing to listen to the majority, regardless of the truth, unwittingly help to bring about the success of misinformation attempts, and they themselves are, of course, misled to a greater extent. [ABSTRACT FROM AUTHOR]

The profound impacts of severe air pollution on human health, ecological balance, and economic stability are undeniable. Precise air quality forecasting stands as a crucial necessity, enabling governmental bodies and vulnerable communities to proactively take essential measures to reduce exposure to detrimental pollutants. Previous research has primarily focused on predicting air quality using only time-series data. However, the importance of remote-sensing image data has received limited attention. This paper proposes a new multi-modal deep-learning model, Res-GCN, which integrates high spatial resolution remote-sensing images and time-series air quality data from multiple stations to forecast future air quality. Res-GCN employs two deep-learning networks, one utilizing the residual network to extract hidden visual information from remote-sensing images, and another using a dynamic spatio-temporal graph convolution network to capture spatio-temporal information from time-series data. By extracting features from two different modalities, improved predictive performance can be achieved. To demonstrate the effectiveness of the proposed model, experiments were conducted on two real-world datasets. The results show that the Res-GCN model effectively extracts multi-modal features, significantly enhancing the accuracy of multi-step predictions. Compared to the best-performing baseline model, the multi-step prediction's mean absolute error, root mean square error, and mean absolute percentage error increased by approximately 6%, 7%, and 7%, respectively. [ABSTRACT FROM AUTHOR]

Evaluating the capabilities of a satellite communication system (SCS) is challenging due to its complexity and ambiguity. It is difficult to accurately analyze uncertain situations, making it difficult for experts to determine appropriate evaluation values. To address this problem, this paper proposes an innovative approach by extending the Dempster-Shafer evidence theory (DST) to the probabilistic hesitant fuzzy evidence theory (PHFET). The proposed approach introduces the concept of probabilistic hesitant fuzzy basic probability assignment (PHFBPA) to measure the degree of support for propositions, along with a combination rule and decision approach. Two methods are developed to generate PHFBPA based on multi-classifier and distance techniques, respectively. In order to improve the consistency of evidence, discounting factors are proposed using an entropy measure and the Jousselme distance of PHFBPA. In addition, a model for evaluating the degree of satisfaction of SCS capability requirements based on PHFET is presented. Experimental classification and evaluation of SCS capability requirements are performed to demonstrate the effectiveness and stability of the PHFET method. By employing the DST framework and probabilistic hesitant fuzzy sets, PHFET provides a compelling solution for handling ambiguous data in multi-source information fusion, thereby improving the evaluation of SCS capabilities. [ABSTRACT FROM AUTHOR]

The ability to learn continuously is crucial for a robot to achieve a high level of intelligence and autonomy. In this paper, we consider continual reinforcement learning (RL) for quadruped robots, which includes the ability to continuously learn sub-sequential tasks (plasticity) and maintain performance on previous tasks (stability). The policy obtained by the proposed method enables robots to learn multiple tasks sequentially, while overcoming both catastrophic forgetting and loss of plasticity. At the same time, it achieves the above goals with as little modification to the original RL learning process as possible. The proposed method uses the Piggyback algorithm to select protected parameters for each task, and reinitializes the unused parameters to increase plasticity. Meanwhile, we encourage the policy network exploring by encouraging the entropy of the soft network of the policy network. Our experiments show that traditional continual learning algorithms cannot perform well on robot locomotion problems, and our algorithm is more stable and less disruptive to the RL training progress. Several robot locomotion experiments validate the effectiveness of our method. [ABSTRACT FROM AUTHOR]

Large-scale and high-dimensional time series data are widely generated in modern applications such as intelligent transportation and environmental monitoring. However, such data contains much noise, outliers, and missing values due to interference during measurement or transmission. Directly forecasting such types of data (i.e., anomalous data) can be extremely challenging. The traditional method to deal with anomalies is to cut out the time series with anomalous value entries or replace the data. Both methods may lose important knowledge from the original data. In this paper, we propose a multidimensional time series forecasting framework that can better handle anomalous values: the robust temporal nonnegative matrix factorization forecasting model (RTNMFFM) for multi-dimensional time series. RTNMFFM integrates the autoregressive regularizer into nonnegative matrix factorization (NMF) with the application of the L 2 , 1 norm in NMF. This approach improves robustness and alleviates overfitting compared to standard methods. In addition, to improve the accuracy of model forecasts on severely missing data, we propose a periodic smoothing penalty that keeps the sparse time slices as close as possible to the time slice with high confidence. Finally, we train the model using the alternating gradient descent algorithm. Numerous experiments demonstrate that RTNMFFM provides better robustness and better prediction accuracy. [ABSTRACT FROM AUTHOR]

Robust evidence suggests that humans explore their environment using a combination of topological landmarks and coarse-grained path integration. This approach relies on identifiable environmental features (topological landmarks) in tandem with estimations of distance and direction (coarse-grained path integration) to construct cognitive maps of the surroundings. This cognitive map is believed to exhibit a hierarchical structure, allowing efficient planning when solving complex navigation tasks. Inspired by human behaviour, this paper presents a scalable hierarchical active inference model for autonomous navigation, exploration, and goal-oriented behaviour. The model uses visual observation and motion perception to combine curiosity-driven exploration with goal-oriented behaviour. Motion is planned using different levels of reasoning, i.e., from context to place to motion. This allows for efficient navigation in new spaces and rapid progress toward a target. By incorporating these human navigational strategies and their hierarchical representation of the environment, this model proposes a new solution for autonomous navigation and exploration. The approach is validated through simulations in a mini-grid environment. [ABSTRACT FROM AUTHOR]

Entropy estimation is a fundamental problem in information theory that has applications in various fields, including physics, biology, and computer science. Estimating the entropy of discrete sequences can be challenging due to limited data and the lack of unbiased estimators. Most existing entropy estimators are designed for sequences of independent events and their performances vary depending on the system being studied and the available data size. In this work, we compare different entropy estimators and their performance when applied to Markovian sequences. Specifically, we analyze both binary Markovian sequences and Markovian systems in the undersampled regime. We calculate the bias, standard deviation, and mean squared error for some of the most widely employed estimators. We discuss the limitations of entropy estimation as a function of the transition probabilities of the Markov processes and the sample size. Overall, this paper provides a comprehensive comparison of entropy estimators and their performance in estimating entropy for systems with memory, which can be useful for researchers and practitioners in various fields. [ABSTRACT FROM AUTHOR]

Quantum secure multi-party summation (QSMS) is a fundamental problem in quantum secure multi-party computation (QSMC), wherein multiple parties compute the sum of their data without revealing them. This paper proposes a novel QSMS protocol based on graph state, which offers enhanced security, usability, and flexibility compared to existing methods. The protocol leverages the structural advantages of graph state and employs random graph state structures and random encryption gate operations to provide stronger security. Additionally, the stabilizer of the graph state is utilized to detect eavesdroppers and channel noise without the need for decoy bits. The protocol allows for the arbitrary addition and deletion of participants, enabling greater flexibility. Experimental verification is conducted to demonstrate the security, effectiveness, and practicality of the proposed protocols. The correctness and security of the protocols are formally proven. The QSMS method based on graph state introduces new opportunities for QSMC. It highlights the potential of leveraging quantum graph state technology to securely and efficiently solve various multi-party computation problems. [ABSTRACT FROM AUTHOR]

It is known that Kaniadakis entropy, a generalization of the Shannon–Boltzmann–Gibbs entropic form, is always super-additive for any bipartite statistically independent distributions. In this paper, we show that when imposing a suitable constraint, there exist classes of maximal entropy distributions labeled by a positive real number ℵ > 0 that makes Kaniadakis entropy multi-additive, i.e., S κ [ p A ∪ B ] = (1 + ℵ) S κ [ p A ] + S κ [ p B ] , under the composition of two statistically independent and identically distributed distributions p A ∪ B (x , y) = p A (x) p B (y) , with reduced distributions p A (x) and p B (y) belonging to the same class. [ABSTRACT FROM AUTHOR]

The identity-based encryption with equality test (IBEET) has become a hot research topic in cloud computing as it provides an equality test for ciphertexts generated under different identities while preserving the confidentiality. Subsequently, for the sake of the confidentiality and authenticity of the data, the identity-based signcryption with equality test (IBSC-ET) has been put forward. Nevertheless, the existing schemes do not consider the anonymity of the sender and the receiver, which leads to the potential leakage of sensitive personal information. How to ensure confidentiality, authenticity, and anonymity in the IBEET setting remains a significant challenge. In this paper, we put forward the concept of the identity-based matchmaking encryption with equality test (IBME-ET) to address this issue. We formalized the system model, the definition, and the security models of the IBME-ET and, then, put forward a concrete scheme. Furthermore, our scheme was confirmed to be secure and practical by proving its security and evaluating its performance. [ABSTRACT FROM AUTHOR]

Errors are common issues in quantum computing platforms, among which leakage is one of the most-challenging to address. This is because leakage, i.e., the loss of information stored in the computational subspace to undesired subspaces in a larger Hilbert space, is more difficult to detect and correct than errors that preserve the computational subspace. As a result, leakage presents a significant obstacle to the development of fault-tolerant quantum computation. In this paper, we propose an efficient and accurate benchmarking framework called leakage randomized benchmarking (LRB), for measuring leakage rates on multi-qubit quantum systems. Our approach is more insensitive to state preparation and measurement (SPAM) noise than existing leakage benchmarking protocols, requires fewer assumptions about the gate set itself, and can be used to benchmark multi-qubit leakages, which has not been achieved previously. We also extended the LRB protocol to an interleaved variant called interleaved LRB (iLRB), which can benchmark the average leakage rate of generic n-site quantum gates with reasonable noise assumptions. We demonstrate the iLRB protocol on benchmarking generic two-qubit gates realized using flux tuning and analyzed the behavior of iLRB under corresponding leakage models. Our numerical experiments showed good agreement with the theoretical estimations, indicating the feasibility of both the LRB and iLRB protocols. [ABSTRACT FROM AUTHOR]

This paper presents an adaptive learning structure based on neural networks (NNs) to solve the optimal robust control problem for nonlinear continuous-time systems with unknown dynamics and disturbances. First, a system identifier is introduced to approximate the unknown system matrices and disturbances with the help of NNs and parameter estimation techniques. To obtain the optimal solution of the optimal robust control problem, a critic learning control structure is proposed to compute the approximate controller. Unlike existing identifier-critic NNs learning control methods, novel adaptive tuning laws based on Kreisselmeier's regressor extension and mixing technique are designed to estimate the unknown parameters of the two NNs under relaxed persistence of excitation conditions. Furthermore, theoretical analysis is also given to prove the significant relaxation of the proposed convergence conditions. Finally, effectiveness of the proposed learning approach is demonstrated via a simulation study. [ABSTRACT FROM AUTHOR]

A quantum game is constructed from a sequence of independent and identically polarised spin-1/2 particles. Information about their possible polarisation is provided to a bettor, who can wager in successive double-or-nothing games on measurement outcomes. The choice at each stage is how much to bet and in which direction to measure the individual particles. The portfolio's growth rate rises as the measurements are progressively adjusted in response to the accumulated information. Wealth is amassed through astute betting. The optimal classical strategy is called the Kelly criterion and plays a fundamental role in portfolio theory and consequently quantitative finance. The optimal quantum strategy is determined numerically and shown to differ from the classical strategy. This paper contributes to the development of quantum finance, as aspects of portfolio optimisation are extended to the quantum realm. Intriguing trade-offs between information gain and portfolio growth are described. [ABSTRACT FROM AUTHOR]

The fifth-generation (5G) mobile cellular network is vulnerable to various security threats. Radio frequency fingerprint (RFF) identification is an emerging physical layer authentication technique which can be used to detect spoofing and distributed denial of service attacks. In this paper, the performance of RFF identification is studied for 5G mobile phones. The differential constellation trace figure (DCTF) is extracted from the physical random access channel (PRACH) preamble. When the database of all 64 PRACH preambles is available at the gNodeB (gNB), an index-based DCTF identification scheme is proposed, and the classification accuracy reaches 92.78% with a signal-to-noise ratio of 25 dB. Moreover, due to the randomness in the selection of preamble sequences in the random access procedure, when only a portion of the preamble sequences can be trained, a group-based DCTF identification scheme is proposed. The preamble sequences generated from the same root value are grouped together, and the untrained sequences can be identified based on the trained sequences within the same group. The classification accuracy of the group-based scheme is 89.59%. An experimental system has been set up using six 5G mobile phones of three models. The 5G gNB is implemented on the OpenAirInterface platform. [ABSTRACT FROM AUTHOR]

Parameter estimation is an important component of statistical inference, and how to improve the accuracy of parameter estimation is a key issue in research. This paper proposes a linear Bayesian estimation for estimating parameters in a misrecorded Poisson distribution. The linear Bayesian estimation method not only adopts prior information but also avoids the cumbersome calculation of posterior expectations. On the premise of ensuring the accuracy and stability of computational results, we derived the explicit solution of the linear Bayesian estimation. Its superiority was verified through numerical simulations and illustrative examples. [ABSTRACT FROM AUTHOR]

Image stitching aims to synthesize a wider and more informative whole image, which has been widely used in various fields. This study focuses on improving the accuracy of image mosaic and proposes an image mosaic method based on local edge contour matching constraints. Because the accuracy and quantity of feature matching have a direct influence on the stitching result, it often leads to wrong image warpage model estimation when feature points are difficult to detect and match errors are easy to occur. To address this issue, the geometric invariance is used to expand the number of feature matching points, thus enriching the matching information. Based on Canny edge detection, significant local edge contour features are constructed through operations such as structure separation and edge contour merging to improve the image registration effect. The method also introduces the spatial variation warping method to ensure the local alignment of the overlapping area, maintains the line structure in the image without bending by the constraints of short and long lines, and eliminates the distortion of the non-overlapping area by the global line-guided warping method. The method proposed in this paper is compared with other research through experimental comparisons on multiple datasets, and excellent stitching results are obtained. [ABSTRACT FROM AUTHOR]

This paper aims to contribute to refining the e-values for testing precise hypotheses, especially when dealing with nuisance parameters, leveraging the effectiveness of asymptotic expansions of the posterior. The proposed approach offers the advantage of bypassing the need for elicitation of priors and reference functions for the nuisance parameters and the multidimensional integration step. For this purpose, starting from a Laplace approximation, a posterior distribution for the parameter of interest is only considered and then a suitable objective matching prior is introduced, ensuring that the posterior mode aligns with an equivariant frequentist estimator. Consequently, both Highest Probability Density credible sets and the e-value remain invariant. Some targeted and challenging examples are discussed. [ABSTRACT FROM AUTHOR]

In this investigation, a synthesis of Convolutional Neural Networks (CNNs) and Bayesian inference is presented, leading to a novel approach to the problem of Multiple Hypothesis Testing (MHT). Diverging from traditional paradigms, this study introduces a sequence-based uncalibrated Bayes factor approach to test many hypotheses using the same family of sampling parametric models. A two-step methodology is employed: initially, a learning phase is conducted utilizing simulated datasets encompassing a wide spectrum of null and alternative hypotheses, followed by a transfer phase applying this fitted model to real-world experimental sequences. The outcome is a CNN model capable of navigating the complex domain of MHT with improved precision over traditional methods, also demonstrating robustness under varying conditions, including the number of true nulls and dependencies between tests. Although indications of empirical evaluations are presented and show that the methodology will prove useful, more work is required to provide a full evaluation from a theoretical perspective. The potential of this innovative approach is further illustrated within the critical domain of genomics. Although formal proof of the consistency of the model remains elusive due to the inherent complexity of the algorithms, this paper also provides some theoretical insights and advocates for continued exploration of this methodology. [ABSTRACT FROM AUTHOR]

Image fusion is the generation of an informative image that contains complementary information from the original sensor images, such as texture details and attentional targets. Existing methods have designed a variety of feature extraction algorithms and fusion strategies to achieve image fusion. However, these methods ignore the extraction of common features in the original multi-source images. The point of view proposed in this paper is that image fusion is to retain, as much as possible, the useful shared features and complementary differential features of the original multi-source images. Shared and differential learning methods for infrared and visible light image fusion are proposed. An encoder with shared weights is used to extract shared common features contained in infrared and visible light images, and the other two encoder blocks are used to extract differential features of infrared images and visible light images, respectively. Effective learning of shared and differential features is achieved through weight sharing and loss functions. Then, the fusion of shared features and differential features is achieved via a weighted fusion strategy based on an entropy-weighted attention mechanism. The experimental results demonstrate the effectiveness of the proposed model with its algorithm. Compared with the-state-of-the-art methods, the significant advantage of the proposed method is that it retains the structural information of the original image and has better fusion accuracy and visual perception effect. [ABSTRACT FROM AUTHOR]

This paper analyzes the temporal evolution of streamflow for different rivers in Argentina based on information quantifiers such as statistical complexity and permutation entropy. The main objective is to identify key details of the dynamics of the analyzed time series to differentiate the degrees of randomness and chaos. The permutation entropy is used with the probability distribution of ordinal patterns and the Jensen–Shannon divergence to calculate the disequilibrium and the statistical complexity. Daily streamflow series at different river stations were analyzed to classify the different hydrological systems. The complexity-entropy causality plane (CECP) and the representation of the Shannon entropy and Fisher information measure (FIM) show that the daily discharge series could be approximately represented with Gaussian noise, but the variances highlight the difficulty of modeling a series of natural phenomena. An analysis of stations downstream from the Yacyretá dam shows that the operation affects the randomness of the daily discharge series at hydrometric stations near the dam. When the station is further downstream, however, this effect is attenuated. Furthermore, the size of the basin plays a relevant role in modulating the process. Large catchments have smaller values for entropy, and the signal is less noisy due to integration over larger time scales. In contrast, small and mountainous basins present a rapid response that influences the behavior of daily discharge while presenting a higher entropy and lower complexity. The results obtained in the present study characterize the behavior of the daily discharge series in Argentine rivers and provide key information for hydrological modeling. [ABSTRACT FROM AUTHOR]

This paper presents a coding scheme based on bilayer low-density parity-check (LDPC) codes for multi-level cell (MLC) NAND flash memory. The main feature of the proposed scheme is that it exploits the asymmetric properties of an MLC flash channel and stores the extra parity-check bits in the lower page, which are activated only after the decoding failure of the upper page. To further improve the performance of the error correction, a perturbation process based on the genetic algorithm (GA) is incorporated into the decoding process of the proposed coding scheme, which can convert uncorrectable read sequences into error-correctable regions of the corresponding decoding space by introducing GA-trained noises. The perturbation decoding process is particularly efficient at low program-and-erase (P/E) cycle regions. The simulation results suggest that the proposed bilayer LDPC coding scheme can extend the lifetime of MLC NAND flash memory up to 10,000 P/E cycles. The proposed scheme can achieve a better balance between performance and complexity than traditional single LDPC coding schemes. All of these findings indicate that the proposed coding scheme is suitable for practical purposes in MLC NAND flash memory. [ABSTRACT FROM AUTHOR]

In this paper, a unified gas kinetic particle (UGKP) method is developed for radiative transfer in both absorbing and anisotropic scattering media. This numerical method is constructed based on our theoretical work on the model reduction for an anisotropic scattering system. The macroscopic solver of this method directly solves the macroscopic anisotropic diffusion equations, eliminating the need to solve higher-order moment equations. The reconstruction of macroscopic scattering source in the microscopic solver, based on the multiscale equivalent phase function we proposed in this work, has also been simplified as one single scattering process, significantly reducing the computational costs. The proposed method has also the property of asymptotic preserving. In the optically thick regime, the proposed method solves the diffusion limit equations for an anisotropic system. In the optically thin regime, the kinetic processes of photon transport are simulated. The consistency and efficiency of the proposed method have been validated by numerical tests in a wide range of flow regimes. The novel equivalent scattering source reconstruction can be used for various transport processes, and the proposed numerical scheme is widely applicable in high-energy density engineering applications. [ABSTRACT FROM AUTHOR]

The detection of instability inception is favorable to avoid compressor instability. In this paper, a multiscale entropy-based feature extraction is developed for the detection of the instability inception in axial compressors. Nonlinear and statistical features of the short-time instability inception are extracted by generally combining multiscale entropy and statistical features. First, nonlinear features are extracted by refined composite multiscale entropy to avoid the inaccurate estimation or undefined entropy of multiscale entropy for short time series. Second, the time-domain-based statistical features are chosen to capture more information on instability inception, and the dominant statistical features are determined by random forests implemented with the mean decrease accuracy algorithm at each time scale. The obtained refined composite dominant statistical features are regarded as weighting factors and integrated with the refined composite multiscale entropy to generate a combined feature. Finally, numerical simulation results on two synthetic noise datasets and a compressor instability model dataset are presented to demonstrate the effectiveness, efficiency, and robustness of the combined features under different conditions. [ABSTRACT FROM AUTHOR]

This paper introduces the notion of multi-sensitivity with respect to a vector within the context of non-autonomous dynamical systems on uniform spaces and provides insightful results regarding  N -sensitivity and strongly multi-sensitivity, along with their behaviors under various conditions. The main results established are as follows: (1) For a k-periodic nonautonomous dynamical system on a Hausdorff uniform space  (S , U) , the system  (S , f k ∘ ⋯ ∘ f 1)  exhibits  N -sensitivity (or strongly multi-sensitivity) if and only if the system  (S , f 1 , ∞)  displays  N -sensitivity (or strongly multi-sensitivity). (2) Consider a finitely generated family of surjective maps on uniform space  (S , U) . If the system  (S , f 1 , ∞)  is  N -sensitive, then the system  (S , f k , ∞)  is also  N -sensitive. When the family  f 1 , ∞  is feebly open, the converse statement holds true as well. (3) Within a finitely generated family on uniform space  (S , U) ,  N -sensitivity (and strongly multi-sensitivity) persists under iteration. (4) We present a sufficient condition under which an nonautonomous dynamical system on infinite Hausdorff uniform space demonstrates  N -sensitivity. [ABSTRACT FROM AUTHOR]

The emerging cloud storage technology has significantly improved efficiency and productivity in the traditional electronic healthcare field. However, it has also brought about many security concerns. Ciphertext policy attribute-based encryption (CP-ABE) holds immense potential in achieving fine-grained access control, providing robust security for electronic healthcare data in the cloud. However, current CP-ABE schemes still face issues such as inflexible attribute revocation, relatively lower computational capabilities, and key management. To address these issues, this paper introduces a revocable and traceable undeniable ciphertext policy attribute-based encryption scheme (MA-RUABE). MA-RUABE not only enables fast and accurate data traceability, effectively preventing malicious user key leakage, but also includes a direct revocation feature, significantly enhancing computational efficiency. Furthermore, the introduction of a multi-permission mechanism resolves the issue of centralization of power caused by single-attribute permissions. Furthermore, a security analysis demonstrates that our system ensures resilience against chosen plaintext attacks. Experimental results demonstrate that MA-RUABE incurs lower computational overhead, effectively enhancing system performance and ensuring data-sharing security in cloud-based electronic healthcare systems. [ABSTRACT FROM AUTHOR]

Alarm systems are commonly deployed in complex industries to monitor the operation status of the production process in real time. Actual alarm systems generally have alarm overloading problems. One of the major factors leading to excessive alarms is the presence of many correlated or redundant alarms. Analyzing alarm correlations will not only be beneficial to the detection of and reduction in redundant alarm configurations, but also help to track the propagation of abnormalities among alarm variables. As a special problem in correlated alarm detection, the research on first-out alarm detection is very scarce. A first-out alarm is known as the first alarm that occurs in a series of alarms. Detection of first-out alarms aims at identifying the first alarm occurrence from a large number of alarms, thus ignoring the subsequent correlated alarms to effectively reduce the number of alarms and prevent alarm overloading. Accordingly, this paper proposes a new first-out alarm detection method based on association rule mining and correlation analysis. The contributions lie in the following aspects: (1) An association rule mining approach is presented to extract alarm association rules from historical sequences based on the FP-Growth algorithm and J-Measure; (2) a first-out alarm determination strategy is proposed to determine the first-out alarms and subsequent alarms through correlation analysis in the form of a hypothesis test on conditional probability; and (3) first-out rule screening criteria are proposed to judge whether the rules are redundant or not and then consolidated results of first-out rules are obtained. The effectiveness of the proposed method is tested based on the alarm data generated by a public simulation platform. [ABSTRACT FROM AUTHOR]

This paper investigates the complex dynamics of a ratio-dependent predator–prey model incorporating the Allee effect in prey and predator harvesting. To explore the joint effect of the harvesting effort and diffusion on the dynamics of the system, we perform the following analyses: (a) The stability of non-negative constant steady states; (b) The sufficient conditions for the occurrence of a Hopf bifurcation, Turing bifurcation, and Turing–Hopf bifurcation; (c) The derivation of the normal form near the Turing–Hopf singularity. Moreover, we provide numerical simulations to illustrate the theoretical results. The results demonstrate that the small change in harvesting effort and the ratio of the diffusion coefficients will destabilize the constant steady states and lead to the complex spatiotemporal behaviors, including homogeneous and inhomogeneous periodic solutions and nonconstant steady states. Moreover, the numerical simulations coincide with our theoretical results. [ABSTRACT FROM AUTHOR]

Question matching is the fundamental task in retrieval-based dialogue systems which assesses the similarity between Query and Question. Unfortunately, existing methods focus on improving the accuracy of text similarity in the general domain, without adaptation to the financial domain. Financial question matching has two critical issues: (1) How to accurately model the contextual representation of a financial sentence? (2) How to accurately represent financial key phrases in an utterance? To address these issues, this paper proposes a novel Financial Knowledge Enhanced Network (FinKENet) that significantly injects financial knowledge into contextual text. Specifically, we propose a multi-level encoder to extract both sentence-level features and financial phrase-level features, which can more accurately represent sentences and financial phrases. Furthermore, we propose a financial co-attention adapter to combine sentence features and financial keyword features. Finally, we design a multi-level similarity decoder to calculate the similarity between queries and questions. In addition, a cross-entropy-based loss function is presented for model optimization. Experimental results demonstrate the effectiveness of the proposed method on the Ant Financial question matching dataset. In particular, the Recall score improves from 73.21% to 74.90% (1.69% absolute). [ABSTRACT FROM AUTHOR]

The violation of a Leggett–Garg inequality confirms the incompatibility between quantum mechanics and the combined premises (called macro-realism) of macroscopic realism (MR) and noninvasive measurability (NIM). Arguments can be given that the incompatibility arises because MR fails for systems in a superposition of macroscopically distinct states—or else, that NIM fails. In this paper, we consider a strong negation of macro-realism, involving superpositions of coherent states, where the NIM premise is replaced by Bell's locality premise. We follow recent work and propose the validity of a subset of Einstein–Podolsky–Rosen (EPR) and Leggett–Garg premises, referred to as weak macroscopic realism (wMR). In finding consistency with wMR, we identify that the Leggett–Garg inequalities are violated because of failure of both MR and NIM, but also that both are valid in a weaker (less restrictive) sense. Weak MR is distinguished from deterministic macroscopic realism (dMR) by recognizing that a measurement involves a reversible unitary interaction that establishes the measurement setting. Weak MR posits that a predetermined value for the outcome of a measurement can be attributed to the system after the interaction, when the measurement setting is experimentally specified. An extended definition of wMR considers the "element of reality" defined by EPR for system A, where one can predict with certainty the outcome of a measurement on A by performing a measurement on system B. Weak MR posits that this element of reality exists once the unitary interaction determining the measurement setting at B has occurred. We demonstrate compatibility of systems violating Leggett–Garg inequalities with wMR but point out that dMR has been shown to be falsifiable. Other tests of wMR are proposed, the predictions of wMR agreeing with quantum mechanics. Finally, we compare wMR with macro-realism models discussed elsewhere. An argument in favour of wMR is presented: wMR resolves a potential contradiction pointed out by Leggett and Garg between failure of macro-realism and assumptions intrinsic to quantum measurement theory. [ABSTRACT FROM AUTHOR]

Malicious attacks can cause significant damage to the structure and functionality of complex networks. Previous research has pointed out that the ability of networks to withstand malicious attacks becomes weaker when networks are coupled. However, traditional research on improving the robustness of networks has focused on individual low-order or higher-order networks, lacking studies on coupled networks with higher-order and low-order networks. This paper proposes a method for optimizing the robustness of coupled networks with higher-order and low-order based on a simulated annealing algorithm to address this issue. Without altering the network's degree distribution, the method rewires the edges, taking the robustness of low-order and higher-order networks as joint optimization objectives. Making minimal changes to the network, the method effectively enhances the robustness of coupled networks. Experiments were conducted on Erdős–Rényi random networks (ER), scale-free networks (BA), and small-world networks (SW). Finally, validation was performed on various real networks. The results indicate that this method can effectively enhance the robustness of coupled networks with higher-order and low-order. [ABSTRACT FROM AUTHOR]

In response to the challenge of overfitting, which may lead to a decline in network generalization performance, this paper proposes a new regularization technique, called the class-based decorrelation method (CDM). Specifically, this method views the neurons in a specific hidden layer as base learners, and aims to boost network generalization as well as model accuracy by minimizing the correlation among individual base learners while simultaneously maximizing their class-conditional correlation. Intuitively, CDM not only promotes diversity among the hidden neurons, but also enhances their cohesiveness among them when processing samples from the same class. Comparative experiments conducted on various datasets using deep models demonstrate that CDM effectively reduces overfitting and improves classification performance. [ABSTRACT FROM AUTHOR]

Visual scanning is achieved via head motion and gaze movement for visual information acquisition and cognitive processing, which plays a critical role in undertaking common sensorimotor tasks such as driving. The coordination of the head and eyes is an important human behavior to make a key contribution to goal-directed visual scanning and sensorimotor driving. In this paper, we basically investigate the two most common patterns in eye–head coordination: "head motion earlier than eye movement" and "eye movement earlier than head motion". We utilize bidirectional transfer entropies between head motion and eye movements to determine the existence of these two eye–head coordination patterns. Furthermore, we propose a unidirectional information difference to assess which pattern predominates in head–eye coordination. Additionally, we have discovered a significant correlation between the normalized unidirectional information difference and driving performance. This result not only indicates the influence of eye–head coordination on driving behavior from a computational perspective but also validates the practical significance of our approach utilizing transfer entropy for quantifying eye–head coordination. [ABSTRACT FROM AUTHOR]