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

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

来源：评论

学校读者我要写书评

暂无评论

Machine learning prediction of network dynamics with privacy protection

arXiv

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Femtosecond laser-induced flexible and highly sensitive capacitive pressure sensor with treefrog suckers bionic microstructure

Femtosecond laser-induced flexible and highly sensitive capa...

引用

Sensor Technology and Control (ISSTC), International Symposium on

作者： Zhiyun Wang Mengyang Chu Yahui Su Xiaohui Guo Rui Liu School of Electronic and Information Engineering Anhui University Information Materials and Intelligent Sensing Laboratory of Anhui Province Hefei China School of Integrated Circuits Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China Anhui Xinhuai Electronics Co. Ltd Huaibei China

Flexible capacitive pressure sensors are optimal for wearable electronic equipment owing to their advantages of simplicity in architecture and low power consumption. However, fabricating a bionic flexible capacitive pressure sensor with high sensitivity and a wide dynamic range of detection is still a great challenge. In this article, we propose a flexible pressure sensor based on femtosecond laser ablation with a treefrog suckers bionic microstructure. The treefrog suckers capacitive pressure sensor (TSCPS) has high sensitivity (0-10 kPa, 0.0762 kPa -1 ), wide detection range (500 kPa), high repeatability (>12000 s at 10 kPa), and fast response time (62.5 ms). For practical applications, the TSCPS was positioned on the wrist, palm, and sole of the hand to detect the movements of each part accordingly. The experimental findings indicate that the TSCPS has broad promising applications in bionic wearable products such as human locomotion monitoring.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mobility-aware Seamless Service Migration and Resource Allocation in Multi-edge IoV Systems

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 6315-6332页

作者： Chen, Zheyi Huang, Sijin Min, Geyong Ning, Zhaolong Li, Jie Zhang, Yan Fuzhou University College of Computer and Data Science Fuzhou350116 China Ministry of Education Engineering Research Center of Big Data Intelligence Fuzhou350002 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China University of Exeter Department of Computer Science Faculty of Environment Science and Economy ExeterEX4 4QF United Kingdom Chongqing University of Posts and Telecommunications School of Communications and Information Engineering Chongqing400065 China Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China University of Oslo Department of Informatics Oslo0316 Norway

Mobile Edge computing (MEC) offers low-latency and high-bandwidth support for Internet-of-Vehicles (IoV) applications. However, due to high vehicle mobility and finite communication coverage of base stations, it is hard to maintain uninterrupted and high-quality services without proper service migration among MEC servers. Existing solutions commonly rely on prior knowledge and rarely consider efficient resource allocation during the service migration process, making it hard to reach optimal performance in dynamic IoV environments. To address these important challenges, we propose SR-CL, a novel mobility-aware seamless Service migration and Resource allocation framework via Convex-optimization-enabled deep reinforcement Learning in multi-edge IoV systems. First, we decouple the Mixed Integer Nonlinear Programming (MINLP) problem of service migration and resource allocation into two sub-problems. Next, we design a new actor-critic-based asynchronous-update deep reinforcement learning method to handle service migration, where the delayed-update actor makes migration decisions and the one-step-update critic evaluates the decisions to guide the policy update. Notably, we theoretically derive the optimal resource allocation with convex optimization for each MEC server, thereby further improving system performance. Using the real-world datasets of vehicle trajectories and testbed, extensive experiments are conducted to verify the effectiveness of the proposed SR-CL. Compared to benchmark methods, the SR-CL achieves superior convergence and delay performance under various scenarios. © 2025 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence-Generated Terahertz Multi-Resonant Metasurfaces via Improved Transformer and CGAN Neural Networks

arXiv

引用

arXiv 2023年

作者： Huang, Yangpeng Feng, Naixing Cai, Yijun Smart Sensing Integrated Circuit Engineering Research Center of Universities in Fujian Province Xiamen University of Technology Xiamen361000 China The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei230601 China Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei230601 China

It is well known that the inverse design of terahertz (THz) multi-resonant graphene metasurfaces by using traditional deep neural networks (DNNs) has limited generalization ability. In this paper, we propose improved Transformer and conditional generative adversarial neural networks (CGAN) for the inverse design of graphene metasurfaces based upon THz multi-resonant absorption spectra. The improved Transformer can obtain higher accuracy and generalization performance in the StoV (Spectrum to Vector) design compared to traditional multilayer perceptron (MLP) neural networks, while the StoI (Spectrum to Image) design achieved through CGAN can provide more comprehensive information and higher accuracy than the StoV design obtained by MLP. Moreover, the improved CGAN can achieve the inverse design of graphene metasurface images directly from the desired multi-resonant absorption spectra. It is turned out that this work can finish facilitating the design process of artificial intelligence-generated metasurfaces (AIGM), and even provide a useful guide for developing complex THz metasurfaces based on 2D materials using generative neural networks. Copyright © 2023, The Authors. All rights reserved.

关键词： Graphene

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Object Detection Based on Generalized Features

Few-Shot Object Detection Based on Generalized Features

引用

Artificial Intelligence and intelligent Information processing (AIIIP), International Conference on

作者： Qiuqin Chen Xiao Ke Fujian Provincial Key Laboratory of Networking Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou University Fuzhou China Key Laboratory of Spatial Data Mining & Information Sharing Ministry of Education Fuzhou Fuzhou China

Few-shot object detection aims to rapidly detect novel classes of objects using a minimal number of annotated instances. Compared to methods such as meta-learning, few-shot object detection based on transfer learning can achieve better performance. However, when training on base-class datasets, the model gradually improves its detection performance on base classes but does not enhance its generalization. A base-class model lacking generalization tends to result in lower detection performance for novel classes during fine-tuning. To address the aforementioned issues, this paper tackles the problem from two aspects: firstly, we introduce the Confusion-Dropblock Module (CDM) to perturb the model's features, thus enhancing feature generalization. Secondly, we incorporate Deformable Convolution Modules to mitigate the impact of object shapes and sizes on detection performance, thereby improving overall detection performance. Experimental results on the COCO dataset demonstrate the effectiveness of the proposed algorithm, outperforming the compared methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

High-Accurate and Eﬀicient Numerical Algorithms for the Self-Consistent Field Theory of Liquid-Crystalline Polymers

SSRN

引用

SSRN 2024年

作者： Tan, Liwei He, Zhijuan Wang, Xin Jiang, Kai Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematical Sciences Shanghai Jiao Tong University Shanghai200240 China

In this paper, we develop and investigate numerical methods for the self-consistent field theory (SCFT) of liquid crystalline polymers. Both the Flory-Huggins interaction potential and the Maier-Saupe orientational interaction are considered, enabling simultaneous exploration of microphase separation and liquid crystalline order in these systems. The main challenge in numerically solving this complex system lies in solving 6-dimensional (3D spatial + 2D orientation + 1D time) partial differential equations and performing nonlinear iterations to optimize the fields. We present ten numerical algorithms for solving high-dimensional PDEs and give an evaluation criterion of choosing the most appropriate PDE solver both from theoretical and numerical performance. Results demonstrate that coupling the fourth-order Runge-Kutta scheme with Fourier pseudo-spectral methods and spherical harmonic transformations is superior compared to other algorithms. We develop two nonlinear iteration schemes, alternating direction iteration method and Anderson mixing method, and design an adaptive technique to enhance the stability of the Anderson mixing method. Moreover, the cascadic multi-level (CML) technique further accelerates the SCFT computation when applied to these iteration methods. Meanwhile, an approach to optimize the computational domain is developed. To demonstrate the power of our approaches, we investigate the self-assembled behaviors of flexible-semiflexible diblock copolymers in 4, 5, 6-dimensional simulations. Numerical results illustrate the eﬀiciency of our proposed method. © 2024, The Authors. All rights reserved.

关键词： Mixing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：