Enhancing software reliability mitigates failures and reduces maintenance costs. In the LLVM compiler, different option sequences applied to the intermediate representation (IR) produce binaries with varying reliability levels, making the search for an optimal sequence in reliability-oriented compilation a key challenge. Although reinforcement learning (RL) has been employed to automate this process, existing methods suffer from two major limitations: they rely on structure-based static IR embeddings that overlook the dynamic behaviors induced by compilation transformations, leading to low-fidelity state representations, and construct action spaces that fail to preserve critical inter-option dependencies while maintaining spatial compactness, thereby impairing training efficiency and constraining optimization gains. This article presents Optimizing Software Reliability at Compile-time using Reinforcement Learning (OSRC-RL), which integrates two novel components: a Compilation Behavior-Aware State Representation (CBA-SR) and an Action Space Construction via Option Dependency Awareness and space minimization (ASC-ODA). CBA-SR jointly encodes program semantics and compilation dynamics, using activated options as multi-label supervisory signals to guide an expressive Graph Isomorphism Network in learning IR subgraph patterns correlated with option activations, yielding high-fidelity states that enable more reliable policy learning and faster convergence. ASC-ODA reconciles dependency preservation with spatial compactness by constructing Option Dependency Graph, performing dependency-aware hierarchical clustering and recursive intra-cluster path analysis, and applying a preference-aware selection to generate a compact yet dependency-preserving action space that enhances sample efficiency and policy stability. Evaluations across 20 benchmarks show that OSRC-RL achieves the highest average reliability gain ( \(I_{rg}{=}0.6694\) ) and competitive convergence speed compared with five baselines. Ablations attribute these gains to its core components: CBA-SR (up to 11.34% improvement via IR-graph learning) and ASC-ODA (up to 15.22% improvement via dependency-faithful actions). On industrial instances, it attains a 0.1818 average gain, surpassing the next-best method by 33.77%. Bounded overheads are mitigated by Lightweight Post-Processing (LPP), ensuring practical feasibility.

With the advent of the 5G era, wireless multimedia sensor networks (WMSNs) will be more widely used in security monitoring, environmental monitoring, intelligent transportation, and other applications of the Internet of Things (IoT). Data collected by WMSNs, part of IoT systems, are high-dimensional, multilevel, unstructured, and large-scale complex data. Effective nearest neighbor searching faces the “dimension curse” problem. To this end, by incorporating the neighborhood rough set (NRS) approach, this article proposes a novel and effective locality-sensitive hashing (LSH) method for high-dimensional WMSN data based on the neighborhood (NLSH). This method innovatively combines the neighborhood knowledge representation method with the LSH mechanism and extends the indexing ability of LSH. Moreover, this method does not require any prior knowledge and has good universality. The indexing method of neighborhood bucket building can reduce the number of searches and improve the response speed of the WMSN system. Extensive experiments have been carried out on several real-world multimedia data sets. The results show that a large-scale high-dimensional NLSH search based on the NRS approach can efficiently query the target point and produce very accurate results. The NLSH algorithm based on the NRS approach outperforms other advanced mainstream LSH algorithms.

Architecture-based software performance optimization can not only significantly save time but also reduce cost. A few rule-based performance optimization approaches at software architecture (SA) level have been proposed in recent years. However, in these approaches, the number of rules being used and the order of application of each rule are uncertain in the optimization process and these uncertainties have not been fully considered so far. As a result, the search space for performance improvement is limited, possibly excluding optimal solutions. Aiming to solve this problem, we propose an evolutionary algorithm for rule-based performance optimization at SA level named EA4PO. First, the rule-based software performance optimization at SA level is abstracted into a mathematical model called RPOM. RPOM can precisely characterize the mathematical relation between the usage of rules and the optimal solution in the performance improvement space. Then, a framework named RSEF is designed to support the execution of rule sequences. Based on RPOM and RSEF, EA4PO is proposed to find the optimal performance improvement solution. In EA4PO, an adaptive mutation operator is designed to guide the search direction by fully considering heuristic information of rule usage during the evolution. Finally, the effectiveness of EA4PO is validated by comparing EA4PO with a typical rule-based approach. The results show that EA4PO can explore a relatively larger space and get better solutions.

The aspect-oriented software architectural weaving mechanism, to integrate aspectual components that encapsulate crosscutting behaviors and features into components and connectors constituting Software Architecture (SA), contributes to analyze and verify overall behaviors and quality attributes of SA. This paper proposes a new kind of weaving process and rules, which offer the measure to transform the unwoven SA model into the woven SA model. The unwoven SA model is described in a special aspect-oriented architecture description language, called AC2-ADL, and specifies the locations, times and constrains of injection. Then a woven SA model only containing components and connectors is acquired after weaving, and easier to analyze and verify.