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

Application-Oriented Cloud Workload Prediction:A Survey and New Perspectives

Tsinghua Science and technology 2025年第1期30卷 34-54页

作者： Binbin Feng Zhijun Ding Key Laboratory of Embedded System and Service Computing Ministry of EducationDepartment of Computer Science and TechnologyTongji UniversityShanghai 201804China Key Laboratory of Embedded System and Service Computing Ministry of EducationTongji UniversityDepartment of Computer Science and TechnologyTongji UniversityShanghai 201804China Shanghai Artificial Intelligence Laboratory Shanghai 200232China

Workload prediction is critical in enabling proactive resource management of cloud *** workload prediction is valuable for cloud users and providers as it can effectively guide many practices,such as performance assurance,cost reduction,and energy consumption ***,cloud workload prediction is highly challenging due to the complexity and dynamics of workloads,and various solutions have been proposed to enhance the prediction *** paper aims to provide an in-depth understanding and categorization of existing solutions through extensive literature *** existing surveys,for the first time,we comprehensively sort out and analyze the development landscape of workload prediction from a new perspective,i.e.,application-oriented rather than prediction methodologies per ***,we first introduce the basic features of workload prediction,and then analyze and categorize existing efforts based on two significant characteristics of cloud applications:variability and ***,we also investigate how workload prediction is applied to resource ***,open research opportunities in workload prediction are highlighted to foster further advancements.

关键词： cloud computing workload prediction resource management artificial intelligence for IT operations(AIOps)

来源：评论

学校读者我要写书评

暂无评论

3DGCformer: 3-Dimensional Graph Convolutional transformer for multi-step origin–destination matrix forecasting

引用

Applied Intelligence 2025年第6期55卷 1-18页

作者： Huang, Yiou Deng, Hao Zhao, Shengjie School of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

Forecasting Human mobility is of great significance in the simulation and control of infectious diseases like COVID-19. To get a clear picture of potential future outbreaks, it is necessary to forecast multi-step Origin–Destination (OD) matrices for a relatively long period in the future. However, multi-step Origin–Destination Matrix Forecasting (ODMF) is a non-trivial problem. First, previous ODMF models only forecast the OD matrix for the next time-step, and they cannot perform well on long-term multi-step forecasts due to error accumulation. Second, many ODMF methods capture spatial and temporal dependencies with separate modules, which is insufficient to model spatio-temporal correlations in the time-varying OD matrix sequence. To address the challenges in multi-step ODMF, we propose 3-Dimensional Graph Convolutional Transformer (3DGCformer). As an enhancement of the original 3DGCN, we propose a novel Origin–Destination Feature Propagation (ODFP) rule between 3DGCN layers and integrate 2 3DGCNs with different spatio-temporal graphs and corresponding feature propagation rules to model the formation of OD flows in a more comprehensive way. For multi-step forecasts, 3DGCformer uses Transformer to capture long-term global temporal dependency, and adapt its decoder using labeled tokens to avoid error accumulation and improve time efficiency. To avoid information loss as the number of regions increases, we propose a patch embedding approach to convert data from 3DGCNs to the Transformer module. We perform extensive experiments on 4 real-world human mobility datasets, and the results show that our proposed model outperforms the state-of-the-art methods. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

OUTLIER SYNTHESIS VIA HAMILTONIAN MONTE CARLO FOR OUT-OF-DISTRIBUTION DETECTION

arXiv

引用

arXiv 2025年

作者： Li, Hengzhuang Zhang, Teng National Engineering Research Center for Big Data Technology and System Service Computing Technology and Systems Laboratory Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Out-of-distribution (OOD) detection is crucial for developing trustworthy and reliable machine learning systems. Recent advances in training with auxiliary OOD data demonstrate efficacy in enhancing detection capabilities. Nonetheless, these methods heavily rely on acquiring a large pool of high-quality natural outliers. Some prior methods try to alleviate this problem by synthesizing virtual outliers but suffer from either poor quality or high cost due to the monotonous sampling strategy and the heavy-parameterized generative models. In this paper, we overcome all these problems by proposing the Hamiltonian Monte Carlo Outlier Synthesis (HamOS) framework, which views the synthesis process as sampling from Markov chains. Based solely on the in-distribution data, the Markov chains can extensively traverse the feature space and generate diverse and representative outliers, hence exposing the model to miscellaneous potential OOD scenarios. The Hamiltonian Monte Carlo with sampling acceptance rate almost close to 1 also makes our framework enjoy great efficiency. By empirically competing with SOTA baselines on both standard and large-scale benchmarks, we verify the efficacy and efficiency of our proposed HamOS. Our code is available at: https://***/Fir-lat/HamOS_OOD. © 2025, CC BY.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

Binary-Encoding-Based Quantized Kalman Filter: An Approximate MMSE Approach

引用

IEEE Transactions on Automatic Control 2025年第5期70卷 3181-3196页

作者： Liu, Qinyuan Nie, Yao Wang, Zidong Dong, Hongli Jiang, Changjun Tongji University School of Computer Science and Technology Shanghai201804 China Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Tongji University Shanghai Artificial Intelligence Laboratory Shanghai201804 China Brunel University London Department of Computer Science UxbridgeUB8 3PH United Kingdom Northeast Petroleum University Artificial Intelligence Energy Research Institute Daqing163318 China Northeast Petroleum University Heilongjiang Provincial Key Laboratory of Networking and Intelligent Control Daqing163318 China

In this article, the Kalman filter design problem is investigated for linear discrete-time systems under binary encoding schemes. Under such a scheme, the local information is quantized into a bit string by the remote sensor based on a probabilistic quantizer, and then the bit string is transmitted via memoryless binary symmetric channels (BSCs). Due to the communication link noises, the bit flipping occurs in a random manner, and thus, the transmission of the bit string would suffer from specific bit-error rates. With the received bits, a recursive binary-encoding-based quantized Kalman filter is established in the approximate minimum mean-square error (MMSE) sense, which relies on the Gaussian approximation of the conditional probability density function at each iteration. Furthermore, the proposed estimator is shown to be of a Kalman-like type through performance analysis, which exhibits computational complexity comparable to the conventional Kalman filter. Subsequently, a posterior Cramér-Rao lower bound is derived for the proposed binary-encoding-based quantized Kalman filter. The effectiveness of the proposed estimator is demonstrated through numerical results. © 1963-2012 IEEE.

关键词： Mean square error

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Architecture Search for Deep Graph Neural Networks

引用

IEEE Transactions on Big Data 2025年

作者： Dong, Yukang Pan, Fanxing Gui, Yi Jiang, Wenbin Wan, Yao Zheng, Ran Jin, Hai National Engineering Research Center for Big Data Technology Huazhong University of Science and Technology Wuhan430074 China Huazhong University of Science and Technology Service Computing Technology and System Laboratory Wuhan430074 China Huazhong University of Science and Technology Cluster and Grid Computing Laboratory Wuhan430074 China Huazhong University of Science and Technology School of Computer Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China

In recent years, Neural Architecture Search (NAS) has emerged as a promising approach for automatically discovering superior model architectures for deep Graph Neural Networks (GNNs). Different methods have paid attention to different types of search spaces. However, due to the time-consuming nature of training deep GNNs, existing NAS methods often fail to explore diverse search spaces sufficiently, which constrains their effectiveness. To crack this hard nut, we propose CAS-DGNN, a novel comprehensive architecture search method for deep GNNs. It encompasses four kinds of search spaces that are the composition of aggregate and update operators, different types of aggregate operators, residual connections, and hyper-parameters. To meet the needs of such a complex situation, a phased and hybrid search strategy is proposed to accommodate the diverse characteristics of different search spaces. Specifically, we divide the search process into four phases, utilizing evolutionary algorithms and Bayesian optimization. Meanwhile, we design two distinct search methods for residual connections (All-connected search and Initial Residual search) to streamline the search space, which enhances the scalability of CAS-DGNN. The experimental results show that CAS-DGNN achieves higher accuracy with competitive search costs across ten public datasets compared to existing methods. © 2015 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

A two-way dynamic adaptive pricing resource allocation model based on combinatorial double auctions in computational network

引用

Computer Communications 2025年 238卷

作者： Xu, Yanjun Tian, Chunqi Wang, Wei Bai, Lizhi Xia, Xuhui School of Computer Science and Technology Tongji University Shanghai China School of Data Science and Engineering East China Normal University Shanghai China Embedded System and Service Computing Key Laboratory of Ministry of Education China

Efficient resource allocation in computing networks is essential for managing fluctuating demands and optimizing system performance. Traditional auction and pricing models often fail to adapt to diverse demands and supply–demand fluctuations, resulting in inefficiencies. This paper proposes a bidirectional price-adaptive bundled resource auction model that considers not only the autonomous adjustment of sellers’ quotations in response to supply–demand fluctuations but also the impact of these fluctuations on buyers’ willingness to pay and bidding behavior. The model integrates Combinatorial Double Auction (CDA) mechanism and Genetic Algorithm (GA), constructing a bundled resource auction mechanism that accommodates diverse resource demands and an adaptive pricing strategy that dynamically responds to real-time supply–demand variations. This approach enhances resource allocation accuracy in dynamic and competitive computing network environments. Furthermore, a reserve price mechanism and a delay compensation strategy are introduced to ensure that the proposed mechanism satisfies individual rationality, budget balance, and incentive compatibility while maintaining computational efficiency. Simulation results demonstrate that, compared to traditional methods, the proposed model not only improves allocation efficiency and enhances resource utilization but also helps reduce operational costs. Specifically, resource allocation dispersion decreases by 4.26%, while service providers’ revenue increases by 7.47%. This study provides a scalable and adaptive solution for dynamic resource allocation in cloud and edge computing platforms. It contributes significantly to the development of resource management and flexible pricing strategies in markets characterized by diverse demands and fluctuating conditions. © 2025

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Personalized Medical Federated Learning Based on Mutual Knowledge Distillation in Object Heterogeneous Environment 1st

Personalized Medical Federated Learning Based on Mutual Kno...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Ni, Lina Song, Chenglin Zhao, Hanmo Tang, Yuncan Ma, Yunshen Zhang, Jinquan College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9789819794119

Federated Learning (FL), hailed as a potent approach in merging medical expertise, promises to elevate collaborative efforts among healthcare institutions while safeguarding the privacy and security of sensitive medical data, thereby energizing the trajectory of intelligent healthcare advancements. However, the diversity in training objectives across medical institutions can diminish their active participation in a unified federated training process. To address this issue of waning enthusiasm due to diverse training goals, in this paper, we propose Personalized Medical Federated Learning method based on Mutual Distillation Knowledge (pFedMKD). Specifically, we propose a similarity-based mutual distillation model selection algorithm that reduces interference among medical institutions with notably diverse data distributions. Moreover, we develop a server-side local model update method leveraging mutual knowledge distillation, enabling each local model to gain beneficial insights for personalization from analogous models. Additionally, we formulate a personalized model update method utilizing knowledge distillation from specifically labeled samples, thereby improving the performance of personalized models. Experimental results demonstrate that compared to the baseline algorithm, pFedMKD can more effectively address the target heterogeneity problem among different medical institutions, enabling each institution to achieve higher personalized performance in federated learning tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Adaptive Federated Learning Based on Device Performance in a Heterogeneous Environment of Medical computing Devices 1st

Adaptive Federated Learning Based on Device Performance in...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Zhang, Jinquan Wang, Chongbo Yang, Rendong Tang, Yuncan Ma, Yunshen Ni, Lina College of Computer Science and Engineering Shandong University of Science and Technology Qingdao266590 China Key Laboratory of the Ministry of Education for Embedded System and Service Computing Tongji University Shanghai201804 China

ISBN: (纸本)9789819794119

Federated Learning (FL), as one of the effective methods to solve the problem of medical data silos, can promote mutual cooperation among medical institutions under the premise of safeguarding the privacy and security of medical data, and effectively promote the development of intelligent medical treatment. However, the characteristics of medical data with multiple sources and heterogeneity bring certain challenges to the application of federated learning in the medical field. Due to the wide range of medical data sources, some medical institutions are unable to complete the federated learning training task on time due to the limitation of device performance, which leads to the failure of federated learning training. To address the problem of heterogeneity of computing devices among medical institutions that may cause some clients to fall behind, we propose an Adaptive Federated Learning based on Device Performance (AFedDP) method. Specifically, we design an adaptive local model training method to reduce the computational burden of medical institutions with poor equipment performance in the local model training process by adaptively constructing a local training model. Additionally, we propose a hierarchical model aggregation algorithm based on dynamic weight. This allows the heterogeneous adaptive local model to actively participate in the global model aggregation, making full use of the local data of each medical institution and improving the performance of the global model. Finally, we design an aggregation weight update algorithm based on momentum optimization to enhance the stability of global model aggregation. This algorithm updates contribution and aggregation weight with the idea of momentum optimization. Simulation experiments demonstrate that AFedDP achieves higher accuracy compared to the baseline algorithm. AFedDP can better address the issue of some devices being unable to participate in federated training properly. © The Author(s), under exclusive lic

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Behavioral Unicity: On the Limits of Anonymized Social Behavior Metadata 1st

Behavioral Unicity: On the Limits of Anonymized Social Beh...

引用

1st Conference on Blockchain and Web3.0 technology Innovation and Application, BWTAC 2024

作者： Tang, Hao Wang, Cheng Tongji University Shanghai201804 China The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China Shanghai Artificial Intelligence Laboratory Shanghai200030 China Shanghai Institute of Intelligent Science and Technology Tongji University Shanghai200092 China

ISBN: (纸本)9789819794119

Social behavior metadata has altered business models and human lifestyles. However, the inclusion of personal information in social behavior metadata poses risks of identity exposure for users. Under the requirements of modern data management laws, service providers now employ anonymization techniques when collecting user behavior metadata, which aims to break the link between personal identifiers and behavioral attributes for privacy protection. This paper conducts experiments on an open-source dataset of anonymized social behavior metadata and finds that even with privacy protection techniques such as data generalization, there remains a high risk of reidentification. Specifically, four social behavior metadata records are sufficient to reidentify users from the anonymized social behavior metadata, achieving a unicity of 90.10%. This indicates that the current widespread collection of social behavior metadata brings a high risk of privacy breaches. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Anonymity

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Multivariate Time Series Anomaly Detection by Feature Decoupling in Federated Learning Scenarios

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年

作者： He, Yifan Ding, Xi Tang, Yateng Guan, Jihong Zhou, Shuigeng Fudan University School of Computer Science Shanghai200433 China Shanghai Key Laboratory of Intelligent Information Processing Shanghai200433 China Tencent Weixin Group Guangzhou510308 China Tongji University Department of Computer Science and Technology Shanghai201804 China Ministry of Education Key Laboratory of Embedded System and Service Computing Tongji University Shanghai200092 China

Anomalies are usually regarded as data errors or novel patterns previously unseen, which are quite different from most observed data. Accurate detection of anomalies is crucial in various application scenarios. This paper focuses on unsupervised anomaly detection from Multivariate Time Series (MTS), as real-world data collected from sources such as wearable devices, medical equipment and industrial machines typically manifest as MTS and are often unlabeled. Anomaly detection in MTS represents a data-driven challenge that traditionally requires substantial centralized data for training models. However, in practice, data are frequently distributed among multiple institutions, with privacy concerns restricting unrestricted access. To address these issues, we introduce Feature Decoupling Federated Learning (FDFL), an approach designed to collaboratively train a representation learning network over multiple clients for unsupervised anomaly detection in MTS. Unlike previous methods that simply integrate MTS anomaly detection algorithms with federated learning strategies, FDFL specifically addresses heterogeneity among clients by decoupling the representation network into shared and private branches through a contrastive learning mechanism. This method aggregates shared parameters during each federated round while maintaining client-specific private parameters locally. Additionally, we develop a self-attention block that integrates the representations derived from both shared and private parameters to reconstruct MTS and identify anomalies based on reconstruction errors. Extensive experiments conducted on three publicly available datasets demonstrate that FDFL outperforms existing algorithms in most cases, highlighting the effectiveness and superiority of our proposed method in MTS anomaly detection. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：