检索结果-内蒙古大学图书馆

OblivTime: Oblivious and Efficient Interval Skyline Query Processing Over Encrypted Time-Series data

IEEE Transactions on Services computing 2025年

作者： Ouyang, Huajie Zheng, Yifeng Wang, Songlei Hua, Zhongyun Harbin Institute of Technology School of Computer Science and Technology Guangdong Shenzhen518055 China The Hong Kong Polytechnic University Department of Electrical and Electronic Engineering Hong Kong Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518055 China

Time-series data is prevalent in many applications like smart homes, smart grids, and healthcare. And it is now increasingly common to store and query time-series data in the cloud. Despite the benefits, data privacy concerns in such outsourced services are pressing, making it imperative to embed privacy assurance mechanisms from the outset. Most existing related works have been focused on querying for different types of aggregate statistics. In this paper, we instead focus on the secure support for advanced interval skyline queries, which allow to identify time series that are not dominated by any other time series within a query time interval. This is valuable for time-series data analytics in applications like remote health monitoring (e.g., identifying patients with high heart rates in a certain week). We present OblivTime, a new system framework for oblivious and efficient interval skyline query processing over encrypted time-series data. OblivTime is built from a synergy of time-series data analytics, lightweight cryptography, and GPU parallel computing, achieving stronger security guarantees and lower online query latency over the state-of-the-art prior work. Extensive experiments demonstrate that OblivTime can achieve up to 666\times speedup in online query latency over the state-of-the-art prior work. © 2008-2012 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy 23

ACGraph: Accelerating Streaming Graph Processing via Depende...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Zihan Jiang Fubing Mao Yapu Guo Xu Liu Haikun Liu Xiaofei Liao Hai Jin Wei Zhang National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electronic and Computer Engineering HKUST Hong Kong

ISBN: (纸本)9798350323481

Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates. To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms. It maintains dependence trees during runtime, and makes affected vertices processed in a top-to-bottom order in the hierarchy of the dependence trees, thus normalizing the state propagation order and coalescing of multiple propagation to the same vertices. Experimental results show that ACGraph reduces the number of updates by 50% on average, and achieves the speedup of 1.75~7.43× over state-of-the-art systems.

关键词： graph processing

来源：评论

学校读者我要写书评

暂无评论

PSMiner: A Pattern-Aware Accelerator for High-Performance Streaming Graph Pattern Mining 23

PSMiner: A Pattern-Aware Accelerator for High-Performance St...

引用

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Hao Qi Yu Zhang Ligang He Kang Luo Jun Huang Haoyu Lu Jin Zhao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China and Zhejiang-HUST Joint Research Center for Graph Processing Zhejiang Lab China Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798350323481

Streaming Graph Pattern Mining (GPM) has been widely used in many application fields. However, the existing streaming GPM solution suffers from many unnecessary explorations and isomorphism tests, while the existing static GPM ones require many repetitive operations to compute the full graph. In this paper, we propose a pattern-aware incremental execution approach and design the first streaming GPM accelerator called PSMiner, which integrates multiple optimizations to reduce redundant computation and improve computing efficiency. We have conducted extensive experiments. The results show that compared with the state-of-the-art software and hardware solutions, PSMiner achieves the average speedups of 770.9× and 60.4×, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

KubeSPT: Stateful Pod Teleportation for Service Resilience with Live Migration

引用

IEEE Transactions on Services computing 2025年

作者： Zhang, Hansheng Wu, Song Fan, Hao Huang, Zhuo Xue, Weibin Yu, Chen Ibrahim, Shadi Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong China

Container orchestration systems, such as Kubernetes, streamline containerized application deployment. As more and more applications are being deployed in Kubernetes, there is an increasing need for rescheduling - relocating a running pod to different nodes - due to system upgrades, node failures, and load-balancing optimizations. Live migration, which transfers services from source nodes to target nodes with minimal downtime, is the ideal support for rescheduling. However, implementing live migration for pods that run stateful services is challenging, because Kubernetes manages pods as stateless. First, the current pod's network namespace initialization process causes a mismatch in the network state between the migrated pod and internal containers. Second, migrating the memory state results in extended downtime. Third, Kubernetes operations on pods do not consider preserving the state of the pods. Therefore, we propose KubeSPT to achieve live migration of stateful pods in rescheduling scenarios. Firstly, we synchronize the network state of pods and internal containers by controlling packet flow and implement fast service redirection. Secondly, we introduce a Hot data and Lazy-Restore method for memory restoration to reduce migration downtime. Finally, we decouple pod migration operations from other Kubernetes operations to ensure compatibility with live migration. Experimental results show that KubeSPT reduces downtime by 86%-93% compared to current rescheduling methods. © 2008-2012 IEEE.

关键词： Cloud Kubernetes Live Migration Pod

来源：评论

学校读者我要写书评

暂无评论

FedEAT: A Robustness Optimization Framework for Federated LLMs

arXiv

引用

arXiv 2025年

作者： Pang, Yahao Wu, Xingyuan Zhang, Xiaojin Chen, Wei Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Huazhong University of Science and Technology Wuhan China

Significant advancements have been made by Large Language Models (LLMs) in the domains of natural language understanding and automated content creation. However, they still face persistent problems, including substantial computational costs and inadequate availability of training data. The combination of Federated Learning (FL) and LLMs (federated LLMs) offers a solution by leveraging distributed data while protecting privacy, which positions it as an ideal choice for sensitive domains. However, Federated LLMs still suffer from robustness challenges, including data heterogeneity, malicious clients, and adversarial attacks, which greatly hinder their applications. We first introduce the robustness problems in federated LLMs, to address these challenges, we propose FedEAT (Federated Embedding space Adversarial Training), a novel framework that applies adversarial training in the embedding space of client LLM and employs a robust aggregation approach, specifically geometric median aggregation, to enhance the robustness of Federated LLMs. Our experiments demonstrate that FedEAT effectively improves the robustness of Federated LLMs with minimal performance loss. © 2025, CC BY.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

Working Smarter Not Harder: Hybrid Cooling for Deep Learning in Edge datacenters

IEEE Transactions on Sustainable Computing

引用

IEEE Transactions on Sustainable computing 2025年

作者： Pei, Qiangyu Yuan, Yongjie Hu, Haichuan Wang, Lin Zhang, Dong Yan, Bingheng Yu, Chen Liu, Fangming Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology 1037 Luoyu Road Wuhan430074 China Paderborn University TU Darmstadt Germany Jinan Inspur Data Co. Ltd. China Huazhong University of Science and Technology Peng Cheng Laboratory China

The proliferation of deep-learning-based mobile and IoT applications has driven the increasing deployment of edge datacenters equipped with domain-specific accelerators. The unprecedented computing power offered by these accelerators puts a heavy burden on the cooling system, motivating more potent cooling techniques like cold water cooling. However, we observe that cold water cooling results in significant energy waste in edge datacenters due to the fluctuating resource utilization both spatially and temporally. To tackle this issue, we propose the concept of "working smarter"by slowing down accelerators deliberately whenever possible and enabling warm water cooling during these times to achieve cooling efficiency. Based on this concept, we develop Hyco - a hybrid water cooling system tailored for edge datacenters running deep learning workloads. First, Hyco features a zone-based cooling architecture enabling dynamic switching between cold water and warm water cooling. Then, based on a lightweight latency estimation method, Hyco incorporates a learning-based scheduling scheme to determine "which"accelerator workers and "when"to slow down through an adaptive and intelligent power-latency trade-off for deep learning models. The simulation with real-world traces shows that Hyco reduces the cooling energy consumption by up to 34.74× while satisfying latency constraints more than 99% of the time for deep-learning-based applications. © 2016 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

EagerLog: Active Learning Enhanced Retrieval Augmented Generation for Log-based Anomaly Detection

EagerLog: Active Learning Enhanced Retrieval Augmented Gener...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Duan, Chiming Jia, Tong Yang, Yong Liu, Guiyang Liu, Jinbu Zhang, Huxing Zhou, Qi Li, Ying Huang, Gang School of Software and Microelectronics Peking University Beijing China Institute for Artificial Intelligence Peking University Beijing China National Engineering Research Center for Software Engineering Peking University Beijing China National Key Laboratory of Data Space Technology and System Beijing China Alibaba Cloud Computing Company Hangzhou China

ISBN: (纸本)9798350368741

Logs record essential information about system operations and serve as a critical source for anomaly detection, which has generated growing research interest. Utilizing large language models (LLMs) within a retrieval-augmented generation (RAG) framework for log-based anomaly detection is an effective approach due to its strong generalization capabilities and efficient few-shot performance. However, the effectiveness of this method hinges on the quality of the knowledge source, which can be impacted by noise and changes within the software systems. Facing these problems, in this paper, we propose a novel log-based anomaly detection method named EagerLog, employing active learning to choose the logs for humans to label, thereby adding them to the knowledge source, thus enhancing the knowledge source and maintaining its quality. Our experiments on three open datasets (BGL, Thunderbird, Zookeeper) and one industrial dataset demonstrate that EagerLog can achieve 93.65% F1 score with approximately 10 labeled log sequences, surpassing existing methods by 15.32%. © 2025 IEEE.

关键词： Active Learning Anomaly Detection Log Analysis Retrieval Augmented Generation

来源：评论

学校读者我要写书评

暂无评论

FedHM: Efficient federated learning for heterogeneous models via low-rank factorization

引用

Artificial Intelligence 2025年 344卷

作者： Yao, Dezhong Pan, Wanning Shi, Yuexin O'Neill, Michael J. Dai, Yutong Wan, Yao Zhao, Peilin Jin, Hai Sun, Lichao National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China University of North Carolina Chapel Hill United States Lehigh University United States Tencent AI Lab China

One underlying assumption of recent Federated Learning (FL) paradigms is that all local models share an identical network architecture. However, this assumption is inefficient for heterogeneous systems where devices possess varying computation and communication capabilities. The presence of such heterogeneity among devices negatively impacts the scalability of FL and slows down the training process due to the existence of stragglers. To this end, this paper proposes a novel federated compression framework for heterogeneous models, named FedHM, distributing the heterogeneous low-rank models to clients and then aggregating them into a full-rank global model. Furthermore, FedHM significantly reduces communication costs by utilizing low-rank models. Compared with state-of-the-art heterogeneous FL methods under various FL settings, FedHM is superior in the performance and robustness of models with different sizes. Additionally, the convergence guarantee of FL for heterogeneous devices is first theoretically analyzed. © 2025 The Authors

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：