Search Results (331)

In this work, we introduce a novel method to extract correlations in diagonal quantum states in multi-particle quantum systems, addressing a significant limitation of traditional approaches that require prior knowledge of the density matrices of quantum states. Instead of relying on classical information processing, our method is based on weak couplings and ancillary systems, eliminating the need for classical communication, optimization, and complex calculations. The concept of mutually unbiased bases is intrinsically linked to symmetry, as it entails the uniform distribution of quantum states across distinct bases. Within the framework of our theoretical model, mutually unbiased bases are employed to facilitate weak measurements and to function as the post-selected states. To quantify the correlations in the initial state, we employ the trace distance between the initial state and the product of its marginal states, and illustrate the feasibility and effectiveness of our approach. We generalize the approach to accommodate high-dimensional multi-particle systems for potential applications in quantum information processing and quantum networks. Full article

Internal crack defects in high-strength low-alloy (HSLA) steels during continuous casting pose significant challenges to downstream processing and product reliability. However, due to the inherent class imbalance in industrial defect datasets, conventional machine learning models often suffer from poor sensitivity to minority class instances. This study proposes a predictive framework that integrates conditional tabular generative adversarial network (CTGAN) for synthetic minority sample generation and CatBoost for classification. A dataset of 733 process records was collected from a continuous caster, and 25 informative features were selected using mutual information. CTGAN was employed to augment the minority class (crack) samples, achieving a balanced training set. Feature distribution analysis and principal component visualization indicated that the synthetic data effectively preserved the statistical structure of the original minority class. Compared with the other machine learning methods, including KNN, SVM, and MLP, CatBoost achieved the highest metrics, with an accuracy of 0.9239, precision of 0.9041, recall of 0.9018, and F1-score of 0.9022. Results show that CTGAN-based augmentation improves classification performance across all models. These findings highlight the effectiveness of GAN-based augmentation for imbalanced industrial data and validate the CTGAN–CatBoost model as a robust solution for online defect prediction in steel manufacturing. Full article

(1) Background: The number of casualties due to car accidents in Europe is decreasing. However, there are still very large differences in the levels of road safety between countries, even within the European Union. Therefore, it is vital to conduct reliable international analyses to compare the effectiveness of actions taken to prevent road accidents. Information on the number of accidents, injuries, and fatalities can be found in various databases (e.g., Eurostat or OECD). In this paper, it is clearly shown that data on car accidents and the resulting injuries are not comparable between different countries, and any conclusions drawn using these data as their basis will be erroneous. (2) Methods: The indicators of the number of car accidents, injured people, and fatalities in relation to the number of inhabitants were determined, then their distribution and mutual correlations were examined for a group of selected European countries. (3) Results: There is no correlation between the indicators of the number of car accidents and injuries and the indicator of fatalities. An assessment of road safety based on these indicators would result in inconsistent and ambiguous conclusions. (4) Conclusions: It has been empirically shown that data on the number of car accidents and injured people from different countries are not comparable. These conclusions were verified by providing examples of the definitions of an injured person used in different countries. This paper clearly indicates that any international comparisons can only be made based on data regarding the number of road accident fatalities. Full article

Oncological hyperthermia (HT) is a medical technique aimed at heating a specific region of the human body containing a tumour. The heat makes the tumour cells more sensitive to the cytotoxic effects of radiotherapy and chemotherapy. Electromagnetic (EM) HT devices radiate a single-frequency EM field that induces a temperature increase in the treated region of the body. The typical radiative HT frequencies are between 60 and 150 MHz for deep HT applications, while 434 MHz and 915 MHz are used for superficial HT. The input EM power can reach up to 2000 W in deep HT and 250 W in superficial applications, and the E-field should be linearly polarized. This study proposes the development and use of E-field sensors to measure the distribution and evaluate the polarization of the E-field radiated by HT devices inside equivalent phantoms. This information is fundamental for the validation and assessment of HT systems. The sensor is constituted by three mutually orthogonal probes. Each probe is composed of a dipole, a diode, and a high-impedance transmission line. The fundamental difference in the operability of this sensor with respect to the standard E-field square-law detectors lies in the high-power values of the considered EM sources. Numerical analyses were performed to optimize the design of the E-field sensor in the whole radiative HT frequency range and to characterize the sensor behaviour at the power levels of HT. Then the sensor was realized, and measurements were carried out to evaluate the E-field radiated by commercial HT systems. The results show the suitability of the developed sensor to measure the E-field radiated by HT applicators. Additionally, in the measured devices, the linear polarization is evidenced. Accordingly, the work shows that in these devices, a single probe can be used to completely characterize the field distribution. Full article

With the rapid advancement of Internet of Things (IoT) technology, intrusion detection systems (IDSs) have become pivotal in ensuring network security. However, the data produced by IoT devices is typically sensitive and tends to display non-independent and identically distributed (Non-IID) properties. These factors impose significant limitations on the application of traditional centralized learning. In response to these issues, this study introduces a novel IDS framework grounded in federated learning and knowledge distillation (KD), termed FD-IDS. The proposed FD-IDS aims to tackle issues related to safeguarding data privacy and distributed heterogeneity. FD-IDS employs mutual information for feature selection to enhance training efficiency. For Non-IID data scenarios, the system combines a proximal term with KD. The proximal term restricts the deviation between local and global models, while KD utilizes the global model to steer the training process of local models. Together, these mechanisms effectively alleviate the problem of model drift. Experiments conducted on both the Edge-IIoT and N-BaIoT datasets demonstrate that FD-IDS achieves promising detection performance across multiple evaluation metrics. Full article

Given finite-dimensional random vectors Y, X, and Z that form a Markov chain in that order ($Y\to X\to Z$), we derive the upper bounds on the excess minimum risk using generalized information divergence measures. Here, Y is a target vector to be estimated from an observed feature vector X or its stochastically degraded version Z. The excess minimum risk is defined as the difference between the minimum expected loss in estimating Y from X and from Z. We present a family of bounds that generalize a prior bound based on mutual information, using the Rényi and $\alpha$-Jensen–Shannon divergences, as well as Sibson’s mutual information. Our bounds are similar to recently developed bounds for the generalization error of learning algorithms. However, unlike these works, our bounds do not require the sub-Gaussian parameter to be constant, and therefore, apply to a broader class of joint distributions over Y, X, and Z. We also provide numerical examples under both constant and non-constant sub-Gaussianity assumptions, illustrating that our generalized divergence-based bounds can be tighter than the ones based on mutual information for certain regimes of the parameter $\alpha$. Full article

The construction industry is the main consumer of mineral resources. At the same time, the Portland cement (PC) industry occupies a leading position, using expensive, high-quality raw materials. This is due to the high rate of construction in different areas (industrial, civil, road construction, etc.). The widespread application of PC is due primarily to the strength and durability of composite materials based on it. Taking into account their specific purpose, PC-based composites are usually optimized to achieve specified characteristics and rational use of raw materials. To reduce PC consumption and justify the possibility of its use in complex binders, this manuscript analyzes the composition of a functional polymer–mineral additive; the nature and mechanisms of its interaction with PC depend on the method of introducing the additive (dry mixing/joint grinding of the clinker–gypsum mixture with the additive at the stage of binder preparation). Based on the data of XRD, IR, and SEM analysis, as well as taking into account patent information, the composition of the additive was clarified. The combined application of the above methods allowed us to establish the uniformity of the additive distribution in the binder depending on the introduction method and to evaluate the effect of each additive component and its mutual impact on the processes occurring during cement hydration. As a result, it was established that the most effective introduction method is combined grinding. A phenomenological model of the structure formation of additives containing cement paste is proposed. The binder production by the combined grinding method promotes the intensification of the processes occurring during hydration, as evidenced by the data of qualitative and quantitative XRD, IR, and DTA analysis, differential scanning calorimetry (DSC), and TGA analysis. Full article

The Bayesian network is a directed, acyclic graphical model that can offer a structured description for probabilistic dependencies among random variables. As powerful tools for classification tasks, Bayesian classifiers often require computing joint probability distributions, which can be computationally intractable due to potential full dependencies among feature variables. On the other hand, Naïve Bayes, which presumes zero dependencies among features, trades accuracy for efficiency and often comes with underperformance. As a result, non-zero dependency structures, such as trees, are often used as more feasible probabilistic graph approximations; in particular, Tree Augmented Naïve Bayes (TAN) has been demonstrated to outperform Naïve Bayes and has become a popular choice. For applications where a variable is strongly influenced by multiple other features, TAN has been further extended to the k-dependency Bayesian classifier (KDB), where one feature can depend on up to k other features (for a given $k\ge 2$). In such cases, however, the selection of the k parent features for each variable is often made through heuristic search methods (such as sorting), which do not guarantee an optimal approximation of network topology. In this paper, the novel notion of k-tree Augmented Naïve Bayes (k-TAN) is introduced to augment Naïve Bayesian classifiers with k-tree topology as an approximation of Bayesian networks. It is proved that, under the Kullback–Leibler divergence measurement, k-tree topology approximation of Bayesian classifiers loses the minimum information with the topology of a maximum spanning k-tree, where the edge weights of the graph are mutual information between random variables conditional upon the class label. In addition, while in general finding a maximum spanning k-tree is NP-hard for fixed $k\ge 2$, this work shows that the approximation problem can be solved in time $O\left(n^{k+1}\right)$ if the spanning k-tree also desires to retain a given Hamiltonian path in the graph. Therefore, this algorithm can be employed to ensure efficient approximation of Bayesian networks with k-tree augmented Naïve Bayesian classifiers of the guaranteed minimum loss of information. Full article

Friston proposed the Minimum Free Energy Principle (FEP) based on the Variational Bayesian (VB) method. This principle emphasizes that the brain and behavior coordinate with the environment, promoting self-organization. However, it has a theoretical flaw, a possibility of being misunderstood, and a limitation (only likelihood functions are used as constraints). This paper first introduces the semantic information G theory and the R(G) function (where R is the minimum mutual information for the given semantic mutual information G). The G theory is based on the P-T probability framework and, therefore, allows for the use of truth, membership, similarity, and distortion functions (related to semantics) as constraints. Based on the study of the R(G) function and logical Bayesian Inference, this paper proposes the Semantic Variational Bayesian (SVB) and the Maximum Information Efficiency (MIE) principle. Theoretic analysis and computing experiments prove that R − G = F − H(X|Y) (where F denotes VFE, and H(X|Y) is Shannon conditional entropy) instead of F continues to decrease when optimizing latent variables; SVB is a reliable and straightforward approach for latent variables and active inference. This paper also explains the relationship between information, entropy, free energy, and VFE in local non-equilibrium and equilibrium systems, concluding that Shannon information, semantic information, and VFE are analogous to the increment of free energy, the increment of exergy, and physical conditional entropy. The MIE principle builds upon the fundamental ideas of the FEP, making them easier to understand and apply. It needs to combine deep learning methods for wider applications. Full article

With the increasing complexity of power grid field operations, frequent operational violations have emerged as a major concern in the domain of power grid field operation safety. To support dispatchers in accurately identifying and addressing violation risks, this paper introduces a profiling approach for power grid field operation violations based on knowledge graph techniques. The method enables deep modeling and structured representation of violation behaviors. In the structured data processing phase, statistical analysis is conducted based on predefined rules, and mutual information is employed to quantify the contribution of various operational factors to violations. At the municipal bureau level, statistical modeling of violation characteristics is performed to support regional risk assessment. For unstructured textual data, a multi-source embedding-based named entity recognition (NER) model is developed, incorporating domain-specific power lexicon information to enhance the extraction of key entities. High-weight domain terms related to violations are further identified using the TF-IDF algorithm to characterize typical violation behaviors. Based on the extracted entities and relationships, a knowledge graph of field operation violations is constructed, providing a computable and inferable semantic representation of operational scenarios. Finally, visualization techniques are applied to present the structural patterns and distributional features of violations, offering graph-based support for violation risk analysis and dispatch decision-making. Experimental results demonstrate that the proposed method effectively identifies critical features of violation behaviors and provides a structured foundation for intelligent decision support in power grid operation management. Full article

Cooperative multi-agent reinforcement learning (MARL) has emerged as a powerful paradigm for addressing complex real-world challenges, including autonomous robot control, strategic decision-making, and decentralized coordination in unmanned swarm systems. However, it still faces challenges in learning proper coordination among multiple agents. The lack of effective knowledge sharing and experience interaction mechanisms among agents has led to substantial performance decline, especially in terms of low sampling efficiency and slow convergence rates, ultimately constraining the practical applicability of MARL. To address these challenges, this paper proposes a novel framework termed Reward redistribution and Experience reutilization based Coordination Optimization (RECO). This innovative approach employs a hierarchical experience pool mechanism that enhances exploration through strategic reward redistribution and experience reutilization. The RECO framework incorporates a sophisticated evaluation mechanism that assesses the quality of historical sampling data from individual agents and optimizes reward distribution by maximizing mutual information across hierarchical experience trajectories. Extensive comparative analyses of computational efficiency and performance metrics across diverse environments reveal that the proposed method not only enhances training efficiency in multi-agent gaming scenarios but also significantly strengthens algorithmic robustness and stability in dynamic environments. Full article

Accurate clustering of buildings is a prerequisite for map generalization in densely populated urban data. Edge buildings at the edge of building groups, identified through human-eye recognition, may serve as boundary constraints for clustering. This paper proposes the use of seven Gestalt factors to distinguish edge buildings from other buildings. Employing the DGI model to produce high-quality node embeddings, optimize the mutual information between the local node representation and the global summary vector. We then conduct training to identify edge buildings in the two test datasets using eight feature combinations. This research introduces a modified distance metric called the ‘m_dis’ feature, which is used to describe the closeness between two adjacent buildings. Finally, the clusters of edge and inner buildings are determined through a constrained graph traversal that is based on the ‘m_dis’ feature. This method is capable of effectively identifying and distinguishing densely distributed building groups in Chengdu City, China, as demonstrated by experimental results. It offers novel concepts for edge building recognition in dense urban areas, confirms the significance of the LOF factor and the ‘m_dis’ feature, and achieves superior clustering results in comparison to other methods. Additionally, this semi-supervised clustering method (DGI-EIC) has the potential to achieve an ARI index of approximately 0.5. Full article

As the spatial resolution of remote sensing images continues to increase, the complexity of the information they carry also grows. Remote sensing images are characterized by large imaging areas, scattered distributions of similar objects, intricate boundary shapes, and a high density of small objects, all of which pose significant challenges for semantic segmentation tasks. To address these challenges, we propose a Remote Sensing Image Segmentation Network that Integrates Global–Local Multi-Scale Information with Deep and Shallow Features (GLDSFNet). To better handle the wide variations in object sizes and complex boundary shapes, we design a Global–Local Multi-Scale Feature Fusion Module (GLMFM) that enhances segmentation performance by fully leveraging multi-scale information and global context. Additionally, to improve the segmentation of small objects, we propose a Shallow–Deep Feature Fusion Module (SDFFM), which effectively integrates deep semantic information with shallow spatial features through mutual guidance, retaining the advantages of both. Extensive ablation and comparative experiments conducted on two public remote sensing datasets, ISPRS Vaihingen and Potsdam, demonstrate that our proposed GLDSFNet outperforms state-of-the-art methods. Full article

Pansharpening provides a computational solution to the resolution limitations of imaging hardware by enhancing the spatial quality of low-resolution hyperspectral (LRMS) images using high-resolution panchromatic (PAN) guidance. From an information-theoretic perspective, the task involves maximizing the mutual information between PAN and LRMS inputs while minimizing spectral distortion and redundancy in the fused output. However, traditional spatial-domain methods often fail to preserve high-frequency texture details, leading to entropy degradation in the resulting images. On the other hand, frequency-based approaches struggle to effectively integrate spatial and spectral cues, often neglecting the underlying information content distributions across domains. To address these shortcomings, we introduce a novel architecture, termed the Cross-Domain Fusion Attention Network (CDFAN), specifically designed for the pansharpening task. CDFAN is composed of two core modules: the Multi-Domain Interactive Attention (MDIA) module and the Spatial Multi-Scale Enhancement (SMCE) module. The MDIA module utilizes discrete wavelet transform (DWT) to decompose the PAN image into frequency sub-bands, which are then employed to construct attention mechanisms across both wavelet and spatial domains. Specifically, wavelet-domain features are used to formulate query vectors, while key features are derived from the spatial domain, allowing attention weights to be computed over multi-domain representations. This design facilitates more effective fusion of spectral and spatial cues, contributing to superior reconstruction of high-resolution multispectral (HRMS) images. Complementing this, the SMCE module integrates multi-scale convolutional pathways to reinforce spatial detail extraction at varying receptive fields. Additionally, an Expert Feature Compensator is introduced to adaptively balance contributions from different scales, thereby optimizing the trade-off between local detail preservation and global contextual understanding. Comprehensive experiments conducted on standard benchmark datasets demonstrate that CDFAN achieves notable improvements over existing state-of-the-art pansharpening methods, delivering enhanced spectral–spatial fidelity and producing images with higher perceptual quality. Full article

The mining of relevant association rules from transactional databases is a fundamental process in data mining. Traditional algorithms, however, will typically be based on fixed thresholds and general rule generation, with the result being large and redundant outcomes. This paper presents DERAR (Dynamic Extracting of Relevant Association Rules), a dynamic approach integrating structure pattern mining and dynamic multi-criteria filtering. The process begins with the generation of frequent meta-patterns. Each entity is given a stability score for its consistency across various data projections, then sorted by mutual information in order to preserve the most informative dimensions. The resulting association rules from these models are filtered through a dynamic confidence threshold that is adjusted according to the statistical distribution of the dataset. A final semantic filtering phase identifies rules with high coherence between antecedent and consequent. Experimental results show that DERAR reduces rules by up to 85%, improving interpretability and coherence. It outperforms Apriori, FP-Growth, and H-Apriori in rule quality and computational efficiency. DERAR consistently achieves lower execution times and memory use, especially on large or sparse datasets. These results confirm the benefits of adaptive, semantically guided rule mining for generating concise, high-quality, and actionable knowledge. Full article