While most current work on interpretable models has centered on post hoc explainability of individual predictive models, the structure of the hypothesis space from which such models are drawn has been largely neglected. This paper proposes a contrasting perspective in which explainability is treated not as an attribute of a single solution but as a structural property of the model space. By combining Rashomon set analysis with Pareto-based performance–model complexity trade-offs, we formulate a computational framework for identifying near-optimal and structurally simple models. A performance–model complexity trade-off landscape is constructed by systematically generating models under controlled complexity bounds and extracting Pareto-optimal solutions. The results show that explainability can emerge as a regional property of hypothesis spaces in which multiple interpretable models achieve competitive predictive performance. This perspective supports the identification of robust and auditable predictive solutions and complements traditional explainability approaches centered on isolated models. Cross-dataset replication on Wine (UCI) and Vehicle (UCI) confirms the generalizability of these findings.

Transcranial magnetic stimulation (TMS) combined with electroencephalography (EEG) provides a powerful framework to probe and modulate human cortical and corticospinal excitability. In recent years, brain state-dependent EEG–TMS paradigms have gained increasing interest by synchronizing stimulation to ongoing neural activity. However, traditional approaches relying on single oscillatory features or fixed thresholds have yielded heterogeneous and often inconsistent results, motivating the adoption of machine learning (ML) and artificial intelligence (AI) methods to model brain state in a multivariate, data-driven manner. This review synthesizes current ML and deep learning (DL) approaches aimed at predicting cortical and corticospinal excitability from pre-stimulus EEG. We contextualize these methods within brain state-dependent EEG–TMS frameworks based on oscillatory phase, power, and network-level features, and within evolving definitions of brain state that move beyond local biomarkers toward distributed, large-scale, and dynamically evolving neural representations. The reviewed studies span feature-engineered models, data-driven decoding approaches, and emerging adaptive closed-loop frameworks. Finally, we discuss key methodological challenges, translational barriers, and future directions toward personalized, interpretable, and fully closed-loop neuromodulation systems.

Medical images commonly exhibit low contrast, weak boundaries, and complex textures. In addition, significant semantic differences exist between deep-level semantic features and shallow-level detail features, posing challenges for multi-scale feature fusion in terms of detail preservation and structural consistency. To address these issues, a frequency-enhanced and bidirectional feature-guided segmentation network (FBNet) is proposed. The network comprises two core components. The frequency-based enhancement (FBE) module employs the Fast Fourier Transform and applies adaptive modulation to the amplitude spectrum through a content-aware gating mechanism, enhancing detail expression and inter-structural contrast. The Bidirectional Guided Feature Fusion module (BGF) enables bidirectional interaction between shallow and deep features. Additionally, the Structure and Edge Awareness (SEA) module is constructed using directional and variance attention mechanisms to achieve collaborative optimization of structural modeling and edge perception. Experiments on four medical image segmentation datasets show that, compared to the second-best method, FBNet achieves improvements of 2.12, 1.57, 1.37, and 1.56 percentage points on the mIoU metric and 1.54, 1.11, 0.84, and 1.03 percentage points on the mDice metric.

This review examines the transformative interplay between computing chips and Artificial Intelligence (AI), driving a revolution across various industries. First, the broader artificial intelligence and semiconductor ecosystem is analyzed, including hardware manufacturers, software frameworks, and system integration. Next, the development prospects are examined, revealing current challenges such as power consumption, manufacturing complexity, supply chain constraints, and ethical considerations. Further discussion focuses on cloud-edge collaboration in relation to system architecture and workload allocation strategies. Then, cutting-edge AI technologies are analyzed, and key insights are summarized. Finally, the overall trends in artificial intelligence and the chip industry are summarized, clearly presenting the findings for the future and making a unique contribution to this review.

This paper introduces D3O-GT, a distributed optimization framework designed to operate under partial, heterogeneous, and delayed information—conditions commonly encountered in large-scale logistics and networked decision support systems. The proposed approach integrates gradient tracking with delay-aware updates to address the steady-state bias and instability that often affect classical distributed gradient methods. We formulate a consensus optimization model that captures decentralized decision variables while preserving global optimality, and we develop an algorithmic structure that balances convergence accuracy, communication efficiency, and robustness to asynchronous updates. Extensive numerical experiments demonstrate that D3O-GT achieves machine precision convergence in synchronous settings and remains stable under bounded communication delays, converging to a small neighborhood of the optimum. In contrast, conventional distributed gradient descent exhibits significant residual error under the same conditions. Scalability analyses further indicate that the proposed method maintains favorable iteration complexity as the number of agents increases. These results position D3O-GT as a practical and scalable solution for distributed decision-making environments, with direct relevance to logistics-oriented applications such as resource allocation, coordination of networked services, and real-time operational planning.

Underwater micro-bubble detection entails multiple challenges, including diminutive target sizes, sparse pixel information, pronounced specular highlights and water scattering, indistinct bubble boundaries, and adhesion or overlap between instances. To address these issues, we propose HSMD-YOLO, an improved detector tailored for high-resolution micro-bubble detection and built upon YOLOv11. The model incorporates three novel components: the Scale Switch Block (SSB), a scale-transformation module that suppresses artifacts and background noise, thereby stabilizing edges in thin-walled bubble regions and enhancing sensitivity to geometric contours; the Global Local Refine Block (GLRB), which achieves efficient global relationship modeling with an asymptotic linear complexity (O(N)) in spatial dimensions while further refining local features, thereby strengthening boundary perception and improving bubble–background separability; and the Bidirectional Exponential Moving Attention Fusion (BEMAF), which accommodates the multi-scale nature of bubbles by employing a parallel multi-kernel architecture to extract spatial features across scales, coupled with a multi-stage EMA based attention mechanism to enhance detection robustness under weak boundaries and complex backgrounds. Experiments conducted on an Side-Illuminated Light Field Bubble Database (SILB-DB) and a public gas–liquid two-phase flow dataset (GTFD) demonstrate that HSMD-YOLO achieves mAP@50 scores of 0.911 and 0.854, respectively, surpassing mainstream detection methods. Ablation studies indicate that SSB, GLRB, and BEMAF contribute performance gains of 1.3%, 2.0%, and 0.4%, respectively, thereby corroborating the effectiveness of each module for micro-scale object detection.

The construction of partial minimum spanning trees is an NP-hard problem, leading to the development of various heuristic algorithms. Existing heuristics, including Kruskal’s algorithm, frequently employ shortest paths to connect tree components. This study introduces an approximate algorithm for constructing the minimum Steiner tree, which serves as the optimal structure for diffusion multicast. The proposed approach utilizes graph-based structures that provide advantages over conventional shortest-path methods. The algorithm incorporates connections analogous to those in simple Steiner trees when required. These simple trees are represented by hyperedges, and a Hyper Metric Closure can also be applied. Experimental results indicate that this hypergraph-based method enables constructions that more closely approximate the optimal Steiner tree cost compared to traditional pairwise techniques, offering a scalable balance between computational complexity and routing efficiency.

To address the grey target group decision-making method (GDMM) concerning the aggregation of decision-maker information and the approach to ranking alternatives via bidirectional projection (BP), this paper develops a novel methodological framework that optimizes both information integration and alternative evaluation, where a new transformation mechanism between the three-parameter interval grey number (TPIGN) and dual connection number (CN) is established by integrating an induced TPIGN weighted average (ITPIGN-WA) operator with an improved bidirectional projection method (IBPM). The results confirm that the new framework leads to more reliable and effective group decision making (GDM). The new TPIGN conversion mechanism and the set pair potential (SPP)-based ITPIGN-WA better captures decision-maker preferences than previous operators, and the introduction of the IBPM further refines alternative ranking. This dual innovation enriches the theoretical system of grey target decision making and provides significant applied value for enhancing the quality and effectiveness of GDM processes in uncertain environments.

Aiming at solving the problem that existing automatic route-planning algorithms fail to consider the navigation rules in traffic separation scheme (TSS) zones, this paper proposes a ship automatic route-planning algorithm that fully considers TSS-zone navigation constraints. First, a formalized TSS-zone automatic planning module with a quadrilateral decomposition mechanism is designed, which realizes standardized processing of regular TSS zones and completes TSS-compliant route replanning through three core steps: invalid waypoint deletion, TSS-zone-traversal-order determination, and constrained route replanning. Second, a particle swarm optimization (PSO) algorithm is selected as the base global route-planning algorithm via a multi-algorithm comparative framework, considering the requirements of optimality, stability and real-time performance for ship-navigation. The TSS module is deeply integrated with the PSO algorithm, forming a unified global route-planning algorithm that balances TSS compliance and route optimality. Comparative experiments with four mainstream swarm intelligence algorithms (PSO/SSA/IVY/GOA) show that the PSO algorithm outperforms the others in terms of route length, stability and comprehensive efficiency, with an optimal route length of 57.71 and a low standard deviation of 3.42. Furthermore, the proposed algorithm is validated by real nautical chart data of Bohai Bay under single- and double-TSS-zone scenarios. The results indicate that the algorithm can stably generate TSS-compliant routes, with only a small increase in route length (0.6% and 4.4% for a single TSS zone, 1.1% and 1.8% for two TSS zones) and computational time and can automatically adjust the traversal strategy according to the start–end point settings. The designed TSS module has good scalability and can be integrated with other optimization algorithms, providing a feasible technical solution for an intelligent ship navigation system to realize automatic and compliant route planning in TSS zones with dense traffic.

The assignment of hospital rooms to patients is a critical operational decision that has a direct impact on patient safety, infection control, and staff workload. This study introduces HRPM–IRC, an epidemiology-aware hyper-heuristic framework developed to optimize room–patient matching by minimizing the risk of nosocomial infections, reducing travel and specialty mismatch costs, and promoting equitable nurse workload distribution. A mixed-integer linear programming model is formulated to capture infection transmission probabilities, isolation and cohorting requirements, and multi-ward capacity constraints. On top of this model, a bio-inspired hyper-heuristic adaptively selects and refines low-level heuristics, including cohort-first greedy allocation, risk-gradient swaps, and pathogen-aware local MILP refinement, on the basis of contextual epidemiological indicators and reinforcement learning. The framework was validated using a real-world dataset obtained from a tertiary hospital in Lebanon, comprising 142 anonymized patient admissions, 35 rooms, and six nursing teams. Results demonstrate that HRPM–IRC consistently reduces modeled infection risk and workload imbalance by up to forty percent compared to conventional assignment heuristics while maintaining near-real-time decision-making capabilities suitable for dynamic hospital operations. These findings underscore the effectiveness of epidemiology-aware hyper-heuristics in enhancing hospital resilience, improving infection prevention, and supporting fair resource utilization in data-limited healthcare environments typical of Lebanon and other middle-income countries.