Entropy最新文献

Multi-criteria decision-making (MCDM) problems in complex evaluation systems are often characterized by high uncertainty in expert judgments and dynamic variations in indicator importance. Traditional analytic hierarchy process (AHP) and entropy-based weighting methods typically suffer from two inherent limitations: the inability to explicitly quantify expert hesitation and the rigidity of static weight assignment under evolving data distributions. To address these challenges, this paper proposes a dynamic hybrid weighting framework that integrates an interval-valued intuitionistic fuzzy analytic hierarchy process (IVIF-AHP) with an entropy-triggered correction mechanism. First, interval-valued intuitionistic fuzzy numbers are employed to simultaneously model membership, non-membership, and hesitation degrees in pairwise comparisons, enabling a more comprehensive representation of expert uncertainty. Second, an entropy-triggered dynamic fusion strategy is developed by jointly incorporating information entropy and coefficient of variation, allowing adaptive adjustment between subjective expert weights and objective data-driven weights. This mechanism effectively enhances sensitivity to high-dispersion criteria while preserving expert knowledge in low-variability indicators. The proposed framework is formulated in a hierarchical fuzzy decision structure and implemented through a fuzzy comprehensive evaluation process. Its feasibility and robustness are validated through a concrete case study on teaching effectiveness evaluation for a university engineering course, leveraging multi-source data. Comparative analysis demonstrates that the proposed approach effectively mitigates the weight rigidity and evaluation inflation observed in conventional methods. Furthermore, it improves diagnostic resolution and decision stability across different evaluation periods. The results indicate that the proposed entropy-triggered IVIF-AHP framework provides a mathematically sound and practically applicable solution for dynamic MCDM problems under uncertainty, with strong potential for extension to other complex evaluation and decision-support systems.

The operational reliability of aero-engines is critically dependent on the health of rolling element bearings, while incipient fault diagnosis remains particularly challenging under small-sample conditions. Although multiscale entropy methods are widely used for complexity analysis, conventional coarse-graining strategies suffer from severe information loss and unstable estimation when data are extremely limited. To address this, the primary objective of this study is to develop a robust diagnostic framework that ensures feature consistency and classification stability even with minimal training samples. Specifically, this paper proposes an integrated approach combining Refined Time-shifted Multiscale Rating Entropy (RTSMRaE) with an Animated Oat Optimization (AOO)-optimized Extreme Learning Machine (ELM). By introducing a refined time-shift operator and a dual-weight fusion mechanism, RTSMRaE effectively preserves transient impulsive features across multiple scales while suppressing stochastic fluctuations. Meanwhile, the AOO algorithm is employed to optimize the input weights and hidden biases of the ELM, alleviating performance instability caused by random initialization and improving generalization capability. Experimental validation on both laboratory-scale and real-world aviation bearing datasets demonstrates that the proposed RTSMRaE-AOO-ELM framework achieves a diagnostic accuracy of 99.47% with a standard deviation of ±0.48% using only five training samples per class. These results indicate that the proposed method offers superior diagnostic robustness and computational efficiency, providing a promising solution for intelligent condition monitoring in data-scarce industrial environments.

Open quantum walks (OQWs) constitute a class of quantum walks whose dynamics are entirely driven by interactions with the environment. It is well known that OQWs provide a general framework for implementing dissipative quantum computation. In this work, we demonstrate the feasibility of running the previously proposed quantum distance-based classifier within the open quantum walk computation model, and we show that its expected runtime remains finite even in the slower regime.

In this work, we consider a simple bistable motif constituted by a self-enhancing Transcription Factor (TF) and its mRNA with non-instantaneous dynamics. In particular, we mainly numerically investigated the impact of bounded stochastic perturbations of Sine-Wiener type affecting the degradation rate/binding rate constant of the TF on the phase-like transitions of the system. We show that the intrinsic exponential delay in the TF positive feedback, due to the presence of a mRNA with slow dynamics, deeply affects the above-mentioned transitions for long but finite times. We also show that, in the case of more complex delays in the feedback and/or in the translation process, the impact of the extrinsic stochasticity is further amplified. We also briefly investigate the power-law behavior (PLB) of the averaged energy spectrum of the TF by showing that, in some cases, the PLB is simply due to the filtering nature of the motif. A similar analysis can also be applied to biological models having a qualitatively similar structure, such as the well-known Capasso and Paveri-Fontana model of cholera spreading.

Physical-layer security (PLS) provides an information-theoretic framework for securing wireless communications by exploiting channel and signal-structure asymmetries, thereby avoiding reliance on computational hardness assumptions. Within this setting, lattice codes and their algebraic constructions play a central role in achieving secrecy over Gaussian and fading wiretap channels. This article offers a comprehensive survey of lattice-based wiretap coding, covering foundational concepts in algebraic number theory, Construction A over number fields, and the structure of modular and unimodular lattice families. We review key secrecy metrics, including secrecy gain, flatness factor, and equivocation, and consolidate classical and recent results to provide a unified perspective that links wireless-channel models with their underlying algebraic lattice structures. In addition, we review a newly proposed family of p-modular lattices in Khodaiemehr, H., 2018 constructed from cyclotomic fields Q(ζp) for primes p≡1(mod4) via a generalized Construction A framework. We characterize their algebraic and geometric properties and establish a non-existence theorem showing that such constructions cannot be extended to prime-power cyclotomic fields Q(ζpn) with n>1. Finally, motivated by the fact that these p-modular lattices naturally yield mixed-signature structures for which classical theta series diverge, we integrate recent advances on indefinite theta series and modular completions. Drawing on Vignéras' differential framework and generalized error functions, we outline how modularly completed indefinite theta series provide a principled analytic foundation for defining secrecy-relevant quantities in the indefinite setting. Overall, this work serves both as a survey of algebraic lattice techniques for PLS and as a source of new design insights for secure wireless communication systems.

We study the properties of a plasma sheath containing cold positive ions, secondary electrons, and primary electrons with a Cairns distribution (a non-thermal velocity distribution). We derive the generalized Bohm criterion and Bohm speed, the new floating potential at the wall, and the new critical secondary electron emission coefficient. We show that these properties of the plasma sheath depend significantly on the α-parameter in the non-thermal α-distribution, and so they are generally different from those of the plasma sheath if the primary electrons were assumed to be a Maxwellian distribution.

The inference of unstructured text semantics is a crucial preprocessing task for NLP and AI applications. Word sense disambiguation and entity linking tasks resolve ambiguous terms within unstructured text corpora to senses from a predefined knowledge source. Wikipedia has been one of the most popular sources due to its completeness, high link density, and multi-language support. In the context of chatbot-mediated consumption of information in recent years through implicit disambiguation and semantic representations in LLMs, Wikipedia remains an invaluable source and reference point. This survey covers methodologies for entity linking with Wikipedia, including early systems based on hyperlink statistics and semantic relatedness, methods using graph inference problem formalizations and graph label propagation algorithms, neural and contextual methods based on sense embeddings and transformers, and multimodal, cross-lingual, and cross-domain settings. Moreover, we cover semantic annotation workflows that facilitate the scaled-up use of Wikipedia-centric entity linking. We also provide an overview of the available datasets and evaluation measures. We discuss challenges such as partial coverage, NIL concepts, the level of sense definition, combining WSD and large-scale language models, as well as the complementary use of Wikidata.

The use of Silicon Carbide (SiC) MOSFETs significantly improves converter performance by increasing efficiency and reducing costs, to the detriment of electro-magnetic emission and reliability. Implementing a predictive maintenance strategy based on a prognosis tool can mitigate this limitation. This literature review offers a methodological synthesis of prognosis design tools for SiC MOSFETs, while also encompassing studies on IGBTs and silicon-based power MOSFETs where these approaches are transferable. The analysis focuses on wear-out prognosis under nominal operating conditions of standard package device, excluding environmental constraints. Articles published up to 2025 were identified in the OpenAlex database using a keyword-based search and manually filtered according to the study scope. Most reviewed works rely on Data-Based prognosis methods, mostly based on neural networks, though out-of-sample validation remains uncommon. Our study also highlights the dependence of Data-Based prognosis performance on the shape of degradation indicator trends. Moreover, the estimation of prediction uncertainty is rarely addressed in the reviewed literature. Despite notable methodological advances, ensuring the reliability of prognosis tools for SiC MOSFETs remains an ongoing research challenge.

Path integral Monte Carlo simulations and closure computations of quantum fluid triplet structures in the diffraction regime are presented. The principal aim is to shed some more light on the long-standing problem of quantum fluid triplet structures. This topic can be tackled via path integrals in an exact, though computationally demanding, way. The traditional approximate frameworks provided by triplet closures are complementary sources of information that (unexpectedly) may produce, at a much lower cost, useful results. To explore this topic further, the systems selected in this work are helium-3 under supercritical conditions and the quantum hard-sphere fluid on its crystallization line. The fourth-order propagator in the Jang-Jang-Voth's form (for helium-3) and Cao-Berne's pair action (for hard spheres) are employed in the corresponding path integral simulations; helium-3 interactions are described with Janzen-Aziz's pair potential. The closures used are Kirkwood superposition, Jackson-Feenberg convolution, the intermediate AV3, and the symmetrized form of Denton-Ashcroft approximation. The centroid and instantaneous triplet structures, in the real and the Fourier spaces, are investigated by focusing on salient equilateral and isosceles features. To accomplish this goal, additional simulations and closure calculations at the structural pair level are also carried out. The basic theoretical and technical points are described in some detail, the obtained results complete the structural properties reported by this author elsewhere for the abovementioned systems, and a meaningful comparison between the path integral and the closure results is made. In particular, the results illustrate the very slow convergence of the path integral triplet calculations and the behaviors of certain salient Fourier components, such as the double-zero momentum transfers or the equilateral maxima, which may be associated with distinct fluid conditions (e.g., far and near quantum freezing). Closures are shown to yield valuable triplet information over a wide range of conditions, as ascertained from the analyzed centroid structures, which mimic those of fluids at densities higher than the actual ones; thus, closures should remain a part of quantum fluid triplet studies.

The superposition principle in quantum mechanics enables the encoding of an entire solution space within a single quantum state. By employing quantum routines such as amplitude amplification or the Quantum Approximate Optimization Algorithm (QAOA), this solution space can be explored in a computationally efficient manner to identify optimal or near-optimal solutions. In this article, we propose quantum circuits that operate on binary data representations to address a central task in prototype-based classification and representation learning, namely the so-called winner determination, which realizes the nearest prototype principle. We investigate quantum search algorithms to identify the closest prototype during prediction, as well as quantum optimization schemes for prototype selection in the training phase. For these algorithms, we design oracles based on arithmetic circuits that leverage quantum parallelism to apply mathematical operations simultaneously to multiple inputs. Furthermore, we introduce an oracle for prototype selection, integrated into a learning routine, which obviates the need for formulating the task as a binary optimization problem and thereby reduces the number of required auxiliary variables. All proposed oracles are implemented using the Python 3-based quantum machine learning framework PennyLane and empirically validated on synthetic benchmark datasets.