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

Proceedings of the ACM on Web Conference 2025

作者： Xingrui Zhuo Jiapu Wang Gongqing Wu Shirui Pan Xindong Wu The Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) School of Computer Science and Information Engineering Hefei University of Technology Hefei Anhui China Beijing University of Technology Beijing China Griffith University Gold Coast Queensland Australia

ISBN: (纸本)9798400712746

knowledge Graph Query Embedding (KGQE) aims to embed First-Order Logic (FOL) queries in a low-dimensional KG space for complex reasoning over incomplete KGs. To enhance the generalization of KGQE models, recent studies integrate various external information (such as entity types and relation context) to better capture the logical semantics of FOL queries. The whole process is commonly referred to as Query Pattern Learning (QPL). However, current QPL methods typically suffer from the pattern-entity alignment bias problem, leading to the learned defective query patterns limiting KGQE models' performance. To address this problem, we propose an effective Query Instruction Parsing Plugin (QIPP) that leverages the context awareness of Pre-trained Language Models (PLMs) to capture latent query patterns from code-like query instructions. Unlike the external information introduced by previous QPL methods, we first propose code-like instructions to express FOL queries in an alternative format. This format utilizes textual variables and nested tuples to convey the logical semantics within FOL queries, serving as raw materials for a PLM-based instruction encoder to obtain complete query patterns. Building on this, we design a query-guided instruction decoder to adapt query patterns to KGQE models. To further enhance QIPP's effectiveness across various KGQE models, we propose a query pattern injection mechanism based on compressed optimization boundaries and an adaptive normalization component, allowing KGQE models to utilize query patterns more efficiently. Extensive experiments demonstrate that our plug-and-play method improves the performance of eight basic KGQE models and outperforms two state-of-the-art QPL methods.

关键词： complex query answering

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

HVIS: A Human-like Vision and Inference System for Human Motion Prediction

arXiv

引用

arXiv 2025年

作者： Lyu, Kedi Chen, Haipeng Liu, Zhenguang Yin, Yifang Lin, Yukang Jiao, Yingying College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Institute of Blockchain and Data Security Hangzhou China A*STAR Singapore Tsinghua Shenzhen International Graduate School Nanshan District Shenzhen China

Grasping the intricacies of human motion, which involve perceiving spatio-temporal dependence and multi-scale effects, is essential for predicting human motion. While humans inherently possess the requisite skills to navigate this issue, it proves to be markedly more challenging for machines to emulate. To bridge the gap, we propose the Human-like Vision and Inference System (HVIS) for human motion prediction, which is designed to emulate human observation and forecast future movements. HVIS comprises two components: the human-like vision encode (HVE) module and the human-like motion inference (HMI) module. The HVE module mimics and refines the human visual process, incorporating a retina-analog component that captures spatiotemporal information separately to avoid unnecessary crosstalk. Additionally, a visual cortex-analogy component is designed to hierarchically extract and treat complex motion features, focusing on both global and local features of human poses. The HMI is employed to simulate the multi-stage learning model of the human brain. The spontaneous learning network simulates the neuronal fracture generation process for the adversarial generation of future motions. Subsequently, the deliberate learning network is optimized for hard-to-train joints to prevent misleading learning. Experimental results demonstrate that our method achieves new state-of-the-art performance, significantly outperforming existing methods by 19.8% on Human3.6M, 15.7% on CMU Mocap, and 11.1% on G3D. © 2025, CC BY.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Optimizing Human Pose Estimation Through Focused Human and Joint Regions

arXiv

引用

arXiv 2025年

作者： Jiao, Yingying Wang, Zhigang Liu, Zhenguang Fan, Shaojing Wu, Sifan Wu, Zheqi Xu, Zhuoyue College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Zhejiang Gongshang University China The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China School of Computing National University of Singapore Singapore

Human pose estimation has given rise to a broad spectrum of novel and compelling applications, including action recognition, sports analysis, as well as surveillance. However, accurate video pose estimation remains an open challenge. One aspect that has been overlooked so far is that existing methods learn motion clues from all pixels rather than focusing on the target human body, making them easily misled and disrupted by unimportant information such as background changes or movements of other people. Additionally, while the current Transformer-based pose estimation methods has demonstrated impressive performance with global modeling, they struggle with local context perception and precise positional identification. In this paper, we try to tackle these challenges from three aspects: (1) We propose a bilayer Human-keypoint Mask module that performs coarse-to-fine visual token refinement, which gradually zooms in on the target human body and keypoints while masking out unimportant figure regions. (2) We further introduce a novel deformable cross attention mechanism and a bidirectional separation strategy to adaptively aggregate spatial and temporal motion clues from constrained surrounding contexts. (3) We mathematically formulate the deformable cross attention, constraining that the model focuses solely on the regions centered at the target person body. Empirically, our method achieves state-of-the-art performance on three large-scale benchmark datasets. A remarkable highlight is that our method achieves an 84.8 mean Average Precision (mAP) on the challenging wrist joint, which significantly outperforms the 81.5 mAP achieved by the current state-of-the-art method on the PoseTrack2017 dataset. Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

SpatioTemporal Learning for Human Pose Estimation in Sparsely-Labeled Videos

arXiv

引用

arXiv 2025年

作者： Jiao, Yingying Wang, Zhigang Wu, Sifan Fan, Shaojing Liu, Zhenguang Xu, Zhuoyue Wu, Zheqi College of Computer Science and Technology Jilin University China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University China College of Computer Science and Technology Zhejiang Gongshang University China School of Computing National University of Singapore Singapore The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China

Human pose estimation in videos remains a challenge, largely due to the reliance on extensive manual annotation of large datasets, which is expensive and labor-intensive. Furthermore, existing approaches often struggle to capture long-range temporal dependencies and overlook the complementary relationship between temporal pose heatmaps and visual features. To address these limitations, we introduce STDPose, a novel framework that enhances human pose estimation by learning spatiotemporal dynamics in sparsely-labeled videos. STDPose incorporates two key innovations: 1) A novel Dynamic-Aware Mask to capture long-range motion context, allowing for a nuanced understanding of pose changes. 2) A system for encoding and aggregating spatiotemporal representations and motion dynamics to effectively model spatiotemporal relationships, improving the accuracy and robustness of pose estimation. STDPose establishes a new performance benchmark for both video pose propagation (i.e., propagating pose annotations from labeled frames to unlabeled frames) and pose estimation tasks, across three large-scale evaluation datasets. Additionally, utilizing pseudo-labels generated by pose propagation, STDPose achieves competitive performance with only 26.7% labeled data. Copyright © 2025, The Authors. All rights reserved.

关键词： Large datasets

来源：评论

学校读者我要写书评

暂无评论

Counterfactual Inference for Generalized Zero-shot Compound Fault Diagnosis

引用

IEEE Transactions on Instrumentation and Measurement 2025年 74卷

作者： Xu, Juan Kong, Hui Ding, Xu Yuan, Xiaohui Hefei University of Technology Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer and Information Hefei 230601 China University of North Texas Department of Computer Science and Engineering Denton TX United States

Learning a model heavily depends on the training examples, which are sometimes difficult to obtain if not impossible. This a typically true for fault diagnosis in machinery, particularly for compound faults. The counterfactual inference reveals the causal components inherent in the fault data in an interpretable manner, divulging critical causes from the observable phenomena. This paper proposes a method to address the imbalance and interpretability issues of generalized zero-shot learning methods for compound fault diagnosis using counterfactual inference. Our method uses a structural causal model to decouple and generate fault features, which enhances the capabilities of the Variational Autoencoder and Generative Adversarial Network (VAE-GAN) through a strengthened discriminator, and reveals the intrinsic causal components in fault data, distinguishing key fault causes from accompanying phenomena. This enables the classification of both single and compound faults by learning from examples of single faults easing the dependence on the examples of compound faults. Extensive experimental results show that our method, trained solely with single fault samples, achieves a harmonic average of 87.40% accuracy for both single and compound faults, outperforming existing state-of-the-art methods. This significantly improves both the accuracy and interpretability of compound fault diagnosis. © 1963-2012 IEEE.

关键词： Counterfactual inference Fault diagnosis Generalized zero-shot learning Generative adversarial network Rolling bearing

来源：评论

学校读者我要写书评

暂无评论

AAV Virtual Antenna Array Deployment for Uplink Interference Mitigation in data Collection Networks

引用

IEEE Internet of Things Journal 2025年第8期12卷 10834-10850页

作者： Li, Hongjuan Kang, Hui Sun, Geng Li, Jiahui Wang, Jiacheng Wang, Xue Niyato, Dusit Leung, Victor C. M. Jilin University College of Computer Science and Technology Changchun 130012 China Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun 130012 China Nanyang Technological University College of Computing and Data Science Jurong West Singapore Jilin University Department of Communication Engineering Changchun 130012 China Artificial Intelligence Research Institute Shenzhen MSU-BIT University Shenzhen 518115 China Shenzhen University College of Computer Science and Software Engineering Shenzhen 518060 China The University of British Columbia Department of Electrical and Computer Engineering Vancouver V6T 1Z4 BC Canada

Autonomous aerial vehicles (AAVs) have gained considerable attention as a platform for establishing aerial wireless networks and communications. However, the Line of Sight (LoS) dominance in air-to-ground (A2G) communications often leads to significant interference with terrestrial networks, reducing communication efficiency among terrestrial terminals. This article explores a novel uplink interference mitigation approach based on the collaborative beamforming (CB) method in multi-AAV network systems. Specifically, the AAV swarm forms an AAV-enabled virtual antenna array (VAA) to achieve the transmissions of gathered data to multiple base stations (BSs) for data backup and distributed processing. However, there is a tradeoff tradeoff between the effectiveness of CB-based interference mitigation and the energy conservation of AAVs. Thus, by optimizing the excitation current weights and hover position of AAVs as well as the sequence of data transmission to various BSs, we formulate an uplink interference mitigation multiobjective optimization problem (MOOP) to decrease interference affection, enhance transmission efficiency, and improve energy efficiency, simultaneously. In response to the computational demands of the formulated problem, we introduce an evolutionary computation method, namely chaotic nondominated sorting genetic algorithm II (CNSGA-II) with multiple improved operators. The proposed CNSGA-II efficiently addresses the formulated MOOP, outperforming several other comparative algorithms, as evidenced by the outcomes of the simulations. Moreover, the proposed CB-based uplink interference mitigation approach can significantly reduce the interference caused by AAVs to nonreceiving BSs. © 2014 IEEE.

关键词： autonomous aerial vehicle (AAV) network Collaborative beamforming (CB) evolutionary computation interference mitigation multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Offline Reinforcement Learning via Conservative Smoothing and Dynamics Controlling

Offline Reinforcement Learning via Conservative Smoothing an...

引用

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

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Chinese Academy of Medical Sciences / Peking Union Medical College Institute of Medical Information / Medical Library China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Offline Reinforcement Learning (RL) optimizes policy using pre-collected data instead of direct environment interaction, offering a safe and cost-effective solution for sequential decision-making in the real world. However, it faces challenges such as distribution shift issues and vulnerability under perturbations. Researchers have developed various conservative methods to improve the robustness of offline RL. Nevertheless, model-based methods can result in transition distribution shift issues, while model-free value-based uncertainty penalty methods may not be sufficiently robust. To address these problems, we propose a new method called Robust Offline RL via Conservative Smoothing and Dynamics Controlling (RCSD). To achieve reliable value estimation of out-of-distribution (OOD) actions, RCSD uses both model-free uncertainty penalty and model-based simulation methods. It introduces a new one-step simulation method with conservative dynamics controlling to avoid value overestimation caused by transition distribution shifts. Moreover, RCSD considers both current and next states when generating OOD states to ensure cautious value estimation and efficient data utilization. RCSD uses conservative Q-smoothing and policy smoothing to strengthen the policy against sudden changes under perturbations. Experiments on D4RL benchmark demonstrate that RCSD can achieve state-of-the-art performance compared to baselines in either benchmark or adversarial attack tests.

关键词： Uncertainty Smoothing methods Perturbation methods Estimation Reinforcement learning Benchmark testing Signal processing Robustness Speech processing Faces

来源：评论

学校读者我要写书评

暂无评论

NSPG-Miner: Mining Repetitive Negative Sequential Patterns

arXiv

引用

arXiv 2025年

作者： Li, Yan Wang, Zhulin Liu, Jing Guo, Lei Fournier-Viger, Philippe Wu, Youxi Wu, Xindong School of Economics and Management Hebei University of Technology Tianjin300401 China School of Artificial Intelligence Hebei University of Technology Tianjin300401 China State Key Laboratory of Reliability and Intelligence of Electrical Equipment Hebei University of Technology Tianjin300401 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518061 China Hebei Key Laboratory of Big Data Computing 300401 China Key Laboratory of Knowledge Engineering with Big Data The Ministry of Education of China Hefei University of Technology Hefei230009 China

Sequential pattern mining (SPM) with gap constraints (or repetitive SPM or tandem repeat discovery in bioinformatics) can find frequent repetitive subsequences satisfying gap constraints, which are called positive sequential patterns with gap constraints (PSPGs). However, classical SPM with gap constraints cannot find the frequent missing items in the PSPGs. To tackle this issue, this paper explores negative sequential patterns with gap constraints (NSPGs). We propose an efficient NSPG-Miner algorithm that can mine both frequent PSPGs and NSPGs simultaneously. To effectively reduce candidate patterns, we propose a pattern join strategy with negative patterns which can generate both positive and negative candidate patterns at the same time. To calculate the support (frequency of occurrence) of a pattern in each sequence, we explore a NegPair algorithm that employs a key-value pair array structure to deal with the gap constraints and the negative items simultaneously and can avoid redundant rescanning of the original sequence, thus improving the efficiency of the algorithm. To report the performance of NSPG-Miner, 11 competitive algorithms and 11 datasets are employed. The experimental results not only validate the effectiveness of the strategies adopted by NSPG-Miner, but also verify that NSPG-Miner can discover more valuable information than the state-ofthe-art algorithms. Algorithms and datasets can be downloaded from https://***/wuc567/PatternMining/tree/master/NSPG-Miner. Copyright © 2025, The Authors. All rights reserved.

关键词： Miners

来源：评论

学校读者我要写书评

暂无评论

KAN v.s. MLP for Offline Reinforcement Learning

KAN v.s. MLP for Offline Reinforcement Learning

引用

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

作者： Haihong Guo Fengxin Li Jiao Li Hongyan Liu School of Information Renmin University of China China Institute of Medical Information / Medical Library Chinese Academy of Medical Sciences / Peking Union Medical College China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Economics and Management Tsinghua University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Kolmogorov-Arnold Networks (KAN) is an emerging neural network architecture in machine learning. It has greatly interested the research community about whether KAN can be a promising alternative to the commonly used Multi-Layer Perceptions (MLP). Experiments in various fields demonstrated that KAN-based machine learning can achieve comparable if not better performance than MLP-based methods, but with much smaller parameter scales and are more explainable. In this paper, we explore the incorporation of KAN into the actor and critic networks for offline reinforcement learning (RL). We evaluated the performance, parameter scales, and training efficiency of various KAN and MLP-based conservative Q-learning (CQL) on the classical D4RL benchmark for offline RL. Our study demonstrates that KAN can achieve performance close to the commonly used MLP with significantly fewer parameters. This allows us to choose the base networks according to the offline RL task requirements.

关键词： Training Performance evaluation Hands Q-learning Neural networks Memory management Signal processing Benchmark testing Splines (mathematics) Speech processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：