Large Language Models (LLMs) face significant memory and latency overheads during long-context inference due to the growing KV cache, especially in Knowledge Base Question Answering (KBQA) settings that require support for multiple downstream queries. Query-aware eviction methods do not generalize across queries, while existing query-agnostic approaches rely on a single proxy query, leading to fragile eviction decisions under high eviction ratios. We propose ContrastKV, a robust query-agnostic KV cache eviction algorithm for multi-query generalization. ContrastKV introduces a contrastive signal fusion mechanism that jointly exploits complementary semantic and non-semantic signals. By contrasting semantic consistency with structural robustness, the method constructs a more reliable eviction criterion that alleviates the blind spots of single-query proxies. The framework integrates efficient signal generation, parallel importance scoring, and multi-level fusion across heads and layers. Experiments show that ContrastKV outperforms state-of-the-art methods, retaining up to 92% accuracy with only 20% of the KV cache budget, while reducing decoding latency by approximately 50% and significantly lowering GPU memory usage.

The progress in Natural Language Processing (NLP) using Large Language Models (LLMs) has greatly improved medical sentiment analysis of patient feedback extraction from health-related question and answer. However, using LLMs to analyze such data often requires significant training data and computational resources, resulting in considerable increases in training costs and durations, which is one of the primary issues in applying LLMs to real-world healthcare scenarios. To tackle these challenges, a novel optimization algorithm named KAdam-EnGPT4LLM, based on Kalman filters and Adaptive Moment Estimation, is proposed to enhance training efficiency and reduce training costs of LLMs for analyzing patient feedback sentiment. Furthermore, the optimization algorithm KAdam-EnGPT4LLM is employed in training the LLM model GPT4ALL for medical sentiment analysis, resulting in the development of GPT4ALL-MediSentAly-KAdam, which leds to faster convergence and more stable training specifically for medical questions and answer in the context of healthcare. The results show that our GPT4ALL-MediSentAly-KAdam with the optimization algorithm KAdam-EnGPT4LLM achieved better performance that include the best Accuracy, Recall, F1-score, and Runtime for both datasets, outperforming traditional fine-tuned LLMs such as the classic GPT4ALL, Ada, Babbage, Curie, and Duvinci.

Accurately segmenting various clinically significant lesion areas from whole-body computed tomography (CT) scans is crucial for automated diagnosis and treatment planning. Training an automatic segmentation model effectively is desirable, but it heavily relies on a large scale of pixel-wise labeled data, which is laborious, time-consuming, and expensive to obtain. Existing weakly-supervised segmentation approaches often struggle with regions nearby the lesion boundaries. This paper proposes a target-level incomplete annotation (TIA) for medical image annotation and a multi-lesion segmentation framework. TIA annotates only one complete target region per slice to accurately capture boundaries with minimal annotated effort. Multi-lesion segmentation framework is a weakly supervised learning method, which first implements a medical cut-paste segmentation branch to provide images with pure target pixels and boundaries for training the lesion segmentation model, second utilizes prior anatomical information in the prior-assisted target localization branch to locate and identify target regions, third generates high-confidence pseudo-labels by combining the outputs of cut-paste segmentation branch and prior-assisted target localization branch. A graph neural network (GNN) is adopted to correct noisy labels and propagate reliably labeled pixels to unlabeled pixels. By utilizing TIA, our framework can achieve state-of-the-art results for medical image segmentation, which is validated on Crohn's dataset.

As the Internet of Things (IoT) and artificial intelligence (AI) technologies are rapidly evolving, smart healthcare has emerged as a transformative solution to enhance healthcare quality and optimize resource allocation. This study introduces FEI-Hi, a federated edge intelligence paradigm that integrates edge computing with federated learning (FL) to enable secure and efficient medical data processing. FEI-Hi comprises three principal layers: FL layer, which facilitates cross-device collaborative training through encrypted model updates; aggregation layer, which refines the global model by consolidating updates; and edge layer, which performs local data processing and model inference. FEI-Hi leverages distributed intelligent computation, model parameter compression, and efficient node clustering to enhance the accuracy and efficiency of medical data processing significantly. By employing Wasserstein distance for clustering and parameter selection, FEI-Hi ensures model convergence and stability. Experimental results on multiple medical datasets demonstrate a 30% improvement in the model training speed and an F1-score exceeding 90%, surpassing the state-of-the-art (SOTA) benchmarks in model parameter transfer efficiency, training speed, and accuracy.

In the 6G-enabled intelligent transportation systems (ITS), each intelligent transportation terminal needs to perform long-distance, low-latency image interaction to ensure real-time information exchange, including real-time vehicular environmental images and various vehicular media images. However, due to high computational cost and large computing resource usage, many learning-driven image compression models are difficult to deploy on intelligent transportation terminals such as edge devices and connected vehicle terminals in the 6G-enabled ITS to reduce the transmission resource consumption of massive image data from ITS. To address the above problems, this paper proposes a high-throughput lightweight Transformer model for image compression tasks on ITS-based intelligent transportation terminals. By constructing a lightweight Transformer combination and reducing the use of Transformer blocks by internally connecting convolutional blocks, the computational cost of the model is reduced. Furthermore, this paper proposes a lightweight Swin Transformer module, which further reduces the resources required for model calculation by directly connecting window multi-head self-attention (W-MSA) and shifted window multi-head self-attention (SW-MSA). In addition, this paper designs a simplified entropy model, which speeds up the execution time of the entropy model and improves the throughput of the overall network model by directly fusing the latent representation of the images. Experimental results show that our proposed model has significantly improved throughput and execution time compared with the state-of-the-art models on two ITS public datasets.

Beyond 5G-enabled edge computing networking (ECN) will further deploy computing and communication resources to the edge of the networks. Then, edge service demands for Internet of Things (IoT) applications are becoming more and more diverse, while the corresponding routing service capability is limited and not flexible enough to deal with the demands of ECN, which then leads to reducing the inherent routing capability of ECN. It becomes extremely difficult for ECN to support diversified demands and provide diverse IoT applications quickly and flexibly. In this article, we propose a novel and customized deep routing mechanism for IoT applications in ECN, in which the network slicing and deep learning methods are jointly applied and leveraged. First, we design a new ECN architecture that formulates four kinds of network slices to cope with various IoT scenarios, which are eMBB, uRLLC, mMTTC, and backup slices. Second, using these slices, we can customize the ECN environment flexibly, based on which we propose the corresponding routing method for the purpose of fast and efficient service delivery. In particular, the mapping between network slices and the infrastructure is established with the object of maximizing the resource utilization. Then, the routing is designed and customized by using the deep learning model. Lastly, the experimental results show that the deep customized mechanism designed in this article can reduce the average loss rate of the model, decrease the average delay, as well as improve the average resource utilization compared with the existing studies.

The precise observation of thunderstorm charge motion remains challenging due to the limitations of single-modal remote sensing techniques. This paper proposes a novel multimodal remote sensing framework integrating radar echo intensity (REI) and atmospheric electric field (AEF) data for three-dimensional (3D) charge localization. Our approach tackles critical challenges in meteorological remote sensing by introducing a high-precision spatiotemporal calibration protocol to align high-frequency AEF with low-frequency radar scans, along with physics-constrained feature fusion that incorporates an AEF-REI interaction term to enhance robustness. We develop a Bayesian-optimized random forest model to improve localization accuracy under non-stationary conditions. Validated via 3D charge trajectory reconstruction, our method achieves strong consistency with radar-observed storm core movements, demonstrating its potential as a new remote sensing paradigm for thunderstorm monitoring.

In the context of vehicle-road-cloud integration, multi-vehicle platooning systems have become an important approach for improving road traffic efficiency, driver comfort, driving safety, energy consumption, and mitigating traffic congestion. However, under high-speed mobility, Vehicle-to-Vehicle (V2V) communication within multi-vehicle platoons is susceptible to delays caused by interference and the inherent uncertainties of wireless communication channels. These delays present considerable challenges to achieving effective multi-vehicle cooperative control. To overcome the limitations of existing research, this paper proposes a joint communication and control optimization strategy for multi-vehicle platooning systems. A novel spacing error metric is introduced, which uses the real-time velocity of each vehicle to improve the platooning system responsiveness. Furthermore, we derive the Signal-to-Interference-plus-Noise Ratio (SINR) threshold to ensure the stability and reliability of the platoon. This ensures safe distances and synchronized speeds among all vehicles, even when communication delays occur. Finally, the proposed joint optimization strategy is validated through performance comparisons, demonstrating its effectiveness and superior performance.

In the era of large-scale machine learning, largescale clusters are extensively used for data processing jobs. However, the state-of-the-art heuristic-based and Deep Rein-forcement Learning (DRL) based job scheduling mechanisms are facing challenges such as slow training speed and underexploitation of jobs' complex dependencies. We propose MPDA, a Massively Parallel learning and Dependency-Aware scheduling algorithm, consisting of a fast-training mechanism and a novel dependency-aware policy network, GATNetwork, to address these two challenges respectively. The fast-training mechanism is a two-level massively parallel training method that can significantly accelerate the training process and maximally utilize the resources of the cluster. Additionally, its decoupled learning and interacting design enables hybrid-workload training for MPDA, which guarantees the generalization and robustness of MPDA. The GATNetwork exploits the dependencies among stages/jobs using Graph Attention Network (GAT) and Long Short-Term Memory (LSTM) networks to improve the performance of the scheduling policy. The experiments show that MPDA accelerates the training speed by one to two orders of magnitude and achieves better scheduling performance, i.e., lower average job completion time, compared with existing scheduling algorithms.

Existing IoT Network Anomaly Detection Systems (NADSes) typically treat IoT devices as independent entities and model them by Euclidean space features. These approaches suffer from low accuracies on new attacks (e.g., platform-based attacks and evasion attacks), since they do not fully consider the semantic information including traffic periodicity and device/environment interactions. In this paper, we propose SeIoT, a knowledge graph-based bimodal anomaly detection framework for smart homes. We propose a knowledge graph structure to represent the semantic information of a smart home. First, we propose the Action Fingerprint module, an efficient and effective traffic classification approach to extract the device actions and features required by the knowledge graph. Then, we propose a bimodal anomaly detection framework including interaction-related and time-related detectors to detect the knowledge graph. We propose a feature separation-based heterogeneous graph attention network that can accurately model the interactions among devices and environments, and a method to represent traffic periodicity for the time-related detector. For evaluation, we set up a real-world testbed and evaluate the detection performance of both device-targeted attacks and platform-based attacks. Experiment results show that SeIoT can achieve better detection capability than prior work on both of the attacks.

With the rapid advances in digital imaging and communication technologies, recently image set classification has attracted significant attention and has been widely used in many real-world scenarios. As an effective technology, the class-specific representation theory-based methods have demonstrated their superior performances. However, this type of methods either only uses one gallery set to measure the gallery-to-probe set distance or ignores the inner connection between different metrics, leading to the learned distance metric lacking robustness, and is sensitive to the size of image sets. In this article, we propose a novel joint metric learning-based class-specific representation framework (JMLC), which can jointly learn the related and unrelated metrics. By iteratively modeling probe set and related or unrelated gallery sets as affine hull, we reconstruct this hull sparsely or collaboratively over another image set. With the obtained representation coefficients, the combined metric between the query set and the gallery set can then be calculated. In addition, we also derive the kernel extension of JMLC and propose two new unrelated set constituting strategies. Specifically, kernelized JMLC (KJMLC) embeds the gallery sets and probe sets into the high-dimensional Hilbert space, and in the kernel space, the data become approximately linear separable. Extensive experiments on seven benchmark databases show the superiority of the proposed methods to the state-of-the-art image set classifiers.

Feature selection aims to select strongly relevant features and discard the rest. Recently, embedded feature selection methods, which incorporate feature weights learning into the training process of a classifier, have attracted much attention. However, traditional embedded methods merely focus on the combinatorial optimality of all selected features. They sometimes select the weakly relevant features with satisfactory combination abilities and leave out some strongly relevant features, thereby degrading the generalization performance. To address this issue, we propose a novel embedded framework for feature selection, termed feature selection boosted by unselected features (FSBUF). Specifically, we introduce an extra classifier for unselected features into the traditional embedded model and jointly learn the feature weights to maximize the classification loss of unselected features. As a result, the extra classifier recycles the unselected strongly relevant features to replace the weakly relevant features in the selected feature subset. Our final objective can be formulated as a minimax optimization problem, and we design an effective gradient-based algorithm to solve it. Furthermore, we theoretically prove that the proposed FSBUF is able to improve the generalization ability of traditional embedded feature selection methods. Extensive experiments on synthetic and real-world data sets exhibit the comprehensibility and superior performance of FSBUF.

It is time consuming to train support vector regression (SVR) for large-scale problems even with efficient quadratic programming solvers. This issue is particularly serious when tuning the model's parameters. One way to address the issue is to reduce the problem's scale by selecting a subset of the training set. This paper presents a fast pattern selection method by scanning the training data set to reduce a problem's scale. In particular, we find the k-nearest neighbors (kNNs) in a local region around each pattern's target value, and then determine to retain the pattern according to the distribution of its nearest neighbors. There is a high probability that the pattern locates outside the -tube. Since the kNNs of a pattern are found in a very small region, it is fast to scan the whole training data set. The proposed method deals with the year prediction Million Song Data set, which contains 463 715 patterns, within 10 s on a personal computer with an Intel Core i5-4690 CPU at 3.50 GHz and 8GB DRAM. An additional advantage of the proposed method is that it can predefine the size of the selected subset according to the training set. Comprehensive empirical evaluations demonstrate that the proposed method can significantly eliminate redundant patterns for SVR training with only a slight decrease in performance.