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

arXiv 2022年

作者： Xia, Xin Su, Yansen Lü, Linyuan Zhang, Xingyi Lai, Ying-Cheng Zhang, Hai-Feng The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei230601 China The Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Artificial Intelligence Anhui University Hefei230601 China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of China Chengdu610054 China School of Electrical Computer and Energy Engineering Arizona State University TempeAZ85287 United States

Predicting network dynamics based on data, a problem with broad applications, has been studied extensively in the past, but most existing approaches assume that the complete set of historical data from the whole network is available. This requirement presents a great challenge in applications, especially for large, distributed networks in the real world, where data collection is accomplished by many clients in a parallel fashion. Often, each client only has the time series data from a partial set of nodes and the client has access to only partial timestamps of the whole time series data and partial structure of the network. Due to privacy concerns or license related issues, the data collected by different clients cannot be shared. To accurately predict the network dynamics while protecting the privacy of different parties is a critical problem in the modern time. Here, we propose a solution based on federated graph neural networks (FGNNs) that enables the training of a global dynamic model for all parties without data sharing. We validate the working of our FGNN framework through two types of simulations to predict a variety of network dynamics (four discrete and three continuous dynamics). As a significant real-world application, we demonstrate successful prediction of State-wise influenza spreading in the USA. Our FGNN scheme represents a general framework to predict diverse network dynamics through collaborative fusing of the data from different parties without disclosing their privacy. © 2022, CC BY.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Edge-fault-tolerance about the SM-λ property of hypercube-like networks

arXiv

引用

arXiv 2022年

作者： Liu, Dong Li, Pingshan Zhang, Bicheng Key Laboratory of Intelligent Computing & Information Processing Ministry of Education School of Mathematical and Computational Sicence Xiangtan University Hunan Xiangtan41105 China

The edge-fault-tolerance of networks is of great significance to the design and maintenance of networks. For any pair of vertices u and v of the connected graph G, if they are connected by min{degG(u), degG(v)} edge-disjoint paths, then G is strong Menger edge connected (SM-λ for short). The conditional edge-fault-tolerance about the SM-λ property of G, written smrλ(G), is the maximum value of m such that G − F is still SM-λ for any edge subset F with |F| ≤ m and δ(G−F) ≥ r, where δ(G−F) is the minimum degree of G−F. Previously, most of the exact value for smrλ(G) is aimed at some well-known networks when r ≤ 2, and a few of the lower bounds on some well-known networks for r ≥ 3. In this paper, we firstly determine the exact value of smrλ(G) on class of hypercube-like networks (HL-networks for short, including hypercubes, twisted cubes, crossed cubes etc.) for a general r, that is, smrλ(Gn) = 2r(n − r) − n for every Gn ∈ HLn, where n ≥ 3 and 1 ≤ r ≤ n − 2. Copyright © 2022, The Authors. All rights reserved.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Remaining Useful Life Prediction of Bearing via a Double Attention-Based Deep Neural Network

Remaining Useful Life Prediction of Bearing via a Double Att...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

作者： Yongkang Liu Donghui Pan Haifeng Zhang Kai Zhong Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Mathematical Science Anhui University Hefei Anhui China Institutes of Physical Science and Information Technology Anhui University Hefei Anhui China

Predicting the remaining useful life (RUL) of bearings is important for the secure running and reducing maintenance costs of rotating machinery. In this article, a novel feature extraction and RUL prediction framework of bearing is proposed by utilizing time-frequency representations (TFRs) and deep neural network with double attention (DA-DNN). Firstly, TFRs are employed to extract the degradation features associated with RUL prediction, which can effectively cope with the non-stationary properties of bearing vibration data. The reduced dimensional TFRs are then used as the DA-DNN model input. Afterwards, DA-DNN is developed by employing the double attention structure to extract the key degradation features more efficiently. The dual-attention structure has ability to capture the degradationrelated features from two aspects of channel attention and spatial attention, which enables the network to focus on high RUL-relevant information. Finally, the experimental results demonstrate the effectiveness of DA-DNN, which shows higher performance in terms of prediction accuracy compared to other deep learning (DL) methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

A Novel DDoS Detection Model for SDN Using Single-Class Cluster Oversampling and Weighted Ensemble Method

A Novel DDoS Detection Model for SDN Using Single-Class Clus...

引用

International Conference on Network Protocols

作者： Hao Zhang Shuqi Wu Jie Pan Zhi Wang Xiaolong Sun College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou China

ISBN: (数字)9798350351712

ISBN: (纸本)9798350351729

The centralized control plane characteristic of Software Defined Networking (SDN) makes it a prime target for Distributed Denial of Service (DDoS) attacks. A significant issue in network traffic data is the severe imbalance between background traffic and various types of DDoS attack traffic. To address this challenge, we propose a novel DDoS detection model based on single-class cluster oversampling and weighted ensemble method. Initially, we design a multi-strategy feature selection using variance inflation factor and recursive feature elimination. Next, we construct a single-class cluster model based on the spatial distribution of samples, and create minority class samples independently within each cluster. Finally, detection results are determined using the weight vector of each base classifier in ensemble learning. The proposed DDoS detection model's performance is validated through simulations of various DDoS attack scenarios in an SDN environment. Experimental results indicate that the proposed strategy exhibits superior performance, showing improvements in precision, recall, and F1 score compared to state-of-the-art techniques.

关键词： Interpolation Protocols Telecommunication traffic Denial-of-service attack Feature extraction Vectors Data models Ensemble learning Computer crime Software defined networking

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

An Efficient Dynamic Resource Allocation Framework for Evolutionary Bilevel Optimization

arXiv

引用

arXiv 2024年

作者： Xu, Dejun Ye, Kai Zheng, Zimo Zhou, Tao Yen, Gary G. Jiang, Min Department of Artificial Intelligence School of Informatics Xiamen University Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen361005 China School of Electrical and Computer Engineering Oklahoma State University StillwaterOK74075 United States

Bilevel optimization problems are characterized by an interactive hierarchical structure, where the upper level seeks to optimize its strategy while simultaneously considering the response of the lower level. Evolutionary algorithms are commonly used to solve complex bilevel problems in practical scenarios, but they face significant resource consumption challenges due to the nested structure imposed by the implicit lower-level optimality condition. This challenge becomes even more pronounced as problem dimensions increase. Although recent methods have enhanced bilevel convergence through task-level knowledge sharing, further efficiency improvements are still hindered by redundant lower-level iterations that consume excessive resources while generating unpromising solutions. To overcome this challenge, this paper proposes an efficient dynamic resource allocation framework for evolutionary bilevel optimization, named DRCBLEA. Compared to existing approaches, DRC-BLEA introduces a novel competitive quasi-parallel paradigm, in which multiple lower-level optimization tasks, derived from different upperlevel individuals, compete for resources. A continuously updated selection probability is used to prioritize execution opportunities to promising tasks. Additionally, a cooperation mechanism is integrated within the competitive framework to further enhance efficiency and prevent premature convergence. Experimental results compared with chosen state-of-the-art algorithms demonstrate the effectiveness of the proposed method. Specifically, DRCBLEA achieves competitive accuracy across diverse problem sets and real-world scenarios, while significantly reducing the number of function evaluations and overall running time. © 2024, CC BY-NC-ND.

关键词： Structural optimization

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

Error Analysis of Virtual Element Method for the Poisson-Boltzmann Equation

arXiv

引用

arXiv 2023年

作者： Huang, Linghan Shu, Shi Yang, Ying Guangxi Guilin541004 China School of Mathematics and Computational Science Xiangtan University Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan Xiangtan411105 China Guangxi541004 China

The Poisson-Boltzmann equation is a nonlinear elliptic equation with Dirac distribution sources, which has been widely applied to the prediction of electrostatics potential of biological biomolecular systems in solution. In this paper, we discuss and analysis the virtual element method for the Poisson-Boltzmann equation on general polyhedral meshes. Under the low regularity of the solution of the whole domain, nearly optimal error estimates in both L2-norm and H1-norm for the virtual element approximation are obtained. The numerical experiment on different polyhedral meshes shows the efficiency of the virtual element method and verifies the proposed theoretical prediction. Copyright © 2023, The Authors. All rights reserved.

关键词： Poisson equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：