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

Towards Adaptive Masked Structural Learning for Graph-Level Clustering

IEEE Transactions on Network science and Engineering 2025年第3期12卷 2021-2032页

作者： Yang, Jinbin Cai, Jinyu Zhang, Yunhe Huang, Sujia Wang, Shiping Fuzhou University College of Computer and Data Science Fuzhou350116 China Bank of Quanzhou Company Ltd. Quanzhou362046 China National University of Singapore Institute of Data Science 117602 Singapore Shenzhen Research Institute of Big Data Shenzhen518172 China Chinese University of Hong Kong Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen518172 China

Graph data presents a vast landscape for real-world applications. Current graph-level clustering approaches predominantly utilize graph neural networks to capture the intricate structural information for graph data. However, a significant challenge arises in effectively integrate structural and feature information under the prevalent noise in the real-world scenario. The advent of masking strategies has marked significant strides in boosting model robustness, accommodating incomplete data, and enhancing generalization capabilities. Yet, research attention on leveraging mask strategy for facilitating graph-level clustering is still limited. In this paper, we introduce a novel graph-level clustering method, towards adaptive masked structural learning for graph-level clustering. The method performs adaptive masking through reconstruction loss, and jointly adaptive mask representation learning and clustering in an end-to-end unsupervised framework. The mutual information between maximized the entire graph and substructure representations is also utilized to learn to generate cluster-oriented graph-level representations. Extensive experiments on eight real graph-level benchmark datasets demonstrate the effectiveness and superiority of the proposed method. © 2013 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

RIS-Assisted ISAC Systems for Robust Secure Transmission with Imperfect Sense Estimation

引用

IEEE Transactions on Wireless Communications 2025年第5期24卷 3979-3992页

作者： Jiang, Chengjun Zhang, Chensi Huang, Chongwen Ge, Jianhua Niyato, Dusit Yuen, Chau Xidian University State Key Laboratory of Integrated Service Networks Xi'an710071 China Zhejiang University College of Information Science and Electronic Engineering Hangzhou310027 China Zhejiang Provincial Key Laboratory of Multi-Modal Communication Networks and Intelligent Information Processing Hangzhou310027 China Nanyang Technological University College of Computing and Data Science Singapore Singapore Nanyang Technological University School of Electrical and Electronics Engineering Singapore Singapore

In this paper, we investigate reconfigurable intelligent surface (RIS)-assisted integrated sensing and communication (ISAC) systems for robust physical layer security (PLS) schemes. Traditionally, eavesdroppers (Eves) typically avoid interacting with the base station, making it challenging to obtain their relevant information, which limits the implementation of PLS. Fortunately, the sensing information obtained by ISAC can contribute to the design of PLS. Therefore, leveraging imperfect sensing estimation and employing dedicated radar signals as artificial noise, we formulate an RIS-assisted joint active and passive beamforming design problem to maximize the sum secrecy rate while satisfying the user's quality of service constraints, the transmission power constraints, and the sensing signal strength requirements. To make the problem tractable, we first derive the bound for Eve's channel state information uncertainty region based on security approximations. Subsequently, we employ the S-procedure and the symbolic-deterministic methods to transform the infinite number of inequalities. We then utilize the first-order Taylor expansion, the second-order cone methods, and the successive convex approximation to address the nonconvexity problem, leading to an efficient suboptimal solution obtained by an iterative algorithm. Finally, the simulation results demonstrate the significant potential of the sensing function in enhancing security and the effectiveness of the proposed robust scheme in flexibly balancing communication and sensing quality. © 2002-2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges

引用

IEEE Transactions on Knowledge and data Engineering 2025年第6期37卷 3342-3355页

作者： Zhou, Xiaotian Zehmakan, Ahad N. Zhang, Zhongzhi Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai200433 China School of Computing Australian National University CanberraACT2601 Australia Research Institute of Intelligent Complex Systems Fudan University Shanghai200433 China

The Kirchhoff index, which is the sum of the resistance distance between every pair of nodes in a network, is a key metric for gauging network performance, where lower values signify enhanced performance. In this paper, we study the problem of minimizing the Kirchhoff index by adding edges. We first provide a greedy algorithm for solving this problem and give an analysis of its quality based on the bounds of the submodularity ratio and the curvature. Then, we introduce a gradient-based greedy algorithm as a new paradigm to solve this problem. To accelerate the computation cost, we leverage geometric properties, convex hull approximation, and approximation of the projected coordinate of each point. To further improve this algorithm, we use pre-pruning and fast update techniques, making it particularly suitable for large networks. Our proposed algorithms have nearly-linear time complexity. We provide extensive experiments on ten real networks to evaluate the quality of our algorithms. The results demonstrate that our proposed algorithms outperform the state-of-the-art methods in terms of efficiency and effectiveness. Moreover, our algorithms are scalable to large graphs with over 5 million nodes and 12 million edges. © 2025 IEEE.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Spatiotemporal deformation analysis of glaciers and surrounding landscapes in the Shishapangma region using InSAR techniques

引用

Journal of Mountain science 2025年第1期22卷 210-229页

作者： LIANG Wenli LIU Rui JI Qin KOU Pinglang Chongqing Key Laboratory of GIS Application School of Geography and TourismChongqing Normal UniversityChongqing 401331China National Earth System Science Data Center Beijing 100000China Chongqing Engineering Research Center of Spatial Big Data Intelligent Technology Chongqing University of Posts and TelecommunicationsChongqing 400065China Key Laboratory of Tourism Multisource Data Perception and Decision Ministry of Culture and Tourism(TMDPDMCT)Chongqing University of Posts and TelecommunicationsChongqing 400065China

Glacier dynamics in the Himalayan midlatitudes,particularly in regions like the Shishapangma,are not yet fully understood,especially the localized topographic and climatic impacts on glacier *** study analyzes the spatiotemporal characteristics of glacier surface deformation in the Shishapangma region using the Small Baseline Subset(SBAS)Interferometric Synthetic Aperture Radar(In SAR)*** analysis reveals an average deformation rate of-4.02±17.65 mm/yr across the entire study area,with glacier regions exhibiting significantly higher rates of uplift(16.87±13.20 mm/yr)and subsidence(20.11±14.55 mm/yr)compared to non-glacier *** identifies significant surface lowering on the mountain flanks and localized uplift in certain catchments,emphasizing the higher deformation rates in glacial areas compared to non-glacial *** found a strong positive correlation between temperature and cumulative deformation(correlation coefficient of 0.63),particularly in glacier areas(0.82).The research highlights the role of temperature as the primary driver of glacier wastage,particularly at lower elevations,with strong correlations found between temperature and cumulative *** also indicates the complex interactions between topographic features,notably,slope gradient,which shows a positive correlation with subsidence rates,especially for slopes below 35°.South-,southwest-,and west-facing slopes exhibit significant uplift,while north-,northeast-,and east-facing slopes predominantly ***,we identified transition zones between debris-covered glaciers and clean ice as areas of most intense deformation,with average rates exceeding 30 mm/yr,highlighting these as potential high-risk zones for *** study comprehensively analyzes the deformation characteristics in both glacier and non-glacier areas in the Shishapangma region,revealing the complex interplay of topographic,climatic,and hydrological factors influencing glacier dynamic

关键词： Glacier melting SBAS-InSAR Topographic factors Temperature change Middle Himalayas

来源：评论

学校读者我要写书评

暂无评论

RRHF-V: Ranking Responses to Mitigate Hallucinations in Multimodal Large Language Models with Human Feedback 31

RRHF-V: Ranking Responses to Mitigate Hallucinations in Mult...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Chen, Guoqing Zhang, Fu Lin, Jinghao Lu, Chenglong Cheng, Jingwei School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Multimodal large language models (MLLMs) demonstrate strong capabilities in multimodal understanding, reasoning, and interaction but still face the fundamental limitation of hallucinations, where they generate erroneous or fabricated information. To mitigate hallucinations, existing methods annotate pair-responses (one non-hallucination vs one hallucination) using manual methods or GPT-4V, and train alignment algorithms to improve the correspondence between images and text. More critically, an image description often involve multiple dimensions (e.g., object attributes, posture, and spatial relationships), making it challenging for the model to comprehensively learn multidimensional information from pair-responses. To this end, in this paper, we propose RRHF-V, which is the first using rank-responses (one non-hallucination vs multiple ranking hallucinations) to mitigate multimodal hallucinations. Instead of using pair-responses to train the model, RRHF-V expands the number of hallucinatory responses, so that the responses with different scores in a rank-response enable the model to learn rich semantic information across various dimensions of the image. Further, we propose a scene graph-based approach to automatically construct rank-responses in a cost-effective and automatic manner. We also design a novel training objective based on rank loss and margin loss to balance the differences between hallucinatory responses within a rank-response, thereby improving the model's image comprehension. Experiments on two MLLMs of different sizes and four widely used benchmarks demonstrate that RRHF-V is effective in mitigating hallucinations and outperforms the DPO method based on pair-responses. © 2025 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Enhancing Adversarial Example Transferability via Regularized Constrained Feature Layer

引用

Computers, Materials & Continua 2025年第4期83卷 157-175页

作者： Xiaoyin Yi Long Chen Jiacheng Huang Ning Yu Qian Huang School of Computer Science and Technology Chongqing University of Posts and TelecommunicationsChongqing400065China Chongqing Key Laboratory of Public Big Data Security Technology Chongqing401420China School of Cyber Security and Information Law Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory of Cyberspace Big Data Intelligent Security Ministry of EducationChongqing400065China Artificial Intelligence and Big Data College Chongqing Polytechnic University of Electronic TechnologyChongqing401331China

Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior *** is achieved by leveraging the property of adversarial *** is,when generated from a surrogate model,they retain their features if applied to other models due to their good ***,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source ***,when attempting black-box transfer attacks on different target models,their effectiveness is *** solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency *** are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial ***,a regularized loss function is used to enhance the black-box transferability between different target *** proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.

关键词： Adversarial examples black-box transferability regularized constrained transfer-based adversarial attacks

来源：评论

学校读者我要写书评

暂无评论

SGMEA: Structure-Guided Multimodal Entity Alignment 31

SGMEA: Structure-Guided Multimodal Entity Alignment

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Cheng, Jingwei Guo, Mingxiao Zhang, Fu School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Multimodal Entity Alignment (MMEA) aims to identify equivalent entities across different multimodal knowledge graphs (MMKGs) by integrating structural information, entity attributes, and visual data, thereby promoting knowledge sharing and deep multimodal data integration. However, existing methods often overlook the deeper connections between multimodal data. They primarily focus on the interactions between neighboring entities in the structural modality while neglecting the interactions between entities in the visual and attribute modalities. To address this, we propose a structure-guided multimodal entity alignment method (SGMEA), which prioritizes structural information from knowledge graphs to enhance the visual and attribute modalities. By fusing multimodal representations, SGMEA improves the accuracy of entity alignment. Experimental results demonstrate that SGMEA achieves state-of-the-art performance across multiple datasets, validating its effectiveness and superiority in practical applications. © 2025 Association for Computational Linguistics.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Re-Cent: A Relation-Centric Framework for Joint Zero-Shot Relation Triplet Extraction 31

Re-Cent: A Relation-Centric Framework for Joint Zero-Shot Re...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Li, Zehan Zhang, Fu Lyu, Kailun Cheng, Jingwei Peng, Tianyue School of Computer Science and Engineering Northeastern University China Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education Northeastern University China

ISBN: (纸本)9798891761964

Zero-shot Relation Triplet Extraction (ZSRTE) aims to extract triplets from the context where the relation patterns are unseen during training. Due to the inherent challenges of the ZSRTE task, existing extractive ZSRTE methods often decompose it into named entity recognition and relation classification, which overlooks the interdependence of two tasks and may introduce error propagation. Motivated by the intuition that crucial entity attributes might be implicit in the relation labels, we propose a Relation-Centric joint ZSRTE method named Re-Cent. This approach uses minimal information, specifically unseen relation labels, to extract triplets in one go through a unified model. We develop two span-based extractors to identify the subjects and objects corresponding to relation labels, forming span-pairs. Additionally, we introduce a relation-based correction mechanism that further refines the triplets by calculating the relevance between span-pairs and relation labels. Experiments demonstrate that Re-Cent achieves state-of-the-art performance with fewer parameters and does not rely on synthetic data or manual labor. © 2025 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A Utility-Adjustable Reverse Auction Mechanism for UAV data Collection Task Allocation 20th

A Utility-Adjustable Reverse Auction Mechanism for UAV Data...

引用

20th IFIP WG 10.3 International Conference on Network and Parallel computing, NPC 2024

作者： Chen, Peng Zhang, Jixian School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9789819628636

Due to their low cost, easy deployment, and high flexibility, unmanned aerial vehicles(UAV) have become widely utilized for various data collection tasks across different fields. In particular, virtual service providers(VSP) recruit UAVs to collect data in their regions of interest(ROI), and leverage this data to offer a range of services, such as metaverse, traffic management, etc. To attract UAV owners to participate in the recruitment activities, VSP need to provide participating users with payments as rewards to motivate their participation. However, the recruitment demands of different VSPs for UAVs can vary significantly. For instance, time-sensitive tasks require timely recruitment of sufficient UAVs to ensure prompt completion of data collection tasks, necessitating higher payments to increase user enthusiasm. Conversely, in other types of tasks, the VSP’s objective might be to maximize its own utility. However, designing a general incentive mechanism for VSPs with different tasks that satisfies incentive compatibility(IC) and individual rationality(IR) to address the issues of UAV task allocation and payment is challenging. If VSP offer insufficient payments to users, it will be difficult to attract enough users to share their UAVs;conversely, offering excessive payments to users will harm the VSP’ profits. To address this problem, we propose a utility-adjustable reverse auction mechanism based on reverse Vickrey-Clarke-Groves(VCG) auction and affine maximizer auction(AMA) theory to cope with different task scenarios. This incentive mechanism can maximize social welfare while flexibly adjusting the utility allocation between VSP and users, ensuring non-negative utility for both parties. Experimental results show that the mechanism has excellent performance. © IFIP International Federation for Information Processing 2025.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：