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

UDT:U-shaped deformable transformer for subarachnoid haemorrhage image segmentation

CAAI Transactions on Intelligence Technology 2024年第3期9卷 756-768页

作者： Wei Xie Lianghao Jin Shiqi Hua Hao Sun Bo Sun Zhigang Tu Jun Liu Hubei Provincial Key Laboratory of Artificial Intelligence and Smart Learning Central China Normal UniversityWuhanChina School of Computer Science Central China Normal UniversityWuhanChina National Language Resources Monitoring and Research Center for Network Media Central China Normal UniversityWuhanChina The First Affiliated Hospital of Dalian Medical University DalianChina State Key Laboratory of Information Engineering in Surveying Mapping and Remote SensingWuhan UniversityWuhanChina Information Systems Technology and Design Pillar Singapore University of Technology and DesignSingaporeSingapore

Subarachnoid haemorrhage(SAH),mostly caused by the rupture of intracranial aneu-rysm,is a common disease with a high fatality *** lesions are generally diffusely distributed,showing a variety of scales with irregular *** complex characteristics of lesions make SAH segmentation a challenging *** cope with these difficulties,a u-shaped deformable transformer(UDT)is proposed for SAH ***,first,a multi-scale deformable attention(MSDA)module is exploited to model the diffuseness and scale-variant characteristics of SAH lesions,where the MSDA module can fuse features in different scales and adjust the attention field of each element dynamically to generate discriminative multi-scale ***,the cross deformable attention-based skip connection(CDASC)module is designed to model the irregular edge char-acteristic of SAH lesions,where the CDASC module can utilise the spatial details from encoder features to refine the spatial information of decoder ***,the MSDA and CDASC modules are embedded into the backbone Res-UNet to construct the proposed *** experiments are conducted on the self-built SAH-CT dataset and two public medical datasets(GlaS and MoNuSeg).Experimental results show that the presented UDT achieves the state-of-the-art performance.

关键词： image segmentation medical image processing

来源：评论

学校读者我要写书评

暂无评论

Performance Optimization for Vehicular Cooperative Sensing: A Graph Attention Based Reinforcement Learning Approach

Performance Optimization for Vehicular Cooperative Sensing: ...

引用

2024 IEEE Global Communications Conference, GLOBECOM 2024

作者： Li, Xuefei Chen, Mingzhe Liu, Danpu Zhang, Zhilong Quek, Tony Q. S. Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China University of Miami Department of Electrical and Computer Engineering Institute for Data Science and Computing Coral GablesFL33146 United States Information Systems Technology and Design Pillar Singapore University of Technology and Design 487372 Singapore

ISBN: (纸本)9798350351255

In this paper, the problem of collaborative vehicle sensing is investigated. In the considered model, a set of cooperative vehicles provide sensing information to sensing request vehicles with limited sensing and communication resources. A base station (BS) determines the subset of sensing request vehicles that each cooperative vehicle will serve and the sub-regions that each cooperative vehicle will detect. We formulate an optimization problem aiming to maximize the number of successfully detected sub-regions of sensing request vehicles while satisfying the cooperative sensing energy requirement by jointly determining the cooperative vehicle association and the sensing sub-region selection. To solve this problem, we propose a graph attention based reinforcement learning (RL) algorithm that can generate the graph information vectors based on the correlation between each cooperative vehicle and each sensing request vehicle. Using the learned graph information, the joint cooperative vehicle association and sensing sub-region selection strategy will be determined. Simulation results show that the proposed scheme can improve the number of successfully detected sub-regions of sensing request vehicles by up to 12.5% compared to the conventional RL algorithm without using graph attention networks (GANs). © 2024 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

FPPNet: Fast Privacy-Preserving Neural network via Three-Party Arithmetic Secret Sharing 15th

FPPNet: Fast Privacy-Preserving Neural Network via Three-Pa...

引用

15th EAI International Conference on Mobile Multimedia Communications, MobiMedia 2022

作者： Bi, Renwan Xiong, Jinbo Li, Qi Liu, Ximeng Tian, Youliang Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fujian Normal University Fuzhou350117 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Cryptography of Zhejiang Province Hangzhou Normal University Hangzhou311121 China Key Laboratory of Information Security of Network Systems College of Mathematics and Computer Science Fuzhou University Fuzhou350108 China State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China

ISBN: (纸本)9783031239014

Jointing multi-source data for model training can improve the accuracy of neural network. To solve the raising privacy concerns caused by data sharing, data are generally encrypted and outsourced to a group of cloud servers for computing and processing. In this client-cloud architecture, we propose FPPNet, a fast and privacy-preserving neural network for secure inference on sensitive data. FPPNet is deployed in three cloud servers, who collaboratively execute privacy computing via three-party arithmetic secret sharing. We develop the secure conversion method between additive shares and multiplicative shares, and propose three secure protocols to calculate non-linear functions, such as comparison, exponent and division that are superior to prior three-party works. Some secure modules for running convolutional, ReLU, max-pooling and Sigmoid layers are designed to implement FPPNet. We theoretically analyze the security and complexity of the proposed protocols. With MNIST dataset and two types of neural networks, experimental results validate that our FPPNet is faster than the related works, and the accuracy is the same as that of plaintext neural network. © 2022, ICST Institute for computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

MEAT: Median-Ensemble Adversarial Training for Improving Robustness and Generalization

MEAT: Median-Ensemble Adversarial Training for Improving Rob...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zhaozhe Hu Jia-Li Yin Bin Chen Luojun Lin Bo-Hao Chen Ximeng Liu Fujian Province Key Laboratory of Information Security and Network Systems Fuzhou China College of Computer Science and Big Data Fuzhou University Fuzhou China Department of Computer Science and Engineering Yuan Ze University Taiwan

Self-ensemble adversarial training methods improve model robustness by ensembling models at different training epochs, such as model weight averaging (WA). However, previous research has shown that self-ensemble defense methods in adversarial training (AT) still suffer from robust overfitting, which severely affects the generalization performance. Empirically, in the late phases of training, the AT becomes more overfitting to the extent that the individuals for weight averaging also suffer from overfitting and produce anomalous weight values, which causes the self-ensemble model to continue to undergo robust overfitting due to the failure in removing the weight anomalies. To solve this problem, we aim to tackle the influence of outliers in the weight space in this work and propose an easy-to-operate and effective Median-Ensemble Adversarial Training (MEAT) method to solve the robust overfitting phenomenon existing in self-ensemble defense from the source by searching for the median of the historical model weights. Experimental results show that MEAT achieves the best robustness against the powerful AutoAttack and can effectively allievate the robust overfitting. We further demonstrate that most defense methods can improve robust generalization and robustness by combining with MEAT.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The Immense Impact of Reverse Edges on Large Hierarchical networks

引用

Engineering 2024年第5期36卷 240-249页

作者： Haosen Cao Bin-Bin Hu Xiaoyu Mo Duxin Chen Jianxi Gao Ye Yuan Guanrong Chen Tamás Vicsek Xiaohong Guan Hai-Tao Zhang MOE Engineering Research Center of Autonomous Intelligent Unmanned Systems State Key Laboratory of Intelligent Manufacturing Equipment and TechnologySchool of Artificial Intelligence and AutomationHuazhong University of Science and TechnologyWuhan 430074China School of Mechanical and Aerospace Engineering Nanyang Technological UniversitySingapore 639798Singapore Jiangsu Key Laboratory of Networked Collective Intelligence School of MathematicsSoutheast UniversityNanjing 210096China Department of Computer Science Rensselaer Polytechnic InstituteTroyNY 12180USA Department of Electronic Engineering City University of Hong KongHong Kong 999077China Department of Biological Physics Eötvös UniversityBudapest 1117Hungary MOE Key Laboratory for Intelligent Networks and Network Security School of Automation Science and EngineeringXi’an Jiaotong UniversityXi’an 710049China

Hierarchical networks are frequently encountered in animal groups,gene networks,and artificial engineering systems such as multiple robots,unmanned vehicle systems,smart grids,wind farm networks,and so *** structure of a large directed hierarchical network is often strongly influenced by reverse edges from lower-to higher-level nodes,such as lagging birds’howl in a flock or the opinions of lowerlevel individuals feeding back to higher-level ones in a social *** study reveals that,for most large-scale real hierarchical networks,the majority of the reverse edges do not affect the synchronization process of the entire network;the synchronization process is influenced only by a small part of these reverse edges along specific *** surprisingly,a single effective reverse edge can slow down the synchronization of a huge hierarchical network by over 60%.The effect of such edges depends not on the network size but only on the average in-degree of the involved *** overwhelming majority of active reverse edges turn out to have some kind of“bunching”effect on the information flows of hierarchical networks,which slows down synchronization *** finding refines the current understanding of the role of reverse edges in many natural,social,and engineering hierarchical networks,which might be beneficial for precisely tuning the synchronization rhythms of these *** study also proposes an effective way to attack a hierarchical network by adding a malicious reverse edge to it and provides some guidance for protecting a network by screening out the specific small proportion of vulnerable nodes.

关键词： Synchronizability Large hierarchical networks Reverse edges Information flows Complex networks

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and Computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MEAT: MEDIAN-ENSEMBLE ADVERSARIAL TRAINING FOR IMPROVING ROBUSTNESS AND GENERALIZATION

arXiv

引用

arXiv 2024年

作者： Hu, Zhaozhe Yin, Jia-Li Chen, Bin Lin, Luojun Chen, Bo-Hao Liu, Ximeng Fujian Province Key Laboratory of Information Security and Network Systems Fuzhou350108 China College of Computer Science and Big Data Fuzhou University Fuzhou350108 China Department of Computer Science and Engineering Yuan Ze University Taiwan

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

Federated Online/Offline Remote Data Inspection for Distributed Edge Computing

arXiv

引用

arXiv 2023年

作者： Ali, Mohammad Liu, Ximeng The Department of Mathematics and Computer Science Amirkabir University of Technology Tehran Iran The Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou350108 China

In edge computing environments, app vendors can cache their data to be shared with their users in many geographically distributed edge servers. However, the cached data is particularly vulnerable to several intentional attacks or unintentional events. Given the limited resources of edge servers and prohibitive storage costs incurred by app vendors, designing an efficient approach to inspect and maintain the data over tremendous edge servers is a critical issue. To tackle the problem, we design a novel data inspection approach, named O2DI, that provides the following services: i) using O2DI, app vendors can inspect the data cached in edge servers without having the original data, which reduces the incurred I/O and storage overhead significantly;ii) computational operations conducted by both edge servers and app vendors are highly efficient because of a novel online/offline technique;iii) many data files cached in different edge servers can be verified quickly and at once by using a novel batch verification method;iv) corrupted data in edge servers can be localized and repaired efficiently. We analyze the security and performance of O2DI. We see that it is secure in the random oracle model, much faster, and more cost-effective compared to state-of-the-art approaches. © 2023, CC BY.

关键词： Inspection

来源：评论

学校读者我要写书评

暂无评论

A fully decentralized auditing approach for edge computing: A Game-Theoretic Perspective

arXiv

引用

arXiv 2023年

作者： Seyedi, Zahra Rahmati, Farhad Ali, Mohammad Liu, Ximeng Department of Mathematics and Computer Science Amirkabir University of Technology Tehran Iran Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou350108 China

Edge storage presents a viable data storage alternative for application vendors (AV), offering benefits such as reduced bandwidth overhead and latency compared to cloud storage. However, data cached in edge computing systems is susceptible to intentional or accidental disturbances. This paper proposes a decentralized integrity auditing scheme to safeguard data integrity and counter the traditional reliance on centralized third-party auditors (TPA), which are unfit for distributed systems. Our novel approach employs edge servers (ES) as mutual auditors, eliminating the need for a centralized entity. This decentralization minimizes potential collusion with malicious auditors and biases in audit outcomes. Using a strategic game model, we demonstrate that ESs are more motivated to audit each other than TPAs. The auditing process is addressed as a Nash Equilibrium problem, assuring accurate integrity proof through incentives for ESs. Our scheme’s security and performance are rigorously assessed, showing it is secure within the random oracle model, offers improved speed, and is cost-effective compared to existing methods. © 2023, CC0.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Continual Reinforcement Learning for Digital Twin Synchronization Optimization

引用

IEEE Transactions on Mobile Computing 2025年

作者： Tong, Haonan Chen, Mingzhe Zhao, Jun Hu, Ye Yang, Zhaohui Liu, Yuchen Yin, Changchuan Beijing University of Posts and Telecommunications Beijing Key Laboratory of Network System Architecture and Convergence Beijing Advanced Information Network Laboratory Beijing China College of Computing and Data Science Singapore University of Miami Department of Electrical and Computer Engineering Frost Institute for Data Science and Computing Coral Gables33146 United States University of Miami Department of Industrial and Systems Engineering Coral Gables33146 United States Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China North Carolina State University Department of Computer Science RaleighNC27695 United States Beijing Key Laboratory of Network System Architecture and Convergence China Beijing University of Posts and Telecommunications Beijing Advanced Information Network Laboratory Beijing100876 China

This article investigates the adaptive resource allocation scheme for digital twin (DT) synchronization optimization over dynamic wireless networks. In our considered model, a base station (BS) continuously collects factory physical object state data from wireless devices to build a real-time virtual DT system for factory event analysis. Due to continuous data transmission, maintaining DT synchronization must use extensive wireless resources. To address this issue, a subset of devices is selected to transmit their sensing data, and resource block (RB) allocation is optimized. This problem is formulated as a constrained Markov process (CMDP) problem that minimizes the long-term mismatch between the physical and virtual systems. To solve this CMDP, we first transform the problem into a dual problem that refines RB constraint impacts on device scheduling strategies. We then propose a continual reinforcement learning (CRL) algorithm to solve the dual problem. The CRL algorithm learns a stable policy across historical experiences for quick adaptation to dynamics in physical states and network capacity. Simulation results show that the CRL can adapt quickly to network capacity changes and reduce normalized root mean square error (NRMSE) between physical and virtual states by up to 55.2%, using the same RB number as traditional methods. © 2025 IEEE. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：