ノ產盽杠弧笵瞶眖腨獀囊癸舧

In recent years, most proposed digital image encryption algorithms have primarily focused on encrypting raw pixel data, often neglecting the integration with image compression techniques. Image compression algorithms, such as JPEG, are widely utilized in internet applications, highlighting the need for encryption methods that are compatible with compression processes. This study introduces an innovative color image encryption algorithm integrated with JPEG compression, designed to enhance the security of images susceptible to attacks or tampering during prolonged transmission. The research addresses critical challenges in achieving an optimal balance between encryption security and compression efficiency. The proposed encryption algorithm is structured around three key compression phases: Discrete Cosine Transform (DCT), quantization, and entropy coding. At each stage, the algorithm incorporates advanced techniques such as block segmentation, block replacement, DC coefficient confusion, non-zero AC coefficient transformation, and RSV (Run/Size and Value) pair recombination. Extensive simulations and security analyses demonstrate that the proposed algorithm exhibits strong robustness against noise interference and data loss, effectively meeting stringent security performance requirements. Full article

Multivariate space–time datasets are often collected at discrete, regularly monitored time intervals and are typically treated as components of time series in environmental science and other applied fields. To effectively characterize such data in geostatistical frameworks, valid and practical covariance models are essential. In this work, we propose several classes of multivariate spatio-temporal covariance matrix functions to model underlying stochastic processes whose discrete temporal margins correspond to well-known autoregressive and moving average (ARMA) models. We derive sufficient and/or necessary conditions under which these functions yield valid covariance matrices. By leveraging established methodologies from time series analysis and spatial statistics, the proposed models are straightforward to identify and fit in practice. Finally, we demonstrate the utility of these multivariate covariance functions through an application to Kansas weather data, using co-kriging for prediction and comparing the results to those obtained from traditional spatio-temporal models. Full article

Quantum state discrimination (QSD) is a fundamental task in quantum information processing, improving the computation efficiency and communication security. Non-Hermitian (NH) PT-symmetric systems were found to be able to discriminate two quantum states better than the Hermitian strategy. In this work, we propose a QSD approach based on P-pseudo-Hermitian systems with real spectra. We theoretically prove the feasibility of realizing QSD in the real-spectrum phase of a P-pseudo-Hermitian system, i.e., two arbitrary non-orthogonal quantum states can be discriminated by a suitable P-pseudo-Hermitian Hamiltonian. In detail, we decide the minimal angular separation between two non-orthogonal quantum states for a fixed P-pseudo-Hermitian Hamiltonian, and we find the orthogonal evolution time is able to approach zero under suitable conditions, while both the trace distance and the quantum relative entropy are employed to judge their orthogonality. We give a criterion to choose the parameters of a P-pseudo-Hermitian Hamiltonian that evolves the two initial orthogonal states faster than a fixed arbitrary PT-symmetric one with an identical energy difference. Our work expands the NH family for QSD, and can be used to explore real quantum systems in the future. Full article

Ashby’s law of requisite variety allows a comparison of systems with their environments, providing a necessary (but not sufficient) condition for system efficacy: A system must possess at least as much complexity as any set of environmental behaviors that require distinct responses from the system. However, to account for the dependence of a system’s complexity on the level of detail—or scale—of its description, a multi-scale generalization of Ashby’s law is needed. We define a class of complexity profiles (complexity as a function of scale) that is the first, to our knowledge, to exhibit a multi-scale law of requisite variety. This formalism provides a characterization of multi-scale complexity and generalizes the law of requisite variety’s single constraint on system behaviors to a class of multi-scale constraints. We show that these complexity profiles satisfy a sum rule, which reflects a tradeoff between smaller- and larger-scale degrees of freedom, and we extend our results to subdivided systems and systems with a continuum of components. Full article

Multimodal sentiment analysis (MSA) benefits from integrating diverse modalities (e.g., text, video, and audio). However, challenges remain in effectively aligning non-text features and mitigating redundant information, which may limit potential performance improvements. To address these challenges, we propose a Hierarchical Text-Guided Refinement Network (HTRN), a novel framework that refines and aligns non-text modalities using hierarchical textual representations. We introduce Shuffle-Insert Fusion (SIF) and the Text-Guided Alignment Layer (TAL) to enhance crossmodal interactions and suppress irrelevant signals. In SIF, empty tokens are inserted at fixed intervals in unimodal feature sequences, disrupting local correlations and promoting more generalized representations with improved feature diversity. The TAL guides the refinement of audio and visual representations by leveraging textual semantics and dynamically adjusting their contributions through learnable gating factors, ensuring that non-text modalities remain semantically coherent while retaining essential crossmodal interactions. Experiments demonstrate that the HTRN achieves state-of-the-art performance with accuracies of 86.3% (Acc-2) on CMU-MOSI, 86.7% (Acc-2) on CMU-MOSEI, and 80.3% (Acc-2) on CH-SIMS, outperforming existing methods by 0.8–3.45%. Ablation studies validate the contributions of SIF and the TAL, showing 1.9–2.1% performance gains over baselines. By integrating these components, the HTRN establishes a robust multimodal representation learning framework. Full article

In this paper, we introduce Kluitenberg’s formulation of non-equilibrium thermodynamics with internal variables in the context of a Riemannian space, as required by Einstein’s general relativity. Using the formulation of the second law of thermodynamics in general coordinates with a pseudo-Euclidean metric, we derive a Levi-Civita-like energy tensor and propose a generalization of the second law within a Riemannian space, in agreement with Tolman’s approach. In addition, we determine the expression for the entropy density in a general Riemannian space and identify the new variables upon which it depends. This allows us to deduce, within this framework, the equilibrium inelastic and viscous stress tensors as well as the entropy production. These expressions are consistent with the principle of general covariance and Einstein’s equivalence principle. Full article

We study in detail the critical points of Bohmian flow, both in the inertial frame of reference (Y-points) and in the frames centered at the moving nodal points of the guiding wavefunction (X-points), and analyze their role in the onset of chaos in a system of two entangled qubits. We find the distances between these critical points and a moving Bohmian particle at varying levels of entanglement, with particular emphasis on the times at which chaos arises. Then, we find why some trajectories are ordered, without any chaos. Finally, we examine numerically how the Lyapunov Characteristic Number (LCN) depends on the degree of quantum entanglement. Our results indicate that increasing entanglement reduces the convergence time of the finite-time LCN of the chaotic trajectories toward its final positive value. Full article

We describe some properties of the hyperbolically symmetric black hole (hereafter referred to as the HSBH) proposed a few years ago. We start by explaining the main motivation behind such an idea, and we determine the main differences between this scenario and the classical black hole (hereafter referred to as the CBH) scenario. Particularly important are the facts that, in the HSBH scenario, (i) test particles in the region inside the horizon experience a repulsive force that prevents them from reaching the center, (ii) test particles may cross the horizon outward only along the symmetry axis, and (iii) the spacetime within the horizon is static but not spherically symmetric. Next, we examine the differences between the two models of black holes in light of the Landauer principle and the Hawking results on the eventual evaporation of the black hole and the paradox resulting thereof. Finally, we explore what observational signature could be invoked to confirm or dismiss the model. Full article

Epilepsy is a prevalent neurological disorder affecting approximately 50 million individuals worldwide. Electroencephalogram (EEG) signals play a vital role in the diagnosis and analysis of epileptic seizures. However, traditional machine learning techniques often rely on handcrafted features, limiting their robustness and generalizability across diverse EEG acquisition settings, seizure types, and patients. To address these limitations, we propose RDPNet, a multi-scale residual dilated pyramid network with entropy-guided feature fusion for automated epileptic EEG classification. RDPNet combines residual convolution modules to extract local features and a dilated convolutional pyramid to capture long-range temporal dependencies. A dual-pathway fusion strategy integrates pooled and entropy-based features from both shallow and deep branches, enabling robust representation of spatial saliency and statistical complexity. We evaluate RDPNet on two benchmark datasets: the University of Bonn and TUSZ. On the Bonn dataset, RDPNet achieves 99.56–100% accuracy in binary classification, 99.29–99.79% in ternary tasks, and 95.10% in five-class classification. On the clinically realistic TUSZ dataset, it reaches a weighted F₁-score of 95.72% across seven seizure types. Compared with several baselines, RDPNet consistently outperforms existing approaches, demonstrating superior robustness, generalizability, and clinical potential for epileptic EEG analysis. Full article

The organization of consciousness is described through increasingly rich theoretical models. We review evidence that working memory capacity—essential to generating consciousness in the cerebral cortex—is supported by dual limbic memory systems. These dorsal (Papez) and ventral (Yakovlev) limbic networks provide the basis for mnemonic processing and prediction in the dorsal and ventral divisions of the human neocortex. Empirical evidence suggests that the dorsal limbic division is (i) regulated preferentially by excitatory feedforward control, (ii) consolidated by REM sleep, and (iii) controlled in waking by phasic arousal through lemnothalamic projections from the pontine brainstem reticular activating system. The ventral limbic division and striatum, (i) organizes the inhibitory neurophysiology of NREM to (ii) consolidate explicit memory in sleep, (iii) operating in waking cognition under the same inhibitory feedback control supported by collothalamic tonic activation from the midbrain. We propose that (i) these dual (excitatory and inhibitory) systems alternate in the stages of sleep, and (ii) in waking they must be balanced—at criticality—to optimize the active inference that generates conscious experiences. Optimal Bayesian belief updating rests on balanced feedforward (excitatory predictive) and feedback (inhibitory corrective) control biases that play the role of prior and likelihood (i.e., sensory) precision. Because the excitatory (E) phasic arousal and inhibitory (I) tonic activation systems that regulate these dual limbic divisions have distinct affective properties, varying levels of elation for phasic arousal (E) and anxiety for tonic activation (I), the dual control systems regulate sleep and consciousness in ways that are adaptively balanced—around the entropic nadir of E–I criticality—for optimal self-regulation of consciousness and psychological health. Because they are emotive as well as motive control systems, these dual systems have unique qualities of feeling that may be registered as subjective experience. Full article

We consider the problem of privately updating a message out of K messages from N replicated and non-colluding databases where a user has an outdated version of the message W^θ of length L bits that differ from the current version Wθ in at most f bits. The user also has a cache containing coded combinations of the K messages (with a pre-specified structure), which are unknown to the N databases (unknown prefetching). The cache Z contains ℓ linear combinations from all K messages in the databases with r=lL being the caching ratio. The user needs to retrieve Wθ correctly using a private information retrieval (PIR) scheme without leaking information about the message index θ to any individual database. Our objective is to jointly design the prefetching (i.e., the structure of said linear combinations) and the PIR strategies to achieve the least download cost. We propose a novel achievable scheme based on syndrome decoding where the cached linear combinations in Z are designed to be bits pertaining to the syndrome of Wθ according to a specific linear block code. We derive a general lower bound on the optimal download cost for 0≤r≤1, in addition to achievable upper bounds. The upper and lower bounds match for the cases when r is exceptionally low or high, or when K=3 messages for arbitrary r. Such bounds are derived by developing novel cache-aided arbitrary message length PIR schemes. Our results show a significant reduction in the download cost if f<L2 when compared with downloading Wθ directly using typical cached-aided PIR approaches. Full article

Unsupervised feature selection aims to characterize the cluster structure of original features and select the optimal subset without label guidance. However, existing methods overlook fuzzy information in the data, failing to model cluster structures between data effectively, and rely on squared error for data reconstruction, exacerbating noise impact. Therefore, a robust unsupervised feature selection algorithm based on fuzzy anchor graphs (FWFGFS) is proposed. To address the inaccuracies in neighbor assignments, a fuzzy anchor graph learning mechanism is designed. This mechanism models the association between nodes and clusters using fuzzy membership distributions, effectively capturing potential fuzzy neighborhood relationships between nodes and avoiding rigid assignments to specific clusters. This soft cluster assignment mechanism improves clustering accuracy and the robustness of the graph structure while maintaining low computational costs. Additionally, to mitigate the interference of noise in the feature selection process, an adaptive fuzzy weighting mechanism is presented. This mechanism assigns different weights to features based on their contribution to the error, thereby reducing errors caused by redundant features and noise. Orthogonal tri-factorization is applied to the low-dimensional representation matrix. This guarantees that each center represents only one class of features, resulting in more independent cluster centers. Experimental results on 12 public datasets show that FWFGFS improves the average clustering accuracy by 5.68% to 13.79% compared with the state-of-the-art methods. Full article

Precise odor source localization in turbulent and sparse environments plays a vital role in enabling robotic systems for hazardous chemical monitoring and effective disaster response. To address this, we propose Cooperative Gravitational-Rényi Infotaxis (CGRInfotaxis), a distributed decision-optimization framework that combines multi-agent collaboration with hybrid cognitive strategy to improve search efficiency and robustness. The method integrates a gravitational potential field for rapid source convergence and Rényi divergence-based probabilistic exploration to handle sparse detections, dynamically balanced via a regulation factor. Particle filtering optimizes posterior probability estimation to autonomously refine search areas while preserving computational efficiency, alongside a distributed interactive-optimization mechanism for real-time decision updates through agent cooperation. The algorithm’s performance is evaluated in scenarios with fixed and randomized odor source locations, as well as with varying numbers of agents. Results demonstrate that CGRInfotaxis achieves a near-100% success rate with high consistency across diverse conditions, outperforming existing methods in stability and adaptability. Increasing the number of agents further enhances search efficiency without compromising reliability. These findings suggest that CGRInfotaxis significantly advances multi-agent odor source localization in turbulent, sparse environments, offering practical utility for real-world applications. Full article

Causation is fundamentally important to science, and yet our understanding of causation is spread out across disparate fields, with different measures of causation having been proposed in philosophy, statistics, psychology, and other areas. Here we examined over a dozen popular measures of causation, all independently developed and widely used, originating in different fields. We identify a high degree of consilience, in that measures are often very similar, or indeed often rediscovered. This is because, we show, measures of causation are based on a small set of related “causal primitives”: sufficiency and necessity, or alternatively, determinism and degeneracy. These primitives are ways of capturing the degree of uncertainty inherent in causal relationships. In turn, these results help us understand the phenomenon whereby macroscales can reduce the uncertainty in causal relationships, leading to stronger causes at macroscales—an outcome known as “causal emergence”. First identified using the effective information and later the integrated information in model systems, causal emergence has been found in real data across the sciences since. But is it simply a quirk of these original measures? Using a simple model system, we demonstrate how the consilience of causation guarantees that causal emergence is commonly found in causal measures, identifying instances across all measures analyzed. This finding sets the mathematical understanding of emergence on firmer ground, opening the door for the detection of natural scales of causal interaction in complex systems, as well as assisting with scientific modeling and experimental interventions. Full article

We investigate the role of a statistical complexity measure to assign equilibration in isolated quantum systems. While unitary dynamics preserve global purity, expectation values of observables often exhibit equilibration-like behavior, raising the question of whether a measure of complexity can track this process. In addition to examining observable equilibration, we extend our analysis to study how the complexity of the quantum states evolves, providing insight into the transition from initial coherence to equilibrium. We define a classical statistical complexity measure based on observable entropy and deviation from equilibrium, which captures the dynamical progression towards equilibration and effectively distinguishes between complex and non-complex trajectories. In particular, our measure is sensitive to non-complex dynamics. Such dynamics include the quasi-periodic behavior exhibited by low-dimensional initial states, where the system explores a limited region of Hilbert space while preserving coherence. Numerical simulations of an Ising-like non-integrable Hamiltonian spin-chain model support these findings. Our work provides new insight into the emergence of equilibrium behavior from unitary dynamics and advances complexity as a meaningful tool in the study of the emergence of classicality in microscopic systems. Full article