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

ADAC: Actor-Double-Attention-Critic for Multi-Agent Cooperation in Mixed Cooperative-Competitive Environments

IEEE Transactions on Intelligent Transportation Systems 2025年

作者： Kong, He Xing, Qianli Wang, Qi Niu, Runliang Chen, Hechang Wang, Yu Wang, Shiqi Duan, Zhiyi Chang, Yi Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education School of Artificial Intelligence Jilin Changchun130012 China Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Changchun130010 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineer of Ministry of Education College of Computer Science and Technology Jilin Changchun130012 China Jilin University School of Artificial Intelligence Changchun130012 China Ministry of Education Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Changchun130010 China Jilin University College of Computer Science and Technology Jilin Changchun130012 China Inner Mongolia University Department of Computer Science Hohhot010021 China

The cooperation in mixed cooperative-competitive tasks has drawn significant attention in multi-agent deep reinforcement learning. Agents need to cooperate with their teammates while competing against their opponents. However, most existing works treat the cooperative agents and competitive agents equally as they perform the same operation on all the agents. As a result, without distinguishing between cooperative and competitive agents, they may suffer from information disorder in learning an optimally cooperative policy and struggle to decide on the next step action. To address the above issues, we decompose the final Q-value into a weighted combination of three parts: the Q-values of the cooperative agents, the competitive group, and the current agent. A theoretical proof of the correctness of the decomposition is provided. With this decomposition, we are able to consider cooperative and competitive agents separately. Accordingly, we propose a multi-agent actor-critic algorithm called actor-double-attention-critic (ADAC) under centralized training and decentralized execution according to the decomposition. In ADAC, networks with group-specific attention and an attentional weighting network are specially designed. With the designed double-attention structure, ADAC can capture the distributions from different agents and improve cooperation performance. Extensive experiments are conducted in three scenarios with nine settings against six representative methods. The results demonstrate the superiority of the proposed ADAC model against state-of-the-art methods in various mixed cooperative-competitive tasks. © 2000-2011 IEEE.

关键词： cooperation group-specific attention mixed tasks Multi-agent reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Efficient and Privacy-Preserving Weighted Nearby-Fit Spatial keyword Query in Cloud

引用

IEEE Internet of Things Journal 2025年

作者： Sun, Lili Lu, Rongxing Zheng, Yandong Zhang, Yonggang Tao, Yi Jilin University College of Computer Science and Technology Changchun130012 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China University of New Brunswick Faculty of Computer Science FrederictonNBE3B 5A3 Canada Xidian University State Key Laboratory of Integrated Services Networks Xi'an710071 China Jilin University College of Software Changchun130012 China

In the modern digital landscape, integrating geographic locations and textual descriptions within a geo-textual dataset enhances location-based services (LBS) via spatial keyword queries, as these queries combine spatial and textual information to deliver more precise and personalized results. Additionally, the advent of cloud computing allows data owners to outsource data management and services to the cloud, boosting scalability but introducing efficiency challenges due to complex encryption. Although many schemes have been proposed for spatial keyword queries on encrypted geo-textual data, none supports matching a query keyword set with the keyword sets of multiple objects, a common query type in LBS. Imagine a user seeking to rent a house close to his/her workplace, with easy access to conveniences like supermarkets. By using nearby-fit spatial keyword queries, we can match the desired house with a house-type target object and its nearby amenities, offering more practical and flexible recommendations than traditional spatial keyword queries. Hence, in this paper, we introduce an efficient and privacy-preserving scheme called the Privacy-preserving Weighted Nearby-fit Spatial keyword (PWNSK) query scheme. First, we design a target-oriented spatial keyword (TOSK) tree for data organization and a TOSK tree based WNSK query algorithm for efficient pruning by simultaneously utilizing locations, keywords, and distances from nearby objects to target objects. For privacy, we develop several protocols, including one for polynomial coefficient re-encoding, based on polynomial coefficient encoding and fully homomorphic encryption. Building on these protocols, we introduce our PWNSK scheme. A thorough security analysis confirms its robustness, while extensive experiments also showcase its effectiveness. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Dual Space Representation Learning for Skeleton-based Action Recognition

引用

IEEE Signal Processing Letters 2025年

作者： Yang, Yuheng Chen, Haipeng Liu, Zhenguang Hu, Sihao Jiao, Yingying Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Zhejiang University School of Cyber Science and Technology Hangzhou310007 China Georgia Institute of Technology College of Computing GA United States

Skeleton-based action recognition is crucial for machine intelligence. Current methods generally learn from 3D articulated motion sequences in the straightforward Euclidean space. Yet, the vanilla Euclidean space may not be the optimal choice for modeling the intricate correlations among human body joints. This challenge arises from the non-Euclidean nature of human anatomy, where joint correlations often vary non-linearly during movement. To address this, we propose a dual space representation learning method. Specifically, we represent the motion sequences in Hyperbolic space, leveraging its intrinsic properties to capture the non-Euclidean latent anatomy of human motions. We then incorporate the motion features from both Hyperbolic and Euclidean spaces, allowing us to precisely model the non-linear joint correlations while effectively sketching human poses. The proposed method empirically achieves state-of-the-art performance on the NTU RGB+D 60, NTURGB+D 120, and NW-UCLA datasets. © 1994-2012 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Causal-Inspired Multitask Learning for Video-Based Human Pose Estimation

arXiv

引用

arXiv 2025年

作者： Chen, Haipeng Wu, Sifan Wang, Zhigang Yin, Yifang Jiao, Yingying Lyu, Yingda Liu, Zhenguang 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 A*STAR Singapore Public Computer Education and Research Center Jilin University China The State Key Laboratory of Blockchain and Data Security Zhejiang University China Institute of Blockchain and Data Security China

Video-based human pose estimation has long been a fundamental yet challenging problem in computer vision. Previous studies focus on spatio-temporal modeling through the enhancement of architecture design and optimization strategies. However, they overlook the causal relationships in the joints, leading to models that may be overly tailored and thus estimate poorly to challenging scenes. Therefore, adequate causal reasoning capability, coupled with good interpretability of model, are both indispensable and prerequisite for achieving reliable results. In this paper, we pioneer a causal perspective on pose estimation and introduce a causal-inspired multitask learning framework, consisting of two stages. In the first stage, we try to endow the model with causal spatio-temporal modeling ability by introducing two self-supervision auxiliary tasks. Specifically, these auxiliary tasks enable the network to infer challenging keypoints based on observed keypoint information, thereby imbuing causal reasoning capabilities into the model and making it robust to challenging scenes. In the second stage, we argue that not all feature tokens contribute equally to pose estimation. Prioritizing causal (keypoint-relevant) tokens is crucial to achieve reliable results, which could improve the interpretability of the model. To this end, we propose a Token Causal Importance Selection module to identify the causal tokens and non-causal tokens (e.g., background and objects). Additionally, non-causal tokens could provide potentially beneficial cues but may be redundant. We further introduce a non-causal tokens clustering module to merge the similar non-causal tokens. Extensive experiments show that our method outperforms state-of-the-art methods on three large-scale benchmark datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

A prediction approach based on long short-term memory networks for dynamic multiobjective optimization

引用

Expert Systems with Applications 2025年 283卷

作者： Xu, Biao Rang, Gejie Xie, Ruijie Li, Wenji Gong, Dunwei Fan, Zhun Yang, Shengxiang He, Jie College of Engineering Shantou University Shantou515063 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou543002 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China College of Automation and Electronic Engineering Qingdao University of Science and Technology Qingdao266100 China Shenzhen institute for Advanced Study University of Electronic Science and Technology of China Shenzhen518110 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

Dynamic multiobjective optimization problems (DMOPs) present significant challenges to conventional evolutionary optimization methods because of the continuous changes in their Pareto-optimal sets (PSs) and fronts (PFs). Prediction-driven approaches have demonstrated potential in rapidly adapting to these changes. However, many existing methods depend on linear models to forecast the evolving PSs, which may be restrictive. To counteract this limitation, this research presents a novel dynamic multiobjective evolutionary optimization algorithm that incorporates predictions from long short-term memory (LSTM) networks. Initially, in our methodology, the PS for each problem is segmented into multiple clusters, and the centroid of each cluster is identified. These cluster centroids, representing the PSs across various environmental conditions, are then transformed into a series of time series data. The LSTM network models are subsequently trained on this time series data as input samples. Utilizing these refined models, the centroids of the evolving PSs are predicted with improved precision. Moreover, to enhance the performance of the algorithm, an innovative population-generation strategy is also introduced that guarantees a well-converged and diverse starting population. Our proposed algorithm undergoes rigorous testing using benchmark functions, and the outcomes validate its proficiency in tackling DMOPs, showing superior performance compared to existing state-of-the-art algorithms. © 2025 Elsevier Ltd

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

knowledge Compilation Methods Based on the Clausal Relevance and Extension Rule

引用

Chinese Journal of Electronics 2018年第5期27卷 1037-1042页

作者： NIU Dangdang LIU Lei LYU Shuai College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering (Jilin University) Ministry of Education

We introduce the concepts of Relevancematrix(RM) and Relevance-set(RS). And we construct the association between RM and the knowledge compilation(KC) methods based on Extension rule(ER). Based on the basic parameters of RS and the relationship between RM and the KC methods based on ER, we design two efficient heuristics, called M2S(maximum sum of elements in RS and sum of literals in RS) and MNE(minimum number of maximum terms not extended by RS). Both of above heuristics intend to find the minimum set of maximum terms which cannot be extended by RS. Furthermore,we apply M2S and MNE on KCER. M2S KCER(KCER with M2S) and MNE KCER(KCER with MNE) are designed and implemented based on M2S and MNE, respectively. Experimentally, for the SAT instances with random lengths of clauses, M2S KCER and MNE KCER can improve the efficiency and quality of KCER sharply, and they are two best KC algorithms of EPCCL(each pair contains complementary literal) theory in all KC algorithms based on KCER.

关键词： Extension rule knowledge compilation Clausal relevance Heuristic strategy

来源：评论

学校读者我要写书评

暂无评论

Model-based diagnosis of incomplete discrete-event system with rough set theory

引用

Science China(Information Sciences) 2017年第1期60卷 190-200页

作者： Xuena GENG Dantong OUYANG Yonggang ZHANG Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of EducationJilin University College of Computer Science and Technology Jilin University

Fault diagnosis of discrete-event system(DES) is important in the preventing of harmful events in the system. In an ideal situation, the system to be diagnosed is assumed to be complete; however, this assumption is rather restrictive. In this paper, a novel approach, which uses rough set theory as a knowledge extraction tool to deal with diagnosis problems of an incomplete model, is investigated. DESs are presented as information tables and decision tables. Based on the incomplete model and observations, an algorithm called Optimizing Incomplete Model is proposed in this paper in order to obtain the repaired model. Furthermore, a necessary and sufficient condition for a system to be diagnosable is given. In ensuring the diagnosability of a system, we also propose an algorithm to minimize the observable events and reduce the cost of sensor selection.

关键词： model-based diagnosis diagnosability discrete-event system finite state machine rough set theory

来源：评论

学校读者我要写书评

暂无评论

Complementary knowledge Compilation Using the Hyper Extension Rule

引用

Chinese Journal of Electronics 2019年第2期28卷 259-265页

作者： NIU Dangdang LIU Lei LYU Shuai XU Yue College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University

We introduce the concept of Complementary formula(COMF), which is a new and non-equivalent way for knowledge compilation(KC). Based on the Hyper extension rule(HER) which is an expansion of Extension rule(ER), we design a compilation algorithm which can formula compile each Conjunctive normal form(CNF)formula to complementary Fully complementary connected diagram(c-FCCD), named as C2C(CNF formula to cFCCD). Theoretically, c-FCCD is a kind of complementary formulae of the input formulae and can support all queries and partial transformations in KC map. Experimentally,C2C is competitive with the EPCCL compilers KCER,C2E, UKCHER, DKCHER and IKCHER.

关键词： knowledge compilation Extension rule Hyper extension rule Compilation language Each pair contains complementary literals(EPCCL) theory

来源：评论

学校读者我要写书评

暂无评论

Copy-Paste Detection Based on a SIFT Marked Graph Feature Vector

引用

Chinese Journal of Electronics 2017年第2期26卷 345-350页

作者： LYU Yingda SHEN Xuanjing CHEN Haipeng College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University

To detect copy-paste tampering,an improved SIFT(Scale invariant feature transform)-based algorithm was *** angle is defined and a maximum angle-based marked graph is *** marked graph feature vector is provided to each SIFT key point via discrete polar coordinate *** points are matched to detect the copy-paste tampering *** experimental results show that the proposed algorithm can effectively identify and detect the rotated or scaled copy-paste regions,and in comparison with the methods reported previously,it is resistant to postprocessing,such as blurring,Gaussian white noise and JPEG *** proposed algorithm performs better than the existing algorithm to dealing with scaling transformation.

关键词： Copy-paste tampering Image forensics Marked graph Maximum angle

来源：评论

学校读者我要写书评

暂无评论

Aerial Reliable Collaborative Communications for Terrestrial Mobile Users via Evolutionary Multi-Objective Deep Reinforcement Learning

引用

IEEE Transactions on Mobile Computing 2025年

作者： Sun, Geng Xiao, Jian Li, Jiahui Wang, Jiacheng Kang, Jiawen Niyato, Dusit Mao, Shiwen the College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China the College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore the School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore the School of Automation Guangdong University of Technology Guangzhou510641 China the Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

—Unmanned aerial vehicles (UAVs) have emerged as the potential aerial base stations (BSs) to improve terrestrial communications. However, the limited onboard energy and antenna power of a UAV restrict its communication range and transmission capability. To address these limitations, this work employs collaborative beamforming through a UAV-enabled virtual antenna array to improve transmission performance from the UAV to terrestrial mobile users, under interference from non-associated BSs and dynamic channel conditions. Specifically, we introduce a memory-based random walk model to more accurately depict the mobility patterns of terrestrial mobile users. Following this, we formulate a multi-objective optimization problem (MOP) focused on maximizing the transmission rate while minimizing the flight energy consumption of the UAV swarm. Given the NP-hard nature of the formulated MOP and the highly dynamic environment, we transform this problem into a multi-objective Markov decision process and propose an improved evolutionary multi-objective reinforcement learning algorithm. Specifically, this algorithm introduces an evolutionary learning approach to obtain the approximate Pareto set for the formulated MOP. Moreover, the algorithm incorporates a long short-term memory network and hyper-sphere-based task selection method to discern the movement patterns of terrestrial mobile users and improve the diversity of the obtained Pareto set. Simulation results demonstrate that the proposed method effectively generates a diverse range of non-dominated policies and outperforms existing methods. Additional simulations demonstrate the scalability and robustness of the proposed CB-based method under different system parameters and various unexpected circumstances. © 2025 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：