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

arXiv 2025年

作者： Liu, Guanlin Yu, Xiaomei Liu, Zihao Li, Xue Fan, Xingxu Zheng, Xiangwei School of Information Science and Engineering Shandong Normal University Jinan250358 China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan250358 China State Key Laboratory of High-end Server and Storage Technology Jinan250300 China

Medication Recommendation (MR) is a promising research topic which booms diverse applications in the healthcare and clinical domains. However, existing methods mainly rely on sequential modeling and static graphs for representation learning, which ignore the dynamic correlations in diverse medical events of a patient's temporal visits, leading to insufficient global structural exploration on nodes. Additionally, mitigating drug-drug interactions (DDIs) is another issue determining the utility of the MR systems. To address the challenges mentioned above, this paper proposes a novel MR method with the integration of dynamic networks and multi-view drug representations (DNMDR). Specifically, weighted snapshot sequences for dynamic heterogeneous networks are constructed based on discrete visits in temporal EHRs, and all the dynamic networks are jointly trained to gain both structural correlations in diverse medical events and temporal dependency in historical health conditions, for achieving comprehensive patient representations with both semantic features and structural relationships. Moreover, combining the drug co-occurrences and adverse drug-drug interactions (DDIs) in internal view of drug molecule structure and interactive view of drug pairs, the safe drug representations are available to obtain high-quality medication combination recommendation. Finally, extensive experiments on real world datasets are conducted for performance evaluation, and the experimental results demonstrate that the proposed DNMDR method outperforms the state-of-the-art baseline models with a large margin on various metrics such as PRAUC, Jaccard, DDI rates and so on. Copyright © 2025, The Authors. All rights reserved.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Hadamard Attention Recurrent Transformer: A Strong Baseline for Stereo Matching Transformer

arXiv

引用

arXiv 2025年

作者： Chen, Ziyang Zhang, Yongjun Li, Wenting Wang, Bingshu Wu, Yabo Zhao, Yong Chen, C.L. Philip College of Computer Science The State Key Laboratory of Public Big Data Guizhou University Guiyang550025 China School of Information Engineering Guizhou University of Commerce Guiyang550021 China School of Software Northwestern Polytechnical University Xi’an710129 China Key Laboratory of Integrated Microsystems Shenzhen Graduate School Peking University Shenzhen518055 China School of Computer Science and Engineering South China University of Technology Guangzhou510641 China

In light of the advancements in transformer technology, extant research posits the construction of stereo transformers as a potential solution to the binocular stereo matching challenge. However, constrained by the low-rank bottleneck and quadratic complexity of attention mechanisms, stereo transformers still fail to demonstrate sufficient nonlinear expressiveness within a reasonable inference time. The lack of focus on key homonymous points renders the representations of such methods vulnerable to challenging conditions, including reflections and weak textures. Furthermore, a slow computing speed is not conducive to the application. To overcome these difficulties, we present the Hadamard Attention Recurrent Stereo Transformer (HART) that incorporates the following components: 1) For faster inference, we present a Hadamard product paradigm for the attention mechanism, achieving linear computational complexity. 2) We designed a Dense Attention Kernel (DAK) to amplify the differences between relevant and irrelevant feature responses. This allows HART to focus on important details. DAK also converts zero elements to non-zero elements to mitigate the reduced expressiveness caused by the low-rank bottleneck. 3) To compensate for the spatial and channel interaction missing in the Hadamard product, we propose MKOI to capture both global and local information through the interleaving of large and small kernel convolutions. Experimental results demonstrate the effectiveness of our HART. In reflective area, HART ranked 1st on the KITTI 2012 benchmark among all published methods at the time of submission. Code is available at https://***/ ZYangChen/HART. Copyright © 2025, The Authors. All rights reserved.

关键词： Hadamard transforms

来源：评论

学校读者我要写书评

暂无评论

Correction: CMAE-3D: Contrastive Masked AutoEncoders for Self-Supervised 3D Object Detection(International Journal of computer Vision, 10.1007/s11263-024-02313-2)

引用

International Journal of computer Vision 2025年第6期133卷 3803-3803页

作者： Zhang, Yanan Chen, Jiaxin Huang, Di State Key Laboratory of Complex and Critical Software Environment Beihang University Beijing100191 China School of Computer Science and Engineering Beihang University Beijing100191 China Hangzhou Innovation Institute Beihang University Hangzhou310051 China

The original version of this article unfortunately contained error in co-author’s affiliation. The first affiliation should be state key laboratory of Complex and Critical software Environment, Beihang University, Beijing 100191, China instead of state key laboratory of Complex and Critical software Environment, school of computer Science and engineering, Beihang University, Beijing 100191, China. Also, the author Yanan Zhang is affiliated with school of computer Science and engineering, Beihang University, Beijing 100191, China. The original article has been corrected. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Climate Downscaling Using Neural Operator: Spatiotemporal Multimodal Fusion Operator with state-Query Coupled Kernel

Climate Downscaling Using Neural Operator: Spatiotemporal Mu...

引用

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

作者： Haodi Zhang Yichi Wang Yifan Jian Jiahui Jiang Zhaohai Bai Lin Ma College of Computer Science and Software Engineering Shenzhen University Center for Agricultural Resources Research Institute of Genetic and Developmental Biology Chinese Academy of Sciences State Key Laboratory of Pollution Control and Resource Reuse School of the Environment Nanjing University

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Climate downscaling is crucial for detailed small- scale analysis and for acquiring climate data in regions without weather stations. Operator learning has proven potential for this task. However, several challenges remain in operator learning, such as multimodal fusion, spatiotemporal fusion and input state and query adaptation. To address these challenges, we propose a Spatiotemporal Multimodal Fusion Operator with a state- Query Coupled Kernel (SMCK). This framework includes a latent space fusion encoder that encodes climate variables using position-wise multihead attention for multimodal fusion and integrates historical information to generate robust and precise representation. Additionally, we introduce a state-query coupled kernel that combines radial basis functions and discrete fourier encoding to enhance query location representation, while also adapting to the state to obtain the coupled kernel. Extensive experiments demonstrate that our method achieves state-of-the-art performance and provides strong support for climate downscaling and the planning of climate-related strategies.

关键词： Couplings Signal processing Encoding Robustness Spatiotemporal phenomena Planning Kernel Speech processing Forecasting Meteorology

来源：评论

学校读者我要写书评

暂无评论

Biomimetic Multi-UAV Swarm Exploration with U2U Communications Under Resource Constraints

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Huang, Yuanhao Wang, Hao Bai, Xuesong Cai, Xuan Yu, Haiyang Ren, Yilong Beihang University School of Transportation Science and Engineering Beijing100191 China State Key Lab of Intelligent Transportation System Beijing100191 China Dalian University of Technology School of Computer Science and Technology Dalian China Zhongguancun Laboratory Beijing100094 China

Existing multi-agent algorithms struggle with spatial coordination and require extensive prior environmental information for effective large-scale operation. This study introduces an innovative multi-UAV system that employs an evolutionary algorithm, reconceptualizing collaborative search tasks as a multi-objective cooperative challenge. Inspired by bacteria's stochastic exploration for pheromones, the algorithm utilizes pheromone concentration and gradient effects to enhance multi-source exploration's efficiency and robustness. A bespoke multi-UAV framework with UAV-to-UAV (U2U) communication was developed to implement and test the algorithm. Comprehensive experiments tested various chemotaxis strategies, guidance strengths, team sizes, and starting conditions, demonstrating the algorithm's consistent effectiveness in expansive terrains without relying on prior information. © 1967-2012 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A multip-level additive distortion method for security improvement in palette image steganography

引用

Journal of Visual Communication and Image Representation 2025年 110卷

作者： Chen, Yi Wang, Hongxia Cui, Yunhe Shen, Guowei Guo, Chun Liu, Yong Wu, Hanzhou State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China Guizhou Provincial Characteristic Key Laboratory of Software Engineering and Information Security Guizhou University Guiyang550025 China School of Cyber Science and Engineering Sichuan University Chengdu610065 China School of Artificial Intelligence Hubei University of Automotive Technology Shiyan442002 China School of Big Data and Computer Science Guizhou Normal University Guiyang550025 China School of Communication and Information Engineering Shanghai University Shanghai200444 China

With the rapid development of the Internet and communication technology, palette images have become a preferred media for steganography. However, the security of palette image steganography faces a big problem. To address this, we propose a multiple-level additive distortion method for security improvement in palette image steganography. The proposed multiple-level additive distortion method comprises an index-level cost method and a pixel-level cost method. The index-level and the pixel-level costs by the two methods can respectively reflect the relationship changes of adjacent indices and the pixels corresponding to the adjacent indices. Meanwhile, the index-level and the pixel-level costs can also reflect the modification impact of steganography. Therefore, the proposed method can improve the security of palette image steganography. We conducted extensive experiments on three datasets to verify the security improvement. Experiment results have shown our proposed multiple-level distortion method indeed has an advantage in security when compared with four state-of-the-art methods. © 2025 Elsevier Inc.

关键词： Additive costs Color table Index matrix Multiple-level distortions Palette images Security Steganography

来源：评论

学校读者我要写书评

暂无评论

StructVizor: Interactive Profiling of Semi-Structured Textual Data 25

StructVizor: Interactive Profiling of Semi-Structured Textua...

引用

Proceedings of the 2025 CHI Conference on Human Factors in Computing Systems

作者： Yanwei Huang Yan Miao Di Weng Adam Perer Yingcai Wu State Key Lab of CAD&CG Zhejiang University Hangzhou Zhejiang China School of Software Technology Zhejiang University Ningbo Zhejiang China Human-Computer Interaction Institute Carnegie Mellon University Pittsburgh Pennsylvania USA

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Feature Enrichment and Fidelity Preservation Learning Framework for Skeleton-based Action Recognition

引用

IEEE Transactions on Circuits and Systems for Video Technology 2025年

作者： Li, Chuankun Li, Shuai Gao, Yanbo Gao, Xingyu Chen, Ping Li, Jian Li, Wanqing North University of China State Key Laboratory of Dynamic Testing Technology School of Information and Communication Engineering Taiyuan030051 China Shandong University School of Control Science and Engineering School of Software Jinan250100 China Chinese Academy of Sciences Institute of Microelectronics Beijing100029 China University of Wollongong Advanced Multimedia Research Lab WollongongNSW2522 Australia

Unsupervised skeleton-based action recognition has achieved remarkable progress recently. Existing unsupervised learning methods suffer from severe overfitting problem, and thus small networks are used, significantly reducing the representation capability. To address this problem, the overfitting mechanism behind the unsupervised learning for skeleton-based action recognition is first investigated. It is observed that skeleton is already a relatively high-level and low-dimension feature, but not in the same manifold as the features for action recognition. Simply applying the existing unsupervised learning method tends to produce features that discriminate the different samples rather than action classes, resulting in the overfitting problem. To address this problem, this paper proposes an Unsupervised spatial-temporal Feature Enrichment and Fidelity Preservation (U-FEFP) learning framework to generate rich distributed features that contain all the information of a skeleton sample. A spatial-temporal feature transformation subnetwork is developed using channel-wise topology refinement graph convolutional block and graph convolutional gated recurrent unit block as the basic feature extraction network. The unsupervised Bootstrap Your Own Latent-based learning is utilized to generate rich distributed features, and the unsupervised pretext task-based learning is employed to preserve the information contained in the skeleton. The two unsupervised learning ways are collaborated as U-FEFP to produce robust and discriminative representations. Experimental results on four widely used benchmarks, namely NTU-RGB+D-60, PKU-MMD, NTU-RGB+D-120 and UAV-Human dataset, demonstrate that the proposed U-FEFP obtains the best result compared with the state-of-the-art unsupervised learning methods. © 1991-2012 IEEE.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Corporate Fraud Detection in Rich-yet-Noisy Financial Graph

arXiv

引用

arXiv 2025年

作者： Wang, Shiqi Zhang, Zhibo Fang, Libing Nguyen, Cam-Tu Li, Wenzhon School of Artificial Intelligence Nanjing University Jiangsu Nanjing China School of Computer Science and Technology Nanjing University Jiangsu Nanjing China School of Management and Engineering Nanjing University Jiangsu Nanjing China State Key Laboratory for Novel Software Technology Nanjing University Jiangsu Nanjing China

Corporate fraud detection aims to automatically recognize companies that conduct wrongful activities such as fraudulent financial statements or illegal insider trading. Previous learning-based methods fail to effectively integrate rich interactions in the company network. To close this gap, we collect 18-year financial records in China to form three graph datasets with fraud labels. We analyze the characteristics of the financial graphs, highlighting two pronounced issues: (1) information overload: the dominance of (noisy) non-company nodes over company nodes hinders the message-passing process in Graph Convolution Networks (GCN);and (2) hidden fraud: there exists a large percentage of possible undetected violations in the collected data. The hidden fraud problem will introduce noisy labels in the training dataset and compromise fraud detection results. To handle such challenges, we propose a novel graph-based method, namely, Knowledge-enhanced GCN with Robust Two-stage Learning (KeGCNR), which leverages Knowledge Graph Embeddings to mitigate the information overload and effectively learns rich representations. The proposed model adopts a two-stage learning method to enhance robustness against hidden frauds. Extensive experimental results not only confirm the importance of interactions but also show the superiority of KeGCNR over a number of strong baselines in terms of fraud detection effectiveness and robustness. Copyright © 2025, The Authors. All rights reserved.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Exploring Communication-efficient Federated Learning via stateless In-network Aggregation

引用

IEEE Transactions on Mobile Computing 2025年

作者： Xia, Junxu Cheng, Geyao Wu, Wenfei Luo, Lailong Guo, Deke National University of Defense Technology National Key Laboratory of Information Systems Engineering Changsha Hunan410073 China National University of Defense Technology State Key Laboratory of Complex & Critical Software Environment College of Information and Communication Changsha Hunan410073 China Peking University School of Computer Science Beijing100091 China

As an ambitious training paradigm, federated learning has garnered increasing attention in recent years, which enables collaborative training of a global model without accessing users' private data. However, due to the simultaneous and constant model updates gathering from massive distributed clients, the central server generally becomes a performance bottleneck. Additionally, the stateful aggregation (retaining all the updates from each client) conducted by the central server further poses potential threats to privacy, since it may recover the raw data based on such model updates inversely. The state-of-the-art methodologies, however, fail to address these two problems concurrently and efficiently. To this end, we propose GAIN, a secure aggregation acceleration service for federated learning. At its core, GAIN leverages programmable switches deployed at the edge network to aggregate model updates in a stateless manner before transmitting them to the central server. Consequently, GAIN can accelerate the transmission and aggregation of model updates while eliminating the chance of recovering private data. We evaluate the performance of GAIN through FPGA-based experiments and large-scale simulations. The results show that GAIN can effectively reduce bandwidth overhead and achieve up to 4.11× training throughput acceleration while prioritizing privacy protection. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：