Automated Program Repair (APR) is increasingly vital for managing the complexity of modern software systems. However, current APR techniques suffer from inefficiently selecting repair components, resulting in suboptimal patches. To address these limitations, we propose PCRepair, a context-aware template-based methodology for automated software fault repair. This approach integrates predefined repair templates with context-aware analysis to improve repair accuracy and efficiency. PCRepair first localizes suspicious statements via the Ochiai technique, then matches their contextual patterns with relevant templates. This strategy narrows the search space and generates semantically relevant candidate patches. We prioritize these patches using a weighted fusion similarity metric and sequentially validate them against existing test cases. Evaluations on the Defects4J benchmark show that PCRepair successfully repaired 38 defects, demonstrating competitive performance compared to existing methods, particularly in terms of repair efficiency, with a 9.62% success rate and an average repair time of fewer than 30 min per defect.

Software defect prediction (SDP) is an effective approach to ensure software reliability. Machine learning models have been widely employed in SDP, but they ignore the impact of class imbalance, noise and outliers on the prediction performance. This study proposes a fuzzy cost broad learning system (FC‐BLS). FC‐BLS not only handles class imbalance problems but also considers the specific sample distribution to address noise and outliers in software defect datasets. Our approach draws fully on the idea of the cost matrix and fuzzy membership functions. It introduces them to BLS, where the cost matrix prioritises the training errors on the minority samples. Hence, the classification hyperplane position is more reasonable, and fuzzy membership functions calculate the membership degree of the sample in a feature mapping space to remove the prediction error caused by noise and outlier samples. Then, the optimisation problem is constructed based on the idea that the minority class and normal instances have relatively high costs. By contrast, the majority class and noise and outlier instances have relatively small costs. This study conducted experiments on nine NASA SDP datasets, and the experimental findings demonstrated the effectiveness of the proposed methodology on most datasets.

With the increasing scale and complexity of software recently, automated software bug repair has grown in importance. However, the current automated software bug repair process suffers from issues such as coarse-grained repair granularity and poor patch quality. To address these problems, we propose a graph mining template-based automatic software repair (GMRepair) to improve the performance of automated software bug repair. First, this approach adopts the Ochiai fault localization technique to locate and generate a list of suspicious defect statements. We utilize the GumTree tool to parse the bug and repair program files, generating edit scripts. These edit scripts are then transformed into a graphical representation. Second, we utilize a frequent graph miner to obtain graph mining templates by matching the context of the suspicious statements with the context of the graph mining templates, generating an initial population for them. The buggy program is evolved using genetic programming through mutation and crossover operations, generating new individuals. Finally, we sequentially pass the candidate patches (CPs) through corresponding test cases and prioritize the test cases using priority sorting techniques. Patches that fail to pass the test cases are filtered out, and the patches that pass the test cases are output. We conducted the experiments using two datasets, QuixBugs and Defects4J. In Defects4J, the GMRepair successfully repaired 41 defects, while in QuixBugs, it successfully repaired 15 defects. Compared to the existing methods, GMRepair offers a higher success rate and efficiency in defect repair.

Recently, contrastive learning (CL) has shown excellent performance in hyperspectral image (HSI) classification. However, existing CL based methods face two specific challenges. (1) Multi-view samples inevitably introduce ambiguity and uncertainty due to data augmentation operations. Traditional contrastive learning methods fail to effectively model these dynamic ambiguous features, resulting in a lack of robustness in the feature learning process. (2) Existing CL based methods primarily learns feature representations by pulling positive samples closer and pushing negative samples apart. But, they lack structured modeling of intra-class feature compactness and inter-class feature separability. To address these challenges, we propose a fuzzy triplet contrastive learning (FTCL) method for HSI classification. For the first challenge, we propose a multi-view fuzzy neighborhood learning (MFNL) module. This module effectively models the ambiguity among multi-view samples through fuzzy membership calculation, multi-view fuzzy weight matrix generation, and weighted feature aggregation, significantly enhancing the robustness and stability of feature representations. To tackle the second challenge, we design a triplet feature discriminative (TFD) classifier, which improves intra-class compactness by minimizing the distance between anchor samples and positive samples, while enhancing inter-class separability by maximizing the distance between anchor samples and negative samples. This enables precise modeling of intra-class compactness and inter-class separability. The proposed method is evaluated on four HSI datasets, and the experimental results demonstrate that the proposed method outperforms the state-of-the-art methods.

Compressed sensing (CS) multi‐camera network reconstruction has attracted much attention in the field of distributed CS networks. However, many multi‐camera network reconstructions based on CS usually recover every image separately; the view's dependency and geometrical structure among these multi‐view images could be rarely considered in this way, which will result in some unsatisfied joint reconstruction results. Here, the authors introduce to extract the multiple view geometry from multi‐view images to construct the view's dependency observation model. Based on the proposed parametric transformation observation model, they propose a novel CS joint reconstruction method of multi‐view image that guided by the spatial correlation and low‐rank background constraints. The eventual optimisation model could be relaxed to a series of convex optimisation problems, which could be efficiently solved by combining the variable splitting and alternate iteration technique. The extended experimental results indicate that they proposed method has achieved a remarkable improvement in both objective criterion and visual fidelity compared with other competitive reconstruction methods.

The recent studies indicate that predicate-based statistical fault localization suffered from the control dependence confounding effect and the failure flow confounding effect, which decrease the measurement accuracy of fault localization. However, the extent of the potentially confounding effect of data dependence is uncertain. This paper presents a novel approach that accounts for the effects of program dependences to mitigate the confounding effect during statistical predicate-based fault localization. First, we present a variable type-based predicate designation technique to improve the ability of fault-relevant predicate identification. Then, we conduct dependence analysis to examine the extent of the potentially confounding effect of data dependence in fault localization. Finally, we propose a linear regression-based method to mitigate both the data dependence confounding effect and the control dependence confounding effect. Using the open-source software systems, we find that the fault-relevant predicate can be identified effectively by the proposed predicate design technique, and the effectiveness of fault localization can be significantly improved after mitigating the dependence confounding effect.