Graph convolutional networks (GCNs) are a promising approach for addressing the necessity for long-range information in hyperspectral image (HSI) classification. Researchers have attempted to develop classification methods that combine strong generalizations with effective classification. However, the current HSI classification methods based on GCN present two main challenges. First, they overlook the multi-view features inherent in HSIs, whereas multi-view information interacts with each other to facilitate classification tasks. Second, many algorithms perform a rudimentary fusion of extracted features, which can result in information redundancy and conflicts. To address these challenges and exploit the strengths of multiple features, this paper introduces an adaptive multi-feature fusion GCN (AMF-GCN) for HSI classification. Initially, the AMF-GCN algorithm extracts spectral and textural features from the HSIs and combines them to create fusion features. Subsequently, these three features are employed to construct separate images, which are then processed individually using multi-branch GCNs. The AMG-GCN aggregates node information and utilizes an attention-based feature fusion method to selectively incorporate valuable features. We evaluated the model on three widely used HSI datasets, i.e., Pavia University, Salinas, and Houston-2013, and achieved accuracies of 97.45%, 98.03%, and 93.02%, respectively. Extensive experimental results show that the classification performance of the AMF-GCN on benchmark HSI datasets is comparable to those of state-of-the-art methods.

Hyperspectral imagery (HSI) has demonstrated significant potential in remote sensing applications because of its abundant spectral and spatial information. However, current mainstream hyperspectral image classification models are generally characterized by high computational complexity, structural intricacy, and a strong reliance on training samples, which poses challenges in meeting application demands under resource-constrained conditions. To this end, a lightweight hyperspectral image classification model inspired by bionic design, named BioLiteNet, is proposed, aimed at enhancing the model’s overall performance in terms of both accuracy and computational efficiency. The model is composed of two key modules: BeeSenseSelector (Channel Attention Screening) and AffScaleConv (Scale-Adaptive Convolutional Fusion). The former mimics the selective attention mechanism observed in honeybee vision for dynamically selecting critical spectral channels, while the latter enables efficient fusion of spatial and spectral features through multi-scale depthwise separable convolution. On multiple hyperspectral benchmark datasets, BioLiteNet is shown to demonstrate outstanding classification performance while maintaining exceptionally low computational costs. Experimental results show that BioLiteNet can maintain high classification accuracy across different datasets, even when using only a small amount of labeled samples. Specifically, it achieves overall accuracies (OA) of 90.02% ± 0.97%, 88.20% ± 5.26%, and 78.64% ± 7.13% on the Indian Pines, Pavia University, and WHU-Hi-LongKou datasets using just 5% of samples, 10% of samples, and 25 samples per class, respectively. Moreover, BioLiteNet consistently requires fewer computational resources than other comparative models. The results indicate that the lightweight hyperspectral image classification model proposed in this study significantly reduces the requirements for computational resources and storage while ensuring classification accuracy, making it well-suited for remote sensing applications under resource constraints. The experimental results further support these findings by demonstrating its robustness and practicality, thereby offering a novel solution for hyperspectral image classification tasks.

Accurate segmentation of the stem of pumpkin seedlings has a great influence on the modernization of pumpkin cultivation, and can provide detailed data support for the growth of pumpkin plants. We collected and constructed a pumpkin seedling point cloud dataset for the first time. Potting soil and wall background in point cloud data often interfere with the accuracy of partial cutting of pumpkin seedling stems. The stem shape of pumpkin seedlings varies due to other environmental factors during the growing stage. The stem of the pumpkin seedling is closely connected with the potting soil and leaves, and the boundary of the stem is easily blurred. These problems bring challenges to the accurate segmentation of pumpkin seedling point cloud stems. In this paper, an accurate segmentation algorithm for pumpkin seedling point cloud stems based on CPHNet is proposed. First, a channel residual attention multilayer perceptron (CRA-MLP) module is proposed, which suppresses background interference such as soil. Second, a position-enhanced self-attention (PESA) mechanism is proposed, enabling the model to adapt to diverse morphologies of pumpkin seedling point cloud data stems. Finally, a hybrid loss function of cross entropy loss and dice loss (HCE-Dice Loss) is proposed to address the issue of fuzzy stem boundaries. The experimental results show that CPHNet achieves a 90.4% average cross-to-merge ratio (mIoU), 93.1% average accuracy (mP), 95.6% average recall rate (mR), 94.4% F1 score (mF1) and 0.03 plants/second (speed) on the self-built dataset. Compared with other popular segmentation models, this model is more accurate and stable for cutting the stem part of the pumpkin seedling point cloud.

We introduce a novel optimization method, the Bud Lifecycle Algorithm (BLA), and present a mathematical model for optimizing urban transportation systems, demonstrated through a Baltimore case study. Our approach centers on the Proximity Topology Attribute Model, which integrates topological graph properties with K-means clustering to partition city nodes and identify key activity areas via betweenness centrality. A simulated bridge collapse reveals significant impacts on insurance companies and transport users. To balance traffic efficiency with construction costs in public transport projects, we propose a multi-objective optimization model prioritizing transit hubs while minimizing expenses in congested zones. We introduce the Bud Lifecycle Algorithm (BLA) to enhance traditional Genetic Algorithm performance, achieving improvements in system coverage, cost-efficiency, and user satisfaction. Our findings suggest that expanding public transport networks and optimizing rail projects could substantially boost employment and tourism in West Baltimore. We propose the Smart Traffic Management System (STMS) and Community Traffic Safety Program (CTSP) to enhance traffic safety, reduce congestion, and improve residents’ quality of life.

Query–service matching in customer service systems faces a critical challenge of accurately aligning user queries expressed in colloquial language with formally defined services while balancing business objectives. Traditional keyword-based and embedding approaches fail to capture complex semantic nuances and cannot provide interpretable explanations. We address this problem by proposing a novel reasoning-enhanced framework that leverages large language models (LLMs) for structured multi-criteria evaluation. Our key innovation is a reasoning-first scoring architecture where the model generates detailed explanations before numerical scores, reducing score variance by 18% through conditional mutual information. We introduce a controlled stochastic perturbation mechanism with theoretically derived optimal parameters that balance diversity and relevance, alongside a knowledge distillation pipeline enabling 960× model compression (480B→0.5B parameters) while retaining 94% performance. Rigorous theoretical analysis establishes Pareto optimality guarantees for multi-criteria evaluation, information-theoretic entropy reduction bounds, and PAC learning guarantees for distillation. Experimental validation on real-world telecommunications data demonstrates 89% Precision@1 (15.3% improvement over baselines), 23% diversity enhancement, and 96× latency reduction, with deployment cost decreasing 1200× compared to direct LLM inference. This work bridges the gap between LLM capabilities and production deployment requirements through principled mathematical foundations and practical system design.