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

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Liu, Yuchen Liang, Hu Qiu, Ran Zhao, Shengrong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

In many underwater application scenarios, recognition tasks need to be executed promptly on computationally limited platforms. However, models designed for this field often exhibit spatial locality, and existing works lack the ability to capture crucial details in images. Therefore, a lightweight and detail-aware vision network (LDVNet) for resource-constrained environments is proposed to overcome the limitations of these approaches. Firstly, in order to enhance the accuracy of target image recognition, we introduce transformer modules to acquire global information, thus addressing the issue of spatial locality inherent in traditional convolutional neural networks (CNNs). Secondly, to maintain the network's lightweight nature, we integrate the transformer module with convolutional operations, thereby mitigating the substantial parameter and floating point operations (FLOPs) overhead. Thirdly, for the efficient extraction of crucial fine-grained details from feature maps, we have devised a channel and spatial attention module (C&SA). This module aids in recognizing intricate and fine-grained visual tasks and enhances image understanding. It is seamlessly integrated into LDVNet with nearly negligible parameter overhead. The experimental results demonstrate that LDVNet outperforms other lightweight networks and hybrid networks in different recognition tasks, while being suitable for resource-constrained environments. © 2023 IEEE.

关键词： Detail-aware Image recognition Lightweight

来源：评论

学校读者我要写书评

暂无评论

Malicious Client Detection with Differential Privacy Constraints Based on Model Update Slicing and K-Means Clustering

Malicious Client Detection with Differential Privacy Constra...

引用

Frontiers Technology of information and computer (ICFTIC), IEEE International Conference on

作者： Mengshi Qi Xin Wang Yunpeng He Ming Yang Xiaoming Wu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331541750

ISBN: (纸本)9798331541767

Federated learning (FL) is a decentralized machine learning technique that protects data privacy by trainng models locally on devices and sharing only model updates instead of raw data. However, FL also faces multiple security challenges. Clientside poisoning attacks can compromise global model training by injecting malicious updates. Additionally, the server may infer private information from client model updates. Most existing studies address these two risks separately, lacking a systematic analysis and response to their combined threats. This paper proposes a method called Sliced-Clustering Guard (SCGuard), which slices gradients and performs clustering analysis on each segment, enabling the server to more accurately detect malicious updates and effectively differentiate malicious client updates with differential privacy (DP) protection. Experimental results demonstrate that SCGuard can mitigate poisoning attacks while effectively safeguarding clients' sensitive information.

关键词： Training Privacy Differential privacy Systematics Federated learning Scalability Data models Servers Protection Faces

来源：评论

学校读者我要写书评

暂无评论

Prediction of piRNA-mRNA interactions based on an interactive inference network

Prediction of piRNA-mRNA interactions based on an interactiv...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Liu, Yajun Li, Ru Li, Aimin Fei, Rong Guo, Xie Wu, Fang-Xiang Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an China Xi'an University of Technology Shaanxi Key Laboratory of Complex System Control and Intelligent Information Processing Xi'an China University of Saskatchewan Division of Biomedical Engineering Department of Computer Science Department of Mechanical Engineering Saskatoon Canada

ISBN: (纸本)9798350337488

As the largest class of small non-coding RNAs, piRNAs primarily present in the reproductive cells of mammals, which influence post-transcriptional processes of mRNAs in multiple ways. Effective methods for predicting piRNA and mRNA target relationships can help identify piRNA functions, investigate the possibility of piRNAs as biomarkers and therapeutic targets. In this study, we propose a computational approach for classifying the relationships of piRNA-mRNA pairs based on an interactive inference network (IIN). First, we gather piRNA-mRNA target data, collect sequence data by position alignment, and construct a benchmark dataset. Furthermore, a reliable negative set is constructed by positive-unlabeled learning. Finally, we view a piRNA and a mRNA sequence as a premise and hypothesis sentence, respectively, and IIN model is used to predict the relationship between them. The experiments demonstrate that our method effectively characterizes piRNA-mRNA interaction and could be beneficial for researchers to investigate piRNA functions. © 2023 IEEE.

关键词： interactive inference network noncoding RNA piRNA-mRNA interactions positive-unlabeled learning

来源：评论

学校读者我要写书评

暂无评论

GAF-GAN: Gated Attention Feature Fusion Image Inpainting network Based on Generative Adversarial network 29

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Net...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Qiu, Ran Liang, Hu Liu, Yuchen Zhao, Shengrong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Qilu University of Technology Shandong Academy of Sciences Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

Image inpainting, which aims to reconstruct reasonably clear and realistic images from known pixel information, is one of the core problems in computer vision. However, due to the complexity and variability of the underwater environment, the inability to extract valid pixel points and insufficient correlation between feature information in existing image inpainting techniques lead to blurring in the generated images. Therefore, a novel gated attention feature fusion image inpainting network based on generative adversarial networks (GAF-GAN) is proposed. The accuracy of feature similarity matching depends heavily on the validity of the information contained in the features. On the one hand, gating values are dynamically generated by gated convolution to reduce the interference of invalid information. On the other hand, semantic information at distant locations in an image is accurately acquired by the attention mechanism. For these reasons, we designed an improved gated attention mechanism. Gated attention mechanism make the network focus on effective information such as high-frequency texture and color fidelity of restored images. In addition, the dense feature fusion module is added to expand the overall receptive field of the network to fully learn the image features. Experimental results show that the proposed method can effectively repair defective images with complex texture structures and improve the reality and integrity of image details and structures. © 2023 IEEE.

关键词： Dense feature fusion module Gated attention mechanism Image inpainting Underwater environment

来源：评论

学校读者我要写书评

暂无评论

Rate-Compatible Shortened Polar Codes Based on RM Code-Aided 1

引用

12th International Conference on Broadband Communications, networks, and Systems, BROADNETS 2021

作者： Li, Chunjie Chen, Haiqiang Wang, Zelin Sun, Youming Li, Xiangcheng School of Computer Electronics and Information Guangxi University Nanning530004 China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning530004 China

ISBN: (数字)9783030934798

ISBN: (纸本)9783030934781

The minimum Hamming distance is not considered for the traditional rate-compatible shortened polar (RCSP) codes, which may cause performance degradations. In this paper we propose a hybrid algorithm to construct RCSP codes based on Reed-Muller (RM) code-aided. The shortened bits and pre-frozen bits are jointly designed by the row weight property of the common generator matrix GN for the RM/Polar code. First, the selected shortened bits are guaranteed to be uniquely depended upon the pre-frozen bits, which makes them completely be known by the decoder. Second, the proposed construction method is designed in such way, so that the minimum row weight of GN can be maximized. More specifically, when multiple candidate positions satisfy the conditions (weight-1 column constraint), those rows having less weights are deleted to form the shortened/pre-frozen bits, which can reduce the number of rows with small weight and naturally, make the resulting RCSP codes have larger minimum Hamming distance in average. Simulation results show that the proposed RCSP codes perform better than the traditional shortened codes at low code rates. While at high code rates, the proposed RCSP codes can achieve better performance than that of the quasi uniform punctured (QUP) polar codes, especially at large signal-to-noise ratio (SNR) region. The proposed RCSP codes can find applications in future communications, such as the beyond 5th generation (B5G) and 6th generation (6G) systems. © 2022, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

Boosting Consistency in Dual Training for Long-Tailed Semi-Supervised Learning

arXiv

引用

arXiv 2024年

作者： Gan, Kai Wei, Tong Zhang, Min-Ling The School of Computer Science and Engineering Southeast University Nanjing210096 China The Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

While long-tailed semi-supervised learning (LTSSL) has received tremendous attention in many real-world classification problems, existing LTSSL algorithms typically assume that the class distributions of labeled and unlabeled data are almost identical. Those LTSSL algorithms built upon the assumption can severely suffer when the class distributions of labeled and unlabeled data are mismatched since they utilize biased pseudo-labels from the model. To alleviate this problem, we propose a new simple method that can effectively utilize unlabeled data from unknown class distributions through Boosting cOnsistency in duAl Training (BOAT). Specifically, we construct the standard and balanced branch to ensure the performance of the head and tail classes, respectively. Throughout the training process, the two branches incrementally converge and interact with each other, eventually resulting in commendable performance across all classes. Despite its simplicity, we show that BOAT achieves state-of-the-art performance on a variety of standard LTSSL benchmarks, e.g., an averaged 2.7% absolute increase in test accuracy against existing algorithms when the class distributions of labeled and unlabeled data are mismatched. Even when the class distributions are identical, BOAT consistently outperforms many sophisticated LTSSL algorithms. We carry out extensive ablation studies to tease apart the factors that are the most important to the success of BOAT. The source code is available at https://***/Gank0078/BOAT. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Mobile Computing 2025年第07期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

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Metapath-based Heterogeneous Graph Transformer for Gene-Disease Association Prediction

Comprehensive Metapath-based Heterogeneous Graph Transformer...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Cui, Wentao Li, Shoubo Fang, Chen Long, Qingqing Wang, Chengrui Wang, Xuezhi Zhou, Yuanchun Chinese Academy of Sciences Computer Network Information Center China University of Chinese Academy of Sciences China University of Chinese Academy of Sciences Hangzhou Institute for Advanced Study China Chinese Academy of Sciences State Key Laboratory of Stem Cell and Reproductive Biology Institute of Zoology China

ISBN: (纸本)9798350386226

Discovering gene-disease associations is crucial for understanding disease mechanisms, yet identifying these associations remains challenging due to the time and cost of biological experiments. Computational methods are increasingly vital for efficient and scalable gene-disease association prediction. Graph-based learning models, which leverage node features and network relationships, are commonly employed for biomolecular predictions. However, existing methods often struggle to effectively integrate node features, heterogeneous structures, and semantic information. To address these challenges, we propose COmprehensive MEtapath-based heterogeneous graph Transformer(COMET) for predicting gene-disease associations. COMET integrates diverse datasets to construct comprehensive heterogeneous networks, initializing node features with BioGPT. We define seven Metapaths and utilize a transformer framework to aggregate Metapath instances, capturing global contexts and long-distance dependencies. Through intra- and inter-metapath aggregation using attention mechanisms, COMET fuses latent vectors from multiple Metapaths to enhance GDA prediction accuracy. Our method demonstrates superior robustness compared to state-of-the-art approaches. Ablation studies and visualizations validate COMET's effectiveness, providing valuable insights for advancing human health research. © 2024 IEEE.

关键词： Prediction models

来源：评论

学校读者我要写书评

暂无评论

network link weight optimization based on antisymmetric deep graph networks and reinforcement learning

Network link weight optimization based on antisymmetric deep...

引用

Next Generation Data-driven networks (NGDN), International Conference on

作者： Yuhan Chen Yingya Guo Department of Computer and Data Science Fuzhou University Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (数字)9798350388374

ISBN: (纸本)9798350388381

Route optimization is a key core technology to optimize network traffic distribution, achieve network load balancing, and improve network performance. Traditional distributed networks widely run shortest-path based routing protocols, and the path of traffic is determined by the link weights of the distributed network, so routing optimization methods are usually optimized around the link weights of the network. Heuristics-based link weight optimization methods are widely used. However, heuristic methods rely on manually set rules, which are poorly generalized and cannot adapt well to dynamically changing traffic demands. Compared to heuristics, deep reinforcement learning (DRL) has the advantage of extracting more accurate feature representations in addition to its ability to handle high-dimensional state and action spaces. We propose a network link weight optimization method based on anti-symmetric deep graph networks (A-DGN) and reinforcement learning using a novel GNN framework anti-symmetric deep graph networks, where link weights are adjusted to reduce the network link utilization with the optimization objective of minimizing the maximum link utilization in the network. Experimental results show that the proposed method achieves significant performance improvements in the link weight optimization problem in four real-world network topology scenarios.

关键词： Measurement network topology Optimization methods Telecommunication traffic Feature extraction Deep reinforcement learning Routing Load management Routing protocols Next generation networking

来源：评论

学校读者我要写书评

暂无评论

A Cloud Computing User Experience Focused Load Balancing Method Based on Modified CMA-ES Algorithm 18th

A Cloud Computing User Experience Focused Load Balancing Met...

引用

18th International Conference on Green, Pervasive, and Cloud Computing, GPC 2023

作者： Luo, Jihai Dong, Chen Chen, Zhenyi Xu, Li Chen, Tianci College of Computer and Data Science - Fuzhou University Xueyuan Road Fujian Fuzhou360108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Department of Computer Science and Engineering University of South Florida TampaFL33620 United States College of Computer and Cyber Security Fujian Normal University Fuzhou350007 China

ISBN: (纸本)9789819998951

The development of the software and hardware has brought about the abundance and overflow of computing resources. Many Internet companies can lease idle computing resources based on the peak and valley cycles of usage load to provide IaaS service. After the surging development, more and more companies are gradually paying attention to the specific user experience in cloud computing. But there are few works about that aspect in load balance problem. Therefore, we consider the load balancing resource allocation problem, from the perspective of user experience, mainly based on geographical distance and regional Equilibrium, combined with user usage habits, in multiple service periods. A detailed mathematical definition has been established for this problem. This article proposes a mathematical model for the problem, along with an modified CMA-ES (Covariance Matrix Adaptation Evolution Strategy) algorithm, called WS-ESS-CMA-ES algorithm, to allocate computing resources and solve the above problem. The process of using the proposed algorithm to solve the problem of cloud computing resource allocation in real scenarios is simulated, and compared with some other algorithms. The experiment results show that our algorithm performs well. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：