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

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Sun, Wei Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing School of Computer Science Nanjing China

ISBN: (纸本)9781665405270

Effective workload forecasting can provide a reference for resource scheduling in cloud data centers. Compared with the normal single data center, the multi-data center has a more complicated architecture design and provides more diverse computing services. The traditional load forecasting models need too much manual intervention to set up the parameters, meanwhile, the emerging neural network methods are not sensitive to the prediction scale and cannot capture the long-term associations between input features. To address these challenges, we propose a hybrid model named Attentions-based LSTM Encoder-Decoder network and Autoregressive model (ALEDAR), which combines neural network and statistical learning methods, to analyze the linear and nonlinear characteristics of the load sequence over time in a multi-cloud data center environment. ALEDAR uses a dual attention-based Encoder-Decoder architecture to extract the relationships between historical workload data, the design can also avoid the deterioration of prediction effect caused by long-range data scale, the output layer is composed of a three-layer perceptron. Moreover, ALEDAR employs an autoregressive module to capture the linear trend of the load sequence and eliminate scale insensitivity of input and output data. The experimental results show that our approach is adaptive and can improve the performance of host workload prediction in both single cloud data center and multi-cloud data center environments. We evaluate the performance of the proposed algorithm on real-world data sets and observe consistent improvement of 9.7% - 34.2% over the state-of-the-art baselines. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A New Semi-supervised Approach for Network Encrypted Traffic Clustering and Classification 25

A New Semi-supervised Approach for Network Encrypted Traffic...

引用

25th IEEE International Conference on Computer Supported Cooperative Work in Design, CSCWD 2022

作者： Lin, Kunda Xu, Xiaolong Jiang, Yu School of Computer Science Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China

ISBN: (纸本)9781665405270

Encrypted network traffic classification is an essential task in modern communications, which is used in a wide range of applications, such as network resource allocation, QoS (Quality of Service), malicious detection, etc. With the continuous evolution of network technology, approaches used to classify network encrypted traffic have become increasingly complex, and model training relies heavily on a large amount of labeled data. However, the acquisition of correct and massive labeled data of network traffic in the real environment remains a major challenge in this field. On the opposite, unlabeled traffic is extremely easy to obtain in a network. Therefore, the effective use of unlabeled data is of great significance to the development of modern communications. In this paper, we propose the Sauce model, which can effectively use unlabeled information to obtain high-quality clustering space. It is composed of Aux (auxiliary network) and AE (auto encoder), where Aux is designed for collaborative training with AE, affecting the distribution of samples in the latent space generated by AE. Sauce uses t-SNE (t- distributed stochastic neighbor embedding) to perform secondary dimensionality reduction on the latent code, and then uses a clustering algorithm for cluster analysis. Besides, sauce applies the self-training technique, replacing the real labeled data with pseudo-labeled data to reduce the reliance on labeled data and improve the utilization of unannotated data. We conduct experiments on two real network datasets. The experiments show that Sauce can achieve clustering accuracies of 98.4% (VPN dataset) and 98.0% (TOR dataset), outperforming other unsupervised or semi-supervised learning methods. © 2022 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Score-based Generative Priors Guided Model-driven Network for MRI Reconstruction

arXiv

引用

arXiv 2024年

作者： Qiao, Xiaoyu Li, Weisheng Xiao, Bin Huang, Yuping Yang, Lijian Chongqing Key Laboratory of Image Cognition Chongqing University of Posts and Telecommunications Chongqing China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and Telecommunications Ministry of Education Chongqing China

Score matching with Langevin dynamics (SMLD) method has been successfully applied to accelerated MRI. However, the hyperparameters in the sampling process require subtle tuning, otherwise the results can be severely corrupted by hallucination artifacts, especially with out-of-distribution test data. To address the limitations, we proposed a novel workflow where naive SMLD samples serve as additional priors to guide model-driven network training. First, we adopted a pretrained score network to generate samples as preliminary guidance images (PGI), obviating the need for network retraining, parameter tuning and in-distribution test data. Although PGIs are corrupted by hallucination artifacts, we believe they can provide extra information through effective denoising steps to facilitate reconstruction. Therefore, we designed a denoising module (DM) in the second step to coarsely eliminate artifacts and noises from PGIs. The features are extracted from a score-based information extractor (SIE) and a cross-domain information extractor (CIE), which directly map to the noise patterns. Third, we designed a model-driven network guided by denoised PGIs (DGIs) to further recover fine details. DGIs are densely connected with intermediate reconstructions in each cascade to enrich the information and are periodically updated to provide more accurate guidance. Our experiments on different datasets reveal that despite the low average quality of PGIs, the proposed workflow can effectively extract valuable information to guide the network training, even with severely reduced training data and sampling steps. Our method outperforms other cutting-edge techniques by effectively mitigating hallucination artifacts, yielding robust and high-quality reconstruction results. Copyright © 2024, The Authors. All rights reserved.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Model-Based Offline Policy Optimization with Adversarial Network 26

Model-Based Offline Policy Optimization with Adversarial Net...

引用

26th European Conference on Artificial Intelligence, ECAI 2023

作者： Yang, Junming Chen, Xingguo Wang, Shengyuan Zhang, Bolei Jiangsu Key Laboratory of Big Data Security and Intelligent Processing China School of Computer Science Nanjing University of Posts and Telecommunications China School of Modern Posts Nanjing University of Posts and Telecommunications China

ISBN: (纸本)9781643684369

Model-based offline reinforcement learning (RL), which builds a supervised transition model with logging dataset to avoid costly interactions with the online environment, has been a promising approach for offline policy optimization. As the discrepancy between the logging data and online environment may result in a distributional shift problem, many prior works have studied how to build robust transition models conservatively and estimate the model uncertainty accurately. However, the over-conservatism can limit the exploration of the agent, and the uncertainty estimates may be unreliable. In this work, we propose a novel Model-based Offline policy optimization framework with Adversarial Network (MOAN). The key idea is to use adversarial learning to build a transition model with better generalization, where an adversary is introduced to distinguish between in-distribution and out-of-distribution samples. Moreover, the adversary can naturally provide a quantification of the model's uncertainty with theoretical guarantees. Extensive experiments showed that our approach outperforms existing state-of-the-art baselines on widely studied offline RL benchmarks. It can also generate diverse in-distribution samples, and quantify the uncertainty more accurately. © 2023 The Authors.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

ConvTrans-TPS: A Convolutional Transformer Model for Disk Failure Prediction in Large-Scale Network Storage Systems 26

ConvTrans-TPS: A Convolutional Transformer Model for Disk Fa...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Xu, Shicheng Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing210023 China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China

ISBN: (纸本)9798350331684

Disk failure is one of the most important reliability problems in large-scale network storage systems. Disk failure may lead to serious data loss and even disastrous consequences if the missing data cannot be recovered. Therefore, predicting disk failures is an important means of ensuring storage security in network storage systems. However, since the fault data in the fast degradation stage is smaller than the healthy data in the normal state, the mixture of healthy data and faulty data leads to extremely unbalanced data, which brings great challenges to finding hidden fault information, thus making fault prediction more accurate. Aiming at the above problems, a convolutional transformer model ConvTrans-TPS model for disk failure prediction in large-scale network storage systems is proposed. The ConvTrans-TPS model acquires dependencies between long-term sequence data through transformers and uses convolutional projections for attention computation to enhance attention to local contextual information. data augmentation to predict failures in the next 7 days. Validated by the analysis on the Backblaze dataset, the F1 is 0.96 and the Matthews correlation coefficient (MCC) is 0.92. Compared with the popular CNN-LSTM model in recent years, our proposed method improves F1 and MCC by 4% and 5%, respectively, improving the prediction accuracy. © 2023 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Indoor Navigation Mechanism based on 5G network for Large Parking Garage 26

Indoor Navigation Mechanism based on 5G network for Large Pa...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Xu, Xiaolong Ding, Qun Lin, Licheng Nanjing University of Posts and Telecommunications School of Computer Science Nanjing210023 China Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory Big Data Security and Intelligent Processing Nanjing210023 China

ISBN: (纸本)9798350331684

With the increase of car ownership in China, the problem of difficult parking in cities has become more and more serious. In large parking garage, finding an ideal parking space has become a daily problem for people;especially during the peak usage period of parking garage, a large number of vehicles will be driven into the parking garage, which will bring congestion, and at the same time, the demand of a large number of users in the area will lead to network congestion under 4G network, and users cannot access the network to check and find parking spaces. Therefore, this paper proposes a global optimal navigation mechanism with 5G network based on the above mentioned problems by analyzing the congestion situation during the peak usage of the parking garage. This mechanism uses an optimal parking space selection model and a global optimal scheduling model that can avoid congestion. Based on the model proposed in this paper, we construct a navigation planning system based on mobile, front-end and back-end. With the ultra-low latency, ultrahigh transmission efficiency and reliability of 5G network, the mobile port can select the optimal parking space according to the user's preference, and the back-end can show the parking space and congestion in the parking garage in real time according to the actual situation of the parking garage. Finally, the performance of the model and system proposed in this paper is verified through experiments. © 2023 IEEE.

关键词： 5G mobile communication systems

来源：评论

学校读者我要写书评

暂无评论

A Causal Disentangled Multi-Granularity Graph Classification Method

arXiv

引用

arXiv 2023年

作者： Li, Yuan Liu, Li Chen, Penggang Zhang, Youmin Wang, Guoyin Chongqing Key Laboratory of Computational Intelligence China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing University of Posts and Telecommunications Chongqing400065 China

Graph data widely exists in real life, with large amounts of data and complex structures. It is necessary to map graph data to low-dimensional embedding. Graph classification, a critical graph task, mainly relies on identifying the important substructures within the graph. At present, some graph classification methods do not combine the multi-granularity characteristics of graph data. This lack of granularity distinction in modeling leads to a conflation of key information and false correlations within the model. So, achieving the desired goal of a credible and interpretable model becomes challenging. This paper proposes a causal disentangled multi-granularity graph representation learning method (CDM-GNN) to solve this challenge. The CDM-GNN model disentangles the important substructures and bias parts within the graph from a multi-granularity perspective. The disentanglement of the CDM-GNN model reveals important and bias parts, forming the foundation for its classification task, specifically, model interpretations. The CDM-GNN model exhibits strong classification performance and generates explanatory outcomes aligning with human cognitive patterns. In order to verify the effectiveness of the model, this paper compares the three real-world datasets MUTAG, PTC, and IMDM-M. Six state-of-the-art models, namely GCN, GAT, Top-k, ASAPool, SUGAR, and SAT are employed for comparison purposes. Additionally, a qualitative analysis of the interpretation results is conducted. Copyright © 2023, The Authors. All rights reserved.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A granular-ball generation method based on local density for classification

引用

Information Sciences 2025年 717卷

作者： Liu, Fan Zhang, Qinghua Xia, Shuyin Xie, Qin Liao, Wei Zhang, Siyang School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and Telecommunication Chongqing400065 China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of Education Chongqing400065 China Tourism Multi-source Data Perception and Decision Technology Key Laboratory of the Ministry of Culture and Tourism Chongqing400065 China

As a new branch of granular computing, granular-ball computing (GBC) has become increasingly popular due to its high efficiency, robustness, and scalability. However, in classification tasks, the existing mainstream methods for generating granular-ball (GB) have two common issues: GBs generated by the existing methods are not accurate enough to describe the distribution of the original data and there are de-overlap operations in the existing GB generation process, which increase the workload of the GB generation process. Therefore, to solve the above two issues, a GB generation method based on local density (LDGBG) is proposed in this paper. First, centers of GBs are selected based on local density to ensure the generated GBs are more consistent with the original data distribution. Second, the method for calculating radii avoids overlaps and incorporates the idea of compact within class and decentralized between classes, which will improve classification performance. Furthermore, a sparsity index is introduced to assess the sparsity of datasets, thereby enabling more effective utilization of original samples in sparse datasets. Finally, comparative experiments are conducted on 27 benchmark datasets and the experimental results show that LDGBG is superior to the existing mainstream models in effectiveness and robustness. © 2025 Elsevier Inc.

关键词： Classification Granular computing Granular-ball computing Granular-ball generation Local density

来源：评论

学校读者我要写书评

暂无评论

Preface: Brain-Inspired AI Research

引用

Science China(Technological Sciences) 2024年第8期67卷 2281-2281页

作者： GONG YiHong WANG GuoYin College of Artificial Intelligence Xi’an Jiaotong UniversityXi’an 710049China Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Chongqing University of Posts and TelecommunicationsChongqing400065China College of Computer and Information Science Chongqing Normal UniversityChongqing401331China

Large AGI (artificial general intelligence) models, represented by OpenAI’s GPT-4, DALL-E, Sora, etc., have amazed the world by exhibiting superior capabilities on a variety of NLP and text-to-image/video generation tasks. The success of these models was achieved by exploiting ultra-scale training data, ultra-scale computational models, and unlimited computing *** brute force approach, however, is not only making an adverse impact on global warming prevention, but also raising skepticism on whether such a development path can really achieve true AGI systems. Recently, there have been increasing scientific studies that report the delusion phenomenon of the AGI models, mainly caused by their inability to learn correct knowledge and correct world models.

关键词： artificial Open knowledge

来源：评论

学校读者我要写书评

暂无评论

GNEA: A Novel GCN-based Network Embedding Algorithm for Semantic Social Network 10

GNEA: A Novel GCN-based Network Embedding Algorithm for Sema...

引用

10th International Symposium on System security, Safety, and Reliability, ISSSR 2024

作者： Zhao, Jinbo He, Jinling Du, Yuanhan Tang, Ming Xu, Xiaolong Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing China State Grid Jiangsu Electric Power Company Limited Nanjing China Nanjing University of Posts and Telecommunications School of Computer Science Nanjing China

ISBN: (纸本)9798350362930

With the development of semantic social networks, social networks become more complex and their size expands rapidly, which brings significant challenges to social network analysis. Network Embedding can transform the network from a high-dimensional adjacency matrix to a low-dimensional one, which has excellent foreground in link prediction, vertex classification, and graph visualization. Nowadays, most algorithms are proposed for static networks with little consideration of the dynamic changes in the network. However, most real-world networks change over time. Directly applying static network embedding algorithms to dynamic networks will result in poor stability, flexibility, and efficiency. Because of these shortcomings, we propose a graph convolution-based dynamic network representation learning algorithm (GNEA), which combines Graph Convolutional Network (GCN) with Long Short-Term Memory (LSTM) to train the time series networks. GCN is applied to extract features in the network, and LSTM is utilized to capture temporal information. GNEA can not only perform characterization learning on the network but also obtain more abundant information during the dynamic evolution of the network. GNEA is compared with several typical algorithms on the datasets Stochastic Block Model (SBM), Autonomous Systems (AS), and Digital Bibliography and Library Project (DBLP). The results prove that GNEA has good performance in MAP and precision@k. © 2024 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：