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

Interference Characterization and Mitigation for Multi-Beam ISAC Systems in Vehicular Networks

IEEE Transactions on Wireless Communications 2024年第10期23卷 14729-14742页

作者： Wang, Yi Zhang, Qixun Zhang, J. Andrew Wei, Zhiqing Feng, Zhiyong Peng, Jinlin The School of Information and Communication Engineering University of Electronic Science and Technology of China Chengdu611731 China University of Electronic Science and Technology of China Quzhou324003 China The Key Laboratory of Universal Wireless Communications Ministry of Education Beijing University of Posts and Telecommunications Beijing100876 China The Global Big Data Technologies Centre University of Technology Sydney SydneyNSW2007 Australia The Artificial Intelligence Research Center National Innovation Institute of Defense Technology Beijing100071 China

— Millimeter-wave Integrated Sensing and Communications (ISAC) with multi-beam design holds significant promise for vehicular networks, offering multi-target omnidirectional sensing and high-capacity communication services concurrently. Nonetheless, the considerable challenge of potential mutual interference arises due to the high mobility and density of transmitters in such networks. To address this challenge effectively, we propose leveraging inter-vehicle communication to schedule communication and sensing signals for vehicles, thereby enhancing networked sensing capabilities. We first introduce an analytical framework to characterize the mutual interference among multiple vehicles. Subsequently, we evaluate the effectiveness of our proposed interference mitigation method in terms of interference probability, duration, and the achievable detectable density. Additionally, recognizing the different performance requirements of communication and sensing functions, we investigate a joint resource allocation problem catering to both aspects. Simulation results demonstrate a notable enhancement in the proposed ISAC-based interference mitigation, with a 58% reduction in interference probability compared to benchmarking schemes. © 2002-2012 IEEE.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

An Iterative Thresholding Method for the Minimum Compliance Problem

引用

Communications in Computational Physics 2023年第4期33卷 1189-1216页

作者： Luyu Cen Wei Hu Dong Wang Xiaoping Wang Department of Mathematics Hong Kong University of Science and TechnologyClear Water BayKowloonHong KongChina The Program in Applied and Computational Mathematics Princeton UniversityPrincetonNew JerseyUSA School of Science and Engineering The Chinese University of Hong KongShenzhenGuangdong 518172China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big DataGuangdong 518172China

In this paper,we propose a simple energy decaying iterative thresholding algorithm to solve the two-phase minimum compliance *** material domain is implicitly represented by its characteristic function,and the problem is formulated into a minimization problem by the principle of minimum complementary *** prove that the energy is decreasing in each *** effective continuation schemes are proposed to avoid trapping into the local *** results on 2D isotropic linear material demonstrate the effectiveness of the proposed methods.

关键词： Minimum compliance convolution thresholding linear elasticity

来源：评论

学校读者我要写书评

暂无评论

A Clustering-Based Color Reordering Method for Reversible data Hiding in Palette Images

引用

IET Image Processing 2025年第1期19卷

作者： Deng, Jianxuan Chen, Yi Wang, Hongxia Guo, Chun Cui, Yunhe Shen, Guowei State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang China Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Guizhou University Guiyang China School of Cyber Science and Engineering Sichuan University Chengdu China

A recent research work pointed out that the reversible data hiding algorithms proposed for gray-scale images can be implemented on the reconstructed palette images to improve embedding capacity and visual quality by reordering the color table. However, the reordering effect has a significant impact on performance improvement. Therefore, we propose a clustering-based color reordering method for reversible data hiding in palette images to improve the reordering effect and further enhance the performance. In this method, we first design a centroid initialization method to select the initial centroids and then exploit the K-means algorithm to generate (Formula presented.) clusters for the colors in the original color table. In the following, our proposed method, respectively, reorders the colors of these clusters by a greedy strategy and concatenates them into the reordered color table. Based on the relationship between the original and the reordered color tables, a novel index matrix can be reconstructed. Finally, state-of-the-art reversible data hiding algorithms can be implemented on the reconstructed index matrix for performance improvement. Since our proposed method improves the reordering effect, enhances the correlation of the reconstructed index matrix, and reduces the length of the encoded location map, the maximal embedding capacities and the visual quality under the fixed embedding capacities are improved. We conducted experiments on two image datasets and six standard images to verify that the performance improvement of our proposed reordering method is better than that of the state-of-the-art methods. © 2025 The Author(s). IET Image Processing published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Multiscale and Auto-Tuned Semi-Supervised Deep Subspace Clustering and Its Application in Brain Tumor Clustering

引用

computers, Materials & Continua 2024年第6期79卷 4741-4762页

作者： Zhenyu Qian Yizhang Jiang Zhou Hong Lijun Huang Fengda Li Khin Wee Lai Kaijian Xia School of Artificial Intelligence and Computer Science Jiangnan UniversityWuxi214122China Department of Medical Imaging The Changshu Affiliated Hospital of Soochow UniversitySuzhou215500China Department of Neurosurgery The Changshu Affiliated Hospital of Soochow UniversityChangshu215500China Department of Scientific Research The Changshu Affiliated Hospital of Soochow UniversitySuzhou215500China Changshu Key Laboratory of Medical Artificial Intelligence and Big Data Suzhou215500China Department of Biomedical Engineering Faculty of EngineeringUniversity of MalayaKuala Lumpur50603Malaysia

In this paper,we introduce a novel Multi-scale and Auto-tuned Semi-supervised Deep Subspace Clustering(MAS-DSC)algorithm,aimed at addressing the challenges of deep subspace clustering in high-dimensional real-world data,particularly in the field of medical *** deep subspace clustering algorithms,which are mostly unsupervised,are limited in their ability to effectively utilize the inherent prior knowledge in medical *** MAS-DSC algorithm incorporates a semi-supervised learning framework that uses a small amount of labeled data to guide the clustering process,thereby enhancing the discriminative power of the feature ***,the multi-scale feature extraction mechanism is designed to adapt to the complexity of medical imaging data,resulting in more accurate clustering *** address the difficulty of hyperparameter selection in deep subspace clustering,this paper employs a Bayesian optimization algorithm for adaptive tuning of hyperparameters related to subspace clustering,prior knowledge constraints,and model loss *** experiments on standard clustering datasets,including ORL,Coil20,and Coil100,validate the effectiveness of the MAS-DSC *** results show that with its multi-scale network structure and Bayesian hyperparameter optimization,MAS-DSC achieves excellent clustering results on these ***,tests on a brain tumor dataset demonstrate the robustness of the algorithm and its ability to leverage prior knowledge for efficient feature extraction and enhanced clustering performance within a semi-supervised learning framework.

关键词： Deep subspace clustering multiscale network structure automatic hyperparameter tuning semi-supervised medical image clustering

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Multiview Top-k Pooling with Deep-Q-Networks

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2985-2996页

作者： Li, Zhi-Peng Su, Hai-Long Wu, Yong- Zhang, Qin-Hu Yuan, Chang-An Gribova, Valeriya Filaretov, Vladimir Fedorovich Huang, De-Shuang Eastern Institute of Technology Zhejiang Ningbo315201 China University of Science and Technology of China School of Life Sciences Anhui Hefei230026 China Tongji University Institute of Machine Learning and Systems Biology School of Electronics and Information Engineering Shanghai201804 China Guangxi Academy of Sciences Institute of Big Data and Intelligent Computing Research Center Nanning530007 China Far Eastern Branch of the Russian Academy of Sciences Institute of Automation and Control Processes Vladivostok690041 Russia

Graph neural networks (GNNs) are extensions of deep neural networks to graph-structured data. It has already attracted widespread attention for various tasks such as node classification and link prediction. Existing research focuses more on graph convolutional neural networks (GCNs). However, it is usually overlooked that graph pooling can obtain graph representations by summarizing and down-sampling node information. Meanwhile, existing graph pooling methods mainly use top-k for node selection, but most of them consider only single view information when scoring nodes, and the k values in top-k are usually selected empirically. This work proposes the hierarchical multiview top-k pooling (HMTPool) with deep-Q-networks, which scores nodes taking into account multiview information (considering graph structure and features) and does not rely on the empirical adaptive selection of the best k value. HMTPool is a two-stage process. It first uses a variant GCN and multilayer perceptron to score the nodes from structural and feature perspectives, respectively and then performs fusion operations on the multiview information scores of the nodes. In addition, to select the optimal pooling ratio of top-k, we propose a deep-Q-network-based top-k (DTop-k) node selection method, which can adaptively select the best pooling ratio without prior knowledge. Experimental results on six TUdatasets and two Benchmarking GNNs datasets demonstrate the effectiveness of our proposed approach. © 2020 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

NumbOD: A Spatial-Frequency Fusion Attack Against Object Detectors

arXiv

引用

arXiv 2024年

作者： Zhou, Ziqi Li, Bowen Song, Yufei Yu, Zhifei Hu, Shengshan Wan, Wei Zhang, Leo Yu Yao, Dezhong Jin, Hai National Engineering Research Center for Big Data Technology and System China Services Computing Technology and System Lab China Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security China Hubei Key Laboratory of Distributed System Security China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Information and Communication Technology Griffith University Australia

With the advancement of deep learning, object detectors (ODs) with various architectures have achieved significant success in complex scenarios like autonomous driving. Previous adversarial attacks against ODs have been focused on designing customized attacks targeting their specific structures (e.g., NMS and RPN), yielding some results but simultaneously constraining their scalability. Moreover, most efforts against ODs stem from image-level attacks originally designed for classification tasks, resulting in redundant computations and disturbances in object-irrelevant areas (e.g., background). Consequently, how to design a model-agnostic efficient attack to comprehensively evaluate the vulnerabilities of ODs remains challenging and unresolved. In this paper, we propose NumbOD, a brand-new spatial-frequency fusion attack against various ODs, aimed at disrupting object detection within images. We directly leverage the features output by the OD without relying on its internal structures to craft adversarial examples. Specifically, we first design a dual-track attack target selection strategy to select high-quality bounding boxes from OD outputs for targeting. Subsequently, we employ directional perturbations to shift and compress predicted boxes and change classification results to deceive ODs. Additionally, we focus on manipulating the high-frequency components of images to confuse ODs' attention on critical objects, thereby enhancing the attack efficiency. Our extensive experiments on nine ODs and two datasets show that NumbOD achieves powerful attack performance and high stealthiness. Copyright © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Geometric Latent Diffusion Model for Graph Generation 41

Hyperbolic Geometric Latent Diffusion Model for Graph Genera...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Fu, Xingcheng Gao, Yisen Wei, Yuecen Sun, Qingyun Peng, Hao Li, Jianxin Li, Xianxian Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin China Institute of Artificial Intelligence Beihang University Beijing China School of Software Beihang University Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing School of Computer Science and Engineering Beihang University Beijing China

Diffusion models have made significant contributions to computer vision, sparking a growing interest in the community recently regarding the application of them to graph generation. Existing discrete graph diffusion models exhibit heightened computational complexity and diminished training efficiency. A preferable and natural way is to directly diffuse the graph within the latent space. However, due to the non-Euclidean structure of graphs is not isotropic in the latent space, the existing latent diffusion models effectively make it difficult to capture and preserve the topological information of graphs. To address the above challenges, we propose a novel geometrically latent diffusion framework HypDiff. Specifically, we first establish a geometrically latent space with interpretability measures based on hyperbolic geometry, to define anisotropic latent diffusion processes for graphs. Then, we propose a geometrically latent diffusion process that is constrained by both radial and angular geometric properties, thereby ensuring the preservation of the original topological properties in the generative graphs. Extensive experimental results demonstrate the superior effectiveness of HypDiff for graph generation with various topologies. Copyright 2024 by the author(s)

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks for Vulnerability Detection: A Counterfactual Explanation

arXiv

引用

arXiv 2024年

作者： Chu, Zhaoyang Wan, Yao Li, Qian Wu, Yang Zhang, Hongyu Sui, Yulei Xu, Guandong Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology China School of Electrical Engineering Computing and Mathematical Sciences Curtin University Australia School of Big Data and Software Engineering Chongqing University China School of Computer Science and Engineering University of New South Wales Australia School of Computer Science University of Technology Sydney Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

Vulnerability detection is crucial for ensuring the security and reliability of software systems. Recently, Graph Neural Networks (GNNs) have emerged as a prominent code embedding approach for vulnerability detection, owing to their ability to capture the underlying semantic structure of source code. However, GNNs face significant challenges in explainability due to their inherently black-box nature. To this end, several factual reasoning-based explainers have been proposed. These explainers provide explanations for the predictions made by GNNs by analyzing the key features that contribute to the outcomes. We argue that these factual reasoning-based explanations cannot answer critical what-if questions: "What would happen to the GNN's decision if we were to alter the code graph into alternative structures?" Inspired by advancements of counterfactual reasoning in artificial intelligence, we propose CFExplainer, a novel counterfactual explainer for GNN-based vulnerability detection. Unlike factual reasoning-based explainers, CFExplainer seeks the minimal perturbation to the input code graph that leads to a change in the prediction, thereby addressing the what-if questions for vulnerability detection. We term this perturbation a counterfactual explanation, which can pinpoint the root causes of the detected vulnerability and furnish valuable insights for developers to undertake appropriate actions for fixing the vulnerability. Extensive experiments on four GNN-based vulnerability detection models demonstrate the effectiveness of CFExplainer over existing state-of-the-art factual reasoning-based explainers. © 2024, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Privacy-aware data Fusion and Prediction for Smart City Services in Edge Computing Environment 15

Privacy-aware Data Fusion and Prediction for Smart City Serv...

引用

2022 IEEE Congress on Cybermatics: 15th IEEE International Conferences on Internet of Things, iThings 2022, 18th IEEE International Conferences on Green Computing and Communications, GreenCom 2022, 2022 IEEE International Conference on Cyber, Physical and Social Computing, CPSCom 2022 and 8th IEEE International Conference on Smart data, Smartdata 2022

作者： Qi, Lianyong Chi, Xiaoxiao Zhou, Xiaokang Liu, Qi Dai, Fei Xu, Xiaolong Zhang, Xuyun School of Computer Science Qufu Normal University China Faculty of Data Science Shiga University Japan Riken Center for Advanced Intelligence Project Japan School of Computer and Software Nanjing University of Information Science and Technology China School of Big Data and Intelligence Engineering Southwest Forestry University China Department of Computing Macquarie University Australia

ISBN: (数字)9781665454179

ISBN: (纸本)9781665454179

With fast development of Cyber Physical System, the variety and volume of data generated from different edge servers are fairly considerable. Mining and exploiting the data would definitely bring huge advantages. However, there are two major issues exposed in the process. First, utilizing the data with high efficiency is challenging in edge computing environment. Second, data from multiple edge servers often contain sensitive information such as user preferences, which will give rise to privacy breach risks when using the data. Locality-Sensitive Hashing and amplified technology are utilized for dealing with two problems. In this paper, we propose a novel privacy-protection approach named SRchain-LSH in edge computing environment which is based on amplified Locality-Sensitive Hashing technique. In order to verify high accuracy and efficiency of our proposal, large sets of experiments are conducted. According to experimental results, our proposal shows better performance than those of comparative methods in terms of MAE , RMSE and time costs. For our method, the best value of MAE is about 0.41 and time cost is about 0.1 seconds, which are more accurate and efficient than comparative methods. © 2022 IEEE.

关键词： Smart city

来源：评论

学校读者我要写书评

暂无评论

PB-UAP: Hybride Universal Adversarial Attack for Image Segmentation

PB-UAP: Hybride Universal Adversarial Attack for Image Segme...

引用

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

作者： Yufei Song Ziqi Zhou Minghui Li Xianlong Wang Hangtao Zhang Menghao Deng Wei Wan Shengshan Hu Leo Yu Zhang Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology School of Computer Science and Technology Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

With the rapid advancement of deep learning, the model robustness has become a significant research hotspot, i.e., adversarial attacks on deep neural networks. Existing works primarily focus on image classification tasks, aiming to alter the model’s predicted labels. Due to the output complexity and deeper network architectures, research on adversarial examples for segmentation models is still limited, particularly for universal adversarial perturbations. In this paper, we propose a novel universal adversarial attack method designed for segmentation models, which includes dual feature separation and low-frequency scattering modules. The two modules guide the training of adversarial examples in the pixel and frequency space, respectively. Experiments demonstrate that our method achieves high attack success rates surpassing the state-of-the-art methods, and exhibits strong transferability across different models.

关键词： Training Image segmentation Perturbation methods Semantics Scattering Signal processing Predictive models Network architecture Robustness Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：