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

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Zhang, Pei Wang, Dong Wu, Chanyue Yang, Jing Kang, Lei Bai, Zongwen Li, Ying Shen, Qiang School of Computer Science Northwestern Polytechnical University Xi'an China Shaanxi Key Laboratory of Intelligent Processing for Big Energy Data Yan'an University Yan'an China School of Automation and Software Engineering Shanxi University Taiyuan China Qingdao Topscomm Communication Co. Ltd. Qingdao China Department of Computer Science Aberystwyth University Aberystwyth United Kingdom

ISBN: (纸本)9798350368741

Hyperspectral Image (HSI) cross-scene classification is a challenging task in remote sensing, particularly when real-time processing of Target Domain (TD) HSI is required, and data cannot be reused for training. While deep learning methods have shown promising results, the generalization ability of HSI representations remains limited, mainly due to class label imbalance. This paper introduces a dual-stage learning framework based on transfer learning to enhance classification accuracy in the TD. The framework includes a self-supervised learning stage and a supervised fine-tuning stage. The self-supervised stage focuses on learning robust representations by leveraging inherent structures within HSI data, while the fine-tuning stage uses training labels to extract semantic information. A masked diffusion model predicts masked tokens from unmasked ones, capturing both high-level structures and fine details in HSI data. An efficient spatiospectral Transformer, which removes self-attention from the decoder, is proposed to enhance the self-supervised process. This design allows mask tokens to obtain information from visible tokens without interacting with each other, reducing sequence length and computational costs. By decoding each mask token conditionally independently, only a subset of masked tokens is processed. Extensive experiments on two public HSI datasets demonstrate that the proposed method outperforms state-of-the-art techniques. © 2025 IEEE.

关键词： Cross-scene classification Diffusion model Hyperspectral image Transformer

来源：评论

学校读者我要写书评

暂无评论

LoRS: Efficient Low-Rank Adaptation for Sparse Large Language Model

arXiv

引用

arXiv 2025年

作者： Hu, Yuxuan Zhang, Jing Chen, Xiaodong Zhao, Zhe Li, Cuiping Chen, Hong School of Information Renmin University of China Beijing China Key Laboratory of Data Engineering and Knowledge Engineering Beijing China Engineering Research Center of Database and Business Intelligence Beijing China Tencent AI Lab Beijing China

Existing low-rank adaptation (LoRA) methods face challenges on sparse large language models (LLMs) due to the inability to maintain sparsity. Recent works introduced methods that maintain sparsity by augmenting LoRA techniques with additional masking mechanisms. Despite these successes, such approaches suffer from an increased memory and computation overhead, which affects efficiency of LoRA methods. In response to this limitation, we introduce LoRS, an innovative method designed to achieve both memory and computation efficiency when fine-tuning sparse LLMs. To mitigate the substantial memory and computation demands associated with preserving sparsity, our approach incorporates strategies of weight recompute and computational graph rearrangement. In addition, we also improve the effectiveness of LoRS through better adapter initialization. These innovations lead to a notable reduction in memory and computation consumption during the fine-tuning phase, all while achieving performance levels that outperform existing LoRA approaches. © 2025, CC BY.

关键词： Problem oriented languages

来源：评论

学校读者我要写书评

暂无评论

Differential-Trust-Mechanism Based Trade-off Method Between Privacy and Accuracy in Recommender Systems

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5054-5068页

作者： Xu, Guangquan Feng, Shicheng Xi, Hao Yan, Qingyang Li, Wenshan Wang, Cong Wang, Wei Liu, Shaoying Tian, Zhihong Zheng, Xi Qingdao Huanghai University School of Big Data Qingdao China Tianjin University College of Intelligence and Computing Tianjin300350 China KLISS and School of Software Beijing100084 China Sichuan University School of Cyber Science and Engineering Chengdu610207 China Xi’an Jiaotong University School of Cyber Science and Engineering Xi’an710049 China East China Normal University Shanghai200062 China Hiroshima University School of Informatics and Data Science Higashihiroshima739-8511 Japan Guangzhou University Cyberspace Institute of Advanced Technology Guangdong Key Laboratory of Industrial Control System Security Huangpu Research School of Guangzhou University China Macquarie University School of Computing SydneyNSW2109 Australia

In the era where Web3.0 values data security and privacy, adopting groundbreaking methods to enhance privacy in recommender systems is crucial. Recommender systems need to balance privacy and accuracy, while also having the ability to overcome cold start problems. The Differential Trust Mechanism (DTM) introduced in this paper is such an approach. The DTM provides a unique use of Gaussian distributions in modeling trust relationships within data, offering a novel way to balance recommendation accuracy with user privacy. This mechanism innovatively applies differential privacy principles, using Gaussian noise addition to protect individual user data from inference attacks, while maintaining the integrity and utility of the overall dataset. Unlike traditional anonymization techniques that often compromise data utility or vulnerability to reverse engineering, DTM provides a robust solution by dynamically adjusting privacy levels based on the trustworthiness of data requests. By combining DTM with existing mainstream recommendation algorithms, the prediction accuracy of MAE and RMSE increases by at least 6.60% and 2.69%, respectively. This dual benefit positions DTM as a significant advancement in secure data processing, especially relevant for online businesses and platforms where personalized recommendations are crucial yet privacy concerns are paramount. © 2005-2012 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

AMHF-TP:Multifunctional therapeutic peptides prediction based on multi-granularity hierarchical features

引用

Quantitative Biology 2025年第1期13卷 127-141页

作者： Shouheng Tuo YanLing Zhu Jiangkun Lin Jiewei Jiang School of Computer Science and Technology Xi’an University of Posts and TelecommunicationsXi’anChina Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi’anChina Xi’an Key Laboratory of Big Data and Intelligent Computing Xi’anChina School of Electronic Engineering Xi’an University of Posts and TelecommunicationsXi’anChina

Multifunctional therapeutic peptides(MFTP)hold immense potential in diverse therapeutic contexts,yet their prediction and identification remain challenging due to the limitations of traditional methodologies,such as extensive training durations,limited sample sizes,and inadequate generalization *** address these issues,we present AMHF-TP,an advanced method for MFTP recognition that utilizes attention mechanisms and multi-granularity hierarchical features to enhance *** AMHF-TP is composed of four key components:a migration learning module that leverages pretrained models to extract atomic compositional features of MFTP sequences;a convolutional neural network and selfattention module that refine feature extraction from amino acid sequences and their secondary structures;a hypergraph module that constructs a hypergraph for complex similarity representation between MFTP sequences;and a hierarchical feature extraction module that integrates multimodal peptide sequence *** with leading methods,the proposed AMHF-TP demonstrates superior precision,accuracy,and coverage,underscoring its effectiveness and robustness in MFTP *** comparative analysis of separate hierarchical models and the combined model,as well as with five contemporary models,reveals AMHFTP’s exceptional performance and stability in recognition tasks.

关键词： deep learning hypergraph multifunctional therapeutic peptides multi-granularity hierarchical features

来源：评论

学校读者我要写书评

暂无评论

Should Audio Front-ends be Adaptive? Comparing Learnable and Adaptive Front-ends

arXiv

引用

arXiv 2025年

作者： Zhang, Qiquan Wickramasinghe, Buddhi Ambikairajah, Eliathamby Sethu, Vidhyasaharan Li, Haizhou School of Electrical Engineering and Telecommunications The University of New South Wales Sydney2052 Australia School of Electrical and Computer Engineering Purdue University West LafayetteIN United States Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen51872 China

Hand-crafted features, such as Mel-filterbanks, have traditionally been the choice for many audio processing applications. Recently, there has been a growing interest in learnable front-ends that extract representations directly from the raw audio waveform. However, both hand-crafted filterbanks and current learnable front-ends lead to fixed computation graphs at inference time, failing to dynamically adapt to varying acoustic environments, a key feature of human auditory systems. To this end, we explore the question of whether audio front-ends should be adaptive by comparing the Ada-FE front-end (a recently developed adaptive front-end that employs a neural adaptive feedback controller to dynamically adjust the Q-factors of its spectral decomposition filters) to established learnable front-ends. Specifically, we systematically investigate learnable front-ends and Ada-FE across two commonly used back-end backbones and a wide range of audio benchmarks including speech, sound event, and music. The comprehensive results show that our Ada-FE outperforms advanced learnable front-ends, and more importantly, it exhibits impressive stability or robustness on test samples over various training epochs. Copyright © 2025, The Authors. All rights reserved.

关键词： Gabor filters

来源：评论

学校读者我要写书评

暂无评论

A Plug-and-Play Bregman ADMM Module for Inferring Event Branches in Temporal Point Processes

arXiv

引用

arXiv 2025年

作者： Wang, Qingmei Wu, Yuxin Long, Yujie Huang, Jing Ran, Fengyuan Su, Bing Xu, Hongteng Gaoling School of Artificial Intelligence Renmin University of China China School of Cyber Science and Engineering Wuhan University China Beijing Key Laboratory of Big Data Management and Analysis Methods China

An event sequence generated by a temporal point process is often associated with a hidden and structured event branching process that captures the triggering relations between its historical and current events. In this study, we design a new plug-and-play module based on the Bregman ADMM (BADMM) algorithm, which infers event branches associated with event sequences in the maximum likelihood estimation framework of temporal point processes (TPPs). Specifically, we formulate the inference of event branches as an optimization problem for the event transition matrix under sparse and low-rank constraints, which is embedded in existing TPP models or their learning paradigms. We can implement this optimization problem based on subspace clustering and sparse group-lasso, respectively, and solve it using the Bregman ADMM algorithm, whose unrolling leads to the proposed BADMM module. When learning a classic TPP (e.g., Hawkes process) by the expectation-maximization algorithm, the BADMM module helps derive structured responsibility matrices in the E-step. Similarly, the BADMM module helps derive low-rank and sparse attention maps for the neural TPPs with self-attention layers. The structured responsibility matrices and attention maps, which work as learned event transition matrices, indicate event branches, e.g., inferring isolated events and those key events triggering many subsequent events. Experiments on both synthetic and real-world data show that plugging our BADMM module into existing TPP models and learning paradigms can improve model performance and provide us with interpretable structured event branches. The code is available at https://***/qingmeiwangdaily/BADMM *** Codes 60G55, 62M10 Copyright © 2025, The Authors. All rights reserved.

关键词： Maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

arXiv

引用

arXiv 2025年

作者： Li, Yangning Kang, Hui Li, Jiahui Sun, Geng Sun, Zemin Wang, Jiacheng Zhao, Changyuan Niyato, Dusit College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Computing and Data Science Nanyang Technological University 639798 Singapore College of Computing and Data Science Nanyang Technological University Singapore

An expansion of Internet of Things (IoTs) has led to significant challenges in wireless data harvesting, dissemination, and energy management due to the massive volumes of data generated by IoT devices. These challenges are exacerbated by data redundancy arising from spatial and temporal correlations. To address these issues, this paper proposes a novel data-driven collaborative beamforming (CB)-based communication framework for IoT networks. Specifically, the framework integrates CB with an overlap-based multi-hop routing protocol (OMRP) to enhance data transmission efficiency while mitigating energy consumption and addressing hot spot issues in remotely deployed IoT networks. Based on the data aggregation to a specific node by OMRP, we formulate a node selection problem for the CB stage, with the objective of optimizing uplink transmission energy consumption. Given the complexity of the problem, we introduce a softmax-based proximal policy optimization with long-short-term memory (SoftPPO-LSTM) algorithm to intelligently select CB nodes for improving transmission efficiency. Simulation results show that the proposed OMRP improves network lifetime by 17% compared to benchmark routing protocols, while the SoftPPO-LSTM method for CB node selection achieves an 8.3% increase in throughput over benchmark algorithms. The results also reveal that the combined OMRP with the SoftPPO- Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A review on global spatial distribution,sources and toxicity of perfluoroalkyl acid and prospect in the cryosphere

引用

Journal of Mountain Science 2025年第1期22卷 167-183页

作者： LI Bowen Du Wentao KANG Shichang CHEN Jizu JIANG Youyan YIN Lichen LU Changsheng LIU Hongyi State Key Laboratory of Cryospheric Science and frozen soil engineering Northwest Institute of Eco-Environment and ResourcesChinese Academy of Sciences(CAS)Lanzhou 730000China University of Chinese Academy of Sciences Beijing 100049China Gansu Provincial Industry Technology Center of Intelligent Equipment and Big Data for Disaster Prevention Northwest Institute of Eco-Environment and ResourcesChinese Academy of Sciences(CAS)Lanzhou 730000China Lanzhou Regional Climate Center Lanzhou 730000China School of Earth Sciences and Spatial Information Engineering Hunan University of Science and TechnologyXiangtan 411201China School of Energy and Power Engineering Lanzhou University of TechnologyLanzhou 730000China Zhangye Meteorological Service Zhangye 734000China

Perfluoroalkyl acid analogs(PFAAs)are a class of chemically stable environmentally persistent organic pollutants(POPs)that are difficult to degrade and have a strong capacity to accumulate in the human *** have been found to be biotoxic to humans and have been detected in various environmental media,especially in the cryosphere at trace *** cryosphere,sensitively responds to climate change,plays a crucial role in the global water,carbon and energy ***,researches on cryosphere PFAAs especially in Tibetan Plateau(TP)is ***,we summarize the physicochemical properties,physiological toxicity,spatiotemporal distribution,sources,diffusion and migration pathways,as well as analysis and removal methods of PFAAs in the cryosphere *** results show that PFAAs pollutants are mainly produced and distributed in the more economically developed countries in Europe and the United States,as well as in East Asia,and PFAAs can be transported by atmospheric circulation and water cycle to remote regions including cryosphere *** current detection methods for PFAAs in cryosphere need to be further refined for increased accuracy and *** is also a need to develop more effective removal methods that will reduce the environmental and human threats posed by these ***,we propose key scientific questions for future research in cryosphere including PFAAs redistribution influenced by cryosphere changes,human activities,and the interaction of other spheres.

关键词： Perfluoroalkyl acid Cryosphere Physiological toxicity Analytical method Removal method

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Preference Completion with Ranked and Unranked Preferences

引用

Cognitive Computation 2025年第3期17卷 1-21页

作者： Li, Lei Liu, Pan Zhang, Renjie Tao, Zhenchao Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Radiation Oncology The First Affiliated Hospital of USTC Division of Life Sciences and Medicine University of Science and Technology of China Hefei China Department of Radiation Oncology Anhui Provincial Cancer Hospital Hefei China

As for social choice, all alternatives are ranked by agents to form preferences as linear orders. However, in applications, sometimes some alternatives cannot be ranked, or it is unnecessary to rank them, which leads to unranked alternatives. Hence, without loss of generality, by dividing the set of alternatives into three ranked and unranked subsets, including top-k alternatives, intermediate-r alternatives, and last-l alternatives, the Mallows model on ranked and unranked preferences can be analyzed systematically. Technically, a repeated insertion model is adopted during sampling, and probability distributions are derived for ranked and unranked preferences of alternatives. Experimental results verify the accuracy of the probability distributions for different ranked and unranked preferences of alternatives. Furthermore, in order to solve the preference completion problem where agents have multiple partial rankings, a fuzzy preference completion algorithm, Fuzzy-Multi-Rankings, is proposed, which introduces a fuzzy ranking to complete the target agent’s preference in addition to the traditional nearest-neighbor-based methods. Based on the three ranked and unranked preferences, seven cases can be classified and analyzed for fuzzy preference completion. Experiments on the synthetic datasets and MovieLens dataset confirm the effectiveness and efficiency of our proposed Fuzzy-Multi-Rankings algorithm and also verify the accuracy of the evaluated probability distributions for the proposed seven cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Adaptive disentangled target representation for unsupervised domain adaptation in remote sensing segmentation

引用

engineering Applications of Artificial Intelligence 2025年 156卷

作者： Lu, Runuo Dong, Shoubin Jia, Jianxin Wang, Xusheng Liu, Kai Chen, Jinsong Guo, Shanxin Zheng, Xiaorou Guangdong Provincial Key Laboratory of Multimodal Big Data Intelligent Analysis School of Computer Science and Engineering South China University of Technology Guangzhou510641 China Department of Photogrammetry and Remote Sensing Finnish Geospatial Research Institute EspooFI-02150 Finland Center for Geo-Spatial Information Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen518055 China Shenzhen Engineering Laboratory of Ocean Environmental Big Data Analysis and Application Shenzhen518055 China

Due to the significant differences between the source and target domains, semantic segmentation models for remote sensing images trained on the source domain often struggle to generalize effectively to new target domains, leading to performance degradation. Most solutions disentangle features into domain-invariant features shared by both domains and domain-specific features unique to each domain, relying primarily on the domain-invariant features for model construction and inference. However, during this process, critical domain-specific features as essential information are often discarded as noise, leading to a reduction in segmentation accuracy. To address these issues, this study proposes an unsupervised domain adaptation, called ChameleonRS. ChameleonRS separates the domain-invariant features and the domain-specific features by disentanglement learning, and introduces a multi-level feature alignment module to enhance the representation of domain-invariant features. More importantly, it aligns predictions based on domain-invariant features with those based on fused invariant and specific features using contrastive learning, effectively capturing target-specific features. This study explores two cross-domain semantic segmentation tasks: (I) Geographic location variation. (II) Geographic location and imaging mode variation. Results show that under setting (I), ChameleonRS outperforms the state-of-the-art method by 4.79% in Intersection over Union (IoU) and 6.51% in the F1 score. Under setting (II), it achieves improvements of 4.46% and 4.82% in IoU and F1 score. Results demonstrate the superiority and adaptability of ChameleonRS under varying geographical and imaging conditions, effectively mitigating the generalization issues caused by distribution differences, and thereby promoting the development and application of remote sensing technologies in practical scenarios. © 2025 Elsevier Ltd

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：