Entropy最新文献

We present a quantum cognitive model that integrates the influence of cognitive control into human perceptual decision-making. The model employs a multiple-square-well potential, where each well corresponds to a distinct decision outcome. In this framework, well depth encodes signal strength, while well width represents the domain generality of the outcome. The probability of particle localization within each well determines the subjective probability, which subsequently drives a standard Markovian evidence accumulation process to predict empirical choice and response times. We validate the model using the classic dot motion two-alternative forced-choice (2AFC) task. The model successfully replicates key empirical findings of the task, such as the correlation between motion coherence and drift rates. Furthermore, we apply the model to the Yerkes-Dodson law, capturing the approximate inverted U-shaped relationship between task accuracy and cognitive arousal. We compare two theoretical approaches to modeling arousal (1) as eigenenergy values and (2) as kinetic energy terms, contrasting their qualitative predictions regarding the Yerkes-Dodson law. Our work provides the first quantitative model of arousal's influence on human perceptual decision-making and establishes a foundation for determining the exact functional form of the Yerkes-Dodson law.

We consider a generalization of the discrete memoryless channel, in which the channel probability distribution is replaced by a uniform distribution over clouds of channel output sequences. For a random ensemble of such channels, we derive an achievable error exponent, as well as its converse together with the optimal correct-decoding exponent, all as functions of information rate. As a corollary of these results, we obtain the channel ensemble capacity.

In signal processing and information analysis, the detection and identification of anomalies present in signals constitute a critical research focus. Accurately discerning these deviations using probabilistic, statistical, and information-theoretic methods is essential for ensuring data integrity and supporting reliable downstream analysis. Outlier detection in functional data aims to identify curves or trajectories that deviate significantly from the dominant pattern-a process vital for data cleaning and the discovery of anomalous events. This task is challenging due to the intrinsic infinite dimensionality of functional data, where outliers often appear as subtle shape deformations that are difficult to detect. Moving beyond conventional approaches that discretize curves into multivariate vectors, we introduce a novel framework that projects functional data into a low-dimensional space of meaningful features. This is achieved via a tailored weighting scheme designed to preserve essential curve variations. We then incorporate the Mahalanobis distance to detect directional outlyingness under non-Gaussian assumptions through a robustified bootstrap resampling method with data-driven threshold determination. Simulation studies validated its superior performance, demonstrating higher true positive and lower false positive rates across diverse anomaly types, including magnitude, shape-isolated, shape-persistent, and mixed outliers. The practical utility of our approach was further confirmed through applications in environmental monitoring using seawater spectral data, character trajectory analysis, and population data underscoring its cross-domain versatility.

Complex real-world systems are often modeled as heterogeneous information networks with diverse node and relation types, bringing new opportunities and challenges to link prediction. Traditional methods based on similarity or meta-paths fail to fully capture high-order structures and semantics, while existing hypergraph-based models homogenize all high-order information without considering their importance differences, diluting core associations with redundant noise and limiting prediction accuracy. Given these issues, we propose the VE-HGCN, a link prediction model for HINs that fuses hypergraph convolution with soft-voting ensemble strategy. The model first constructs multiple heterogeneous hypergraphs from HINs via network frequent subgraph pattern extraction, then leverages hypergraph convolution for node representation learning, and finally employs a soft-voting ensemble strategy to fuse multi-model prediction results. Extensive experiments on four public HIN datasets show that the VE-HGCN outperforms seven mainstream baseline models, thereby validating the effectiveness of the proposed method. This study offers a new perspective for link prediction in HINs and exhibits good generality and practicality, providing a feasible reference for addressing high-order information utilization issues in complex heterogeneous network analysis.

In this paper, an observer-based proportional-integral-derivative (PID) controller is designed for a class of uncertain nonlinear systems with integral measurements, denial-of-service (DoS) attacks and bounded stochastic noises under a binary encoding scheme (BES). Parameter uncertainty is involved with a norm-bounded multiplicative expression. Integral measurements are considered to reflect the delayed signal collection of sensor. For communication, BES is put into use in the signal transmission process from the sensor to the observer and from the controller to the actuator. Random bit flipping is described that may take place caused by channel noises, whose impact is described by a stochastic noise. Randomly occurring DoS attacks are taken account of that may appear due to the shared network, which block the transmitted signals totally. Three sets of Bernoulli-distributed random variables are adopted to reveal the random occurrence of uncertainties, bit flipping and DoS attacks. The aim of this paper is to design an observer-based PID controller which guarantees that the closed-loop system reaches exponential ultimate boundedness in mean square (EUBMS). By virtue of Lyapunov stability theory, stochastic analysis technique and matrix inequality method, a sufficient condition is developed for designing the observer-based PID controller such that the closed-loop system achieves EUBMS performance, and the ultimate upper bound of the controlled output is bounded and such a bound is minimized. The gain matrices of the observer-based controller are acquired explicitly by virtue of solving the solution to an optimized issue with several matrix inequality constraints. Two simulation examples are given which indicate the usefulness of the proposed control method in this paper adequately.

Trajectory prediction is critical for safe robot navigation, yet standard deep learning models predominantly rely on the Mean Squared Error (MSE) criterion. While effective under ideal conditions, MSE-based optimization is inherently fragile to non-Gaussian impulsive noise-such as sensor glitches and occlusions-common in real-world deployment. To address this limitation, this paper proposes MEE-LSTM, a robust forecasting framework that integrates Long Short-Term Memory networks with the Minimum Error Entropy (MEE) criterion. By minimizing Renyi's quadratic entropy of the prediction error, our loss function introduces an intrinsic "gradient clipping" mechanism that effectively suppresses the influence of outliers. Furthermore, to overcome the convergence challenges of fixed-kernel information theoretic learning, we introduce a Silverman-based Adaptive Annealing (SAA) strategy that dynamically regulates the kernel bandwidth. Extensive evaluations on the ETH and UCY datasets demonstrate that MEE-LSTM maintains competitive accuracy on clean benchmarks while exhibiting superior resilience in degraded sensing environments. Notably, we identify a "Scissor Plot" phenomenon under stress testing: in the presence of 20% impulsive noise, the proposed model maintains a stable Average Displacement Error (ADE "≈" 0.51 m), whereas MSE baselines suffer catastrophic degradation (ADE > 2.1 m), representing a 75.7% improvement in robustness. This work provides a statistically grounded paradigm for reliable causal inference in hostile robotic perception.

Many problems in physics and computer science can be framed in terms of combinatorial optimization. Due to this, it is interesting and important to study theoretical aspects of such optimization. Here, we study connections between Kolmogorov complexity, optima, and optimization. We argue that (1) optima and complexity are connected, with extrema being more likely to have low complexity (under certain circumstances); (2) optimization by sampling candidate solutions according to algorithmic probability may be an effective optimization method; and (3) coincidences in extrema to optimization problems are a priori more likely as compared to a purely random null model.

Context: Code recommendation plays an important role in improving programming efficiency and software quality. Existing approaches mainly focus on method- or API-level recommendations, which limits their effectiveness to local code contexts. From a multi-stage recommendation perspective, class-level code recommendation aims to efficiently narrow a large candidate code space while preserving essential structural information. Objective: This paper proposes RioCC, a class-level code recommendation framework that leverages deep forest-based code clone detection to progressively reduce the candidate space and improve recommendation efficiency in large-scale code spaces. Method: RioCC models the recommendation process as a coarse-to-fine candidate reduction procedure. In the coarse-grained stage, a quick search-based filtering module performs rapid candidate screening and initial similarity estimation, effectively pruning irrelevant candidates and narrowing the search space. In the fine-grained stage, a deep forest-based analysis with cascade learning and multi-grained scanning captures context- and structure-aware representations of class-level code fragments, enabling accurate similarity assessment and recommendation. This two-stage design explicitly separates coarse candidate filtering from detailed semantic matching to balance efficiency and accuracy. Results: Experiments on a large-scale dataset containing 192,000 clone pairs from BigCloneBench and a collected code pool show that RioCC consistently outperforms state-of-the-art methods, including CCLearner, Oreo, and RSharer, across four types of code clones, while significantly accelerating the recommendation process with comparable detection accuracy. Conclusions: By explicitly formulating class-level code recommendation as a staged retrieval and refinement problem, RioCC provides an efficient and scalable solution for large-scale code recommendation and demonstrates the practical value of integrating lightweight filtering with deep forest-based learning.

In the post-pandemic era, student mental health challenges have emerged as a critical issue in higher education. However, conventional assessment approaches often treat at-risk populations as a monolithic entity, thereby limiting intervention effectiveness. This study proposes a novel computational framework that integrates explainable artificial intelligence (XAI) with unsupervised learning to decode the latent heterogeneity of psychological risk mechanisms. We developed a "predict-explain-discover" pipeline leveraging TreeSHAP and Gaussian Mixture Models to identify distinct risk subtypes based on a 2556-dimensional feature space encompassing lexical, linguistic, and affective indicators. Our approach identified three theoretically-grounded subtypes: academically-driven (28.46%), socio-emotional (43.85%), and internal regulatory (27.69%) risks. Sensitivity analysis using top-20 core features further validated the structural stability of these mechanisms, proving that the subtypes are anchored in the model's primary decision drivers rather than high-dimensional noise. The framework demonstrates how black-box classifiers can be transformed into diagnostic tools, bridging the gap between predictive accuracy and mechanistic understanding. Our findings align with the Research Domain Criteria (RDoC) and establish a foundation for precision interventions targeting specific risk drivers. This work advances computational mental health research through methodological innovations in mechanism-based subtyping and practical strategies for personalized student support.

Recent cosmological observational data-such as type Ia supernovae (SNe Ia) [...].