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

SC-GAT: Web services Classification Based on Graph Attention Network 16th

SC-GAT: Web Services Classification Based on Graph Attention...

16th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2020

作者： Peng, Mi Cao, Buqing Chen, Junjie Liu, Jianxun Li, Bing School of Computer Science and Engineering & Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Computer Wuhan University Wuhan China

ISBN: (纸本)9783030675363

The classification of Web services with high similarity is conducive to the promotion for service management and service discovery. With the increasing number of Web services, how to accurately and efficiently classify the Web services becomes an urgent and challenging task. Although the existing methods achieve significant results in the task for service classification via integrating the structure information of service network with the content features of service node, it fails to discriminate the importance of neighbor services in the service network on the service node needed to be classified. To solve this problem, we propose a Web services classification method based on graph attention network. Firstly, according to the composition and shared annotation relationship of Web services, it applies the description documents, tags of Web services and the call relationship between mashups and services to build a service relationship network. Then, the attention coefficient of service nodes in the network is calculated by the self-attention mechanism, and different service nodes in the neighborhood are assigned different weights to classify Web services. Through the graph attention network, the content features of Web service can be well integrated with its structure information. Also, the learned attention weight is more interpretable. The experimental results on the real dataset of ProgrammableWeb platform show that the precision, recall and macro-F1 of the proposed method are greatly improved compared to those of GCN, Node2vec, DeepWalk and Line. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated key-Management Mechanism for e-Healthcare Environment

引用

IEEE Internet of Things Journal 2025年

作者： Saleem, Muhammad Asad Li, Xiong Mahmood, Khalid Ghaffar, Zahid Xie, Yong Wang, Guijuan University of Electronic Science and Technology of China School of Computer Science and Engineering Sichuan Chengdu611731 China National Yunlin University of Science and Technology Graduate School of Intelligent Data Science Yunlin Douliu64002 Taiwan National Yunlin University of Science and Technology Graduate School of Engineering Science and Technology Douliu64002 Taiwan Qinghai Institute of Technology School of Computer and Information Science China Qinghai Provincial Laboratory for Intelligent Computing and Application China Key Laboratory of Computing Power Network and Information Security Jinan250353 China Shandong Provincial Key Laboratory of Industrial Network and Information System Security China Shandong Fundamental Research Center for Computer Science Jinan250353 China

The Internet of Things (IoT) is rapidly permeating all aspects of human life, involving a network of devices that share sensitive data. A notable application is the e-healthcare systems, which employ connected sensors, medical servers, and wearable devices. However, the public nature of communication in e-healthcare systems poses challenges such as security, privacy, and authentication of participating entities. Recently, many authentication protocols have been introduced to address these challenges. However, most of these protocols remain vulnerable to various security attacks, including device or medical server impersonation, denial of service, physical or cloning, and de-synchronization attacks. Therefore, we introduce an authenticated key-management protocol utilizing hash functions and Cipher-Block Chaining-Advanced Encryption Standard encryption (CBC-AES) encryption. The proposed protocol also employs the Physical Unclonable Function (PUF), which makes it more robust and efficient in resisting physical or cloning attacks. Additionally, the proposed scheme resists various security threats, including impersonation, session key leakage, ephemeral secret leakage, and de-synchronization attacks. We analyze the scheme’s security and reliability through formal and informal analysis. The informal analysis demonstrates that the scheme encompasses crucial security features, while the formal analysis substantiates. Moreover, performance analysis of the proposed protocol with various competing results indicates that our protocol achieves an average reduction in communication and computation overheads by 36.03.% and 41.79%, respectively. © 2014 IEEE.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On the Exploitation of Control Knowledge for Enhancing Automated Planning

SSRN

引用

SSRN 2023年

作者： Lu, Xu Yu, Bin Chen, Chu Tian, Cong Duan, Zhenhua Institute of Computing Theory and Technology State Key Laboratory of Integrated Services Networks Xidian University Xi’an710071 China School of Computer Science Qufu Normal University Qufu273165 China

Heuristic search provides an efficient way to automatically explore the state space in planning, while Control Knowledge (CK) also has the potential to significantly increase the performance of planners. Currently, most of the state-of-the-art planners primarily rely on sophisticated heuristic mechanisms. However, these planners fail to scale up and to provide (high-quality) solutions in a range of problems. Appropriate CK may be capable of making hard problems easy to solve, thus leading planners to achieve much higher efficiency. In this paper, we propose a planning approach by incorporating CK with heuristic search in order to leverage the advantages of both. To achieve this, we encode CK specified by a novel variant of Linear Temporal Logic (LTL), referred to as LTL$_{\mathcal{P}}$, into standard planning models. Consequently, we can directly use existing heuristic planners to solve the augmented problem, and avoid tailoring the planners in order to deal with CK implicitly. Experiments demonstrate that our approach shows highly competitive results versus heuristic search and other techniques on many intractable benchmark problems, benefiting in improving the coverage and quality of plans. © 2023, The Authors. All rights reserved.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

Prescribed-Time Synchronization of Multiweighted and Directed Complex Networks

arXiv

引用

arXiv 2022年

作者： Xu, Linlong Liu, Xiwei Department of Computer Science and Technology Tongji University The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai201804 China

In this note, we study the prescribed-time (PT) synchronization of multiweighted and directed complex networks (MWDCNs) via pinning control. Unlike finite-time and fixed-time synchronization, the time for synchronization can be preset as needed, which is independent of initial values and parameters like coupling strength. First and foremost, we reveal the essence of PT stability by improper integral, L'Hospital rule and Taylor expansion theory. Many controllers established previously for PT stability can be included in our new model. Then, we apply this new result on MWDCNs as an application. The synchronization error at the prescribed time is discussed carefully, so, PT synchronization can be reached. The network topology can be directed and disconnected, which means that the outer coupling matrices (OCMs) can be asymmetric and not connected. The relationships between nodes are allowed to be cooperative or competitive, so elements in OCMs and inner coupling matrices (ICMs) can be positive or negative. We use the rearranging variables' order technique to combine ICMs and OCMs together to get the sum matrices, which can make a bridge between multiweighted and single-weighted networks. Finally, simulations are presented to illustrate the effectiveness of our theory. Copyright © 2022, The Authors. All rights reserved.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

ESNet: evolution and succession network for high-resolution salient object detection 24

ESNet: evolution and succession network for high-resolution ...

引用

Proceedings of the 41st International Conference on Machine Learning

作者： Hongyu Liu Runmin Cong Hua Li Qianqian Xu Qingming Huang Wei Zhang Institute of Information Science Beijing Jiaotong University & Beijing Key Laboratory of Advanced Information Science and Network Technology Beijing China School of Control Science and Engineering Shandong University & Key Laboratory of Machine Intelligence and System Control Ministry of Education Jinan China School of Computer Science and Technology Hainan University Hainan China Key Laboratory of Intelligent Information Processing Institute of Computing Technology CAS Beijing China School of Computer Science and Technology University of Chinese Academy of Sciences Beijing China

Preserving details and avoiding high computational costs are the two main challenges for the High-Resolution Salient Object Detection (HRSOD) task. In this paper, we propose a two-stage HRSOD model from the perspective of evolution and succession, including an evolution stage with Low-resolution Location Model (LrLM) and a succession stage with High-resolution Refinement Model (HrRM). The evolution stage achieves detail-preserving salient objects localization on the low-resolution image through the evolution mechanisms on supervision and feature; the succession stage utilizes the shallow high-resolution features to complement and enhance the features inherited from the first stage in a lightweight manner and generate the final high-resolution saliency prediction. Besides, a new metric named Boundary-Detail-aware Mean Absolute Error (MAEBD) is designed to evaluate the ability to detect details in high-resolution scenes. Extensive experiments on five datasets demonstrate that our network achieves superior performance at real-time speed (49 FPS) compared to state-of-the-art methods. Our code is publicly available at: https://***/rmcong/ESNet_ICML24.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DNN Task Assignment in UAV Networks: A Generative AI Enhanced Multi-Agent Reinforcement Learning Approach

arXiv

引用

arXiv 2024年

作者： Tang, Xin Chen, Qian Weng, Wenjie Liao, Binhan Wang, Jiacheng Cao, Xianbin Li, Xiaohuan Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Architecture and Transportation Engineering Guilin University of Electronic Technology Guilin541004 China National Engineering Laboratory for Comprehensive Transportation Big Data Application Technology Guangxi Nanning530001 China College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Electronic and Information Engineering The Key Laboratory of Advanced Technology of Near Space Information System Ministry of Industry and Information Technology of China Beihang University Beijing100191 China

Unmanned Aerial Vehicles (UAVs) possess high mobility and flexible deployment capabilities, prompting the development of UAVs for various application scenarios within the Internet of Things (IoT). The unique capabilities of UAVs give rise to increasingly critical and complex tasks in uncertain and potentially harsh environments. The substantial amount of data generated from these applications necessitates processing and analysis through deep neural networks (DNNs). However, UAVs encounter challenges due to their limited computing resources when managing DNN models. This paper presents a joint approach that combines multiple-agent reinforcement learning (MARL) and generative diffusion models (GDM) for assigning DNN tasks to a UAV swarm, aimed at reducing latency from task capture to result output. To address these challenges, we first consider the task size of the target area to be inspected and the shortest flying path as optimization constraints, employing a greedy algorithm to resolve the subproblem with a focus on minimizing the UAV’s flying path and the overall system cost. In the second stage, we introduce a novel DNN task assignment algorithm, termed GDM-MADDPG, which utilizes the reverse denoising process of GDM to replace the actor network in multi-agent deep deterministic policy gradient (MADDPG). This approach generates specific DNN task assignment actions based on agents’ observations in a dynamic environment. Simulation results indicate that our algorithm performs favorably compared to benchmarks in terms of path planning, Age of Information (AoI), energy consumption, and task load balancing. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

Local Differential Privacy is Not Enough: A Sample Reconstruction Attack against Federated Learning with Local Differential Privacy

arXiv

引用

arXiv 2025年

作者： You, Zhichao Dong, Xuewen Li, Shujun Liu, Ximeng Ma, Siqi Shen, Yulong School of Computer Science & Technology Xidian University China Shaanxi Key Laboratory of Network and System Security Xi’an China University of Kent Canterbury United Kingdom College of Computer and Data Science Fuzhou University Fuzhou China School of System and Computing University of New South Wales CanberraACT2612 Australia

Reconstruction attacks against federated learning (FL) aim to reconstruct users’ samples through users’ uploaded gradients. Local differential privacy (LDP) is regarded as an effective defense against various attacks, including sample reconstruction in FL, where gradients are clipped and perturbed. Existing attacks are ineffective in FL with LDP since clipped and perturbed gradients obliterate most sample information for reconstruction. Besides, existing attacks embed additional sample information into gradients to improve the attack effect and cause gradient expansion, leading to a more severe gradient clipping in FL with LDP. In this paper, we propose a sample reconstruction attack against LDP-based FL with any target models to reconstruct victims’ sensitive samples to illustrate that FL with LDP is not flawless. Considering gradient expansion in reconstruction attacks and noise in LDP, the core of the proposed attack is gradient compression and reconstructed sample denoising. For gradient compression, an inference structure based on sample characteristics is presented to reduce redundant gradients against LDP. For reconstructed sample denoising, we artificially introduce zero gradients to observe noise distribution and scale confidence interval to filter the noise. Theoretical proof guarantees the effectiveness of the proposed attack. Evaluations show that the proposed attack is the only attack that reconstructs victims’ training samples in LDP-based FL and has little impact on the target model’s accuracy. We conclude that LDP-based FL needs further improvements to defend against sample reconstruction attacks effectively. Copyright © 2025, The Authors. All rights reserved.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Detecting Backdoors During the Inference Stage Based on Corruption Robustness Consistency

arXiv

引用

arXiv 2023年

作者： Liu, Xiaogeng Li, Minghui Wang, Haoyu Hu, Shengshan Ye, Dengpan Jin, Hai Wu, Libing Xiao, Chaowei School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Software Engineering Huazhong University of Science and Technology China National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab China School of Cyber Science and Engineering Wuhan University China Arizona State University United States

Deep neural networks are proven to be vulnerable to backdoor attacks. Detecting the trigger samples during the inference stage, i.e., the test-time trigger sample detection, can prevent the backdoor from being triggered. However, existing detection methods often require the defenders to have high accessibility to victim models, extra clean data, or knowledge about the appearance of backdoor triggers, limiting their practicality. In this paper, we propose the test-time corruption robustness consistency evaluation (TeCo)1, a novel test-time trigger sample detection method that only needs the hard-label outputs of the victim models without any extra information. Our journey begins with the intriguing observation that the backdoor-infected models have similar performance across different image corruptions for the clean images, but perform discrepantly for the trigger samples. Based on this phenomenon, we design TeCo to evaluate test-time robustness consistency by calculating the deviation of severity that leads to predictions' transition across different corruptions. Extensive experiments demonstrate that compared with state-of-the-art defenses, which even require either certain information about the trigger types or accessibility of clean data, TeCo outperforms them on different backdoor attacks, datasets, and model architectures, enjoying a higher AUROC by 10% and 5 times of stability. Copyright © 2023, The Authors. All rights reserved.

关键词： Crime

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

arXiv

引用

arXiv 2023年

作者： Zhou, Ziqi Hu, Shengshan Zhao, Ruizhi Wang, Qian Zhang, Leo Yu Hou, Junhui Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China School of Information and Communication Technology Griffith University Australia Department of Computer Science City University of Hong Kong Hong Kong National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial use. In this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://github. com/CGCL-codes/AdvEncoder. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：