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

arXiv 2024年

作者： Wu, Sifan Chen, Haipeng Yin, Yifang Hu, Sihao Feng, Runyang Jiao, Yingying Yang, Ziqi Liu, Zhenguang College of Computer Science and Technology Jilin University Changchun China A*STAR Singapore Georgia Institute of Technology Atlanta United States School of Artificial Intelligence Jilin University Changchun China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

Human pose estimation in videos has long been a compelling yet challenging task within the realm of computer vision. Nevertheless, this task remains difficult because of the complex video scenes, such as video defocus and self-occlusion. Recent methods strive to integrate multi-frame visual features generated by a backbone network for pose estimation. However, they often ignore the useful joint information encoded in the initial heatmap, which is a byproduct of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatiotemporal motion features. As a result, the performance of existing methods for pose estimation falls short due to the lack of ability to leverage both local joint (heatmap) information and global motion (feature) dynamics. To address this problem, we propose a novel joint-motion mutual learning framework for pose estimation, which effectively concentrates on both local joint dependency and global pixel-level motion dynamics. Specifically, we introduce a context-aware joint learner that adaptively leverages initial heatmaps and motion flow to retrieve robust local joint feature. Given that local joint feature and global motion flow are complementary, we further propose a progressive joint-motion mutual learning that synergistically exchanges information and interactively learns between joint feature and motion flow to improve the capability of the model. More importantly, to capture more diverse joint and motion cues, we theoretically analyze and propose an information orthogonality objective to avoid learning redundant information from multi-cues. Empirical experiments show our method outperforms prior arts on three challenging benchmarks. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

PBCounter: Weighted Model Counting on Pseudo-Boolean Formulas

arXiv

引用

arXiv 2023年

作者： Lai, Yong Xu, Zhenghang Yin, Minghao College of Computer Science and Technology Jilin University Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computer Science and Information Technology Northeast Normal University Changchun130017 China

In Weighted Model Counting (WMC), we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its literals. The current WMC solvers work on Conjunctive Normal Form (CNF) formulas. However, CNF is not a natural representation for human-being in many applications. Motivated by the stronger expressive power of pseudo-Boolean (PB) formulas than CNF, we propose to perform WMC on PB formulas. Based on a recent dynamic programming algorithm framework called ADDMC for WMC, we implement a weighted PB counting tool PBCounter. We compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD, ExactMC, D4, and ADDMC, where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF formula. The experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas. Copyright © 2023, The Authors. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Task Delay and Energy Consumption Minimization for Low-altitude MEC via Evolutionary Multi-objective Deep Reinforcement Learning

arXiv

引用

arXiv 2025年

作者： Sun, Geng Ma, Weilong Li, Jiahui Sun, Zemin Wang, Jiacheng Niyato, Dusit Mao, Shiwen 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 College of Computing and Data Science Nanyang Technological University Singapore639798 Singapore College of Software Jilin University Changchun130012 China Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

The low-altitude economy (LAE), driven by unmanned aerial vehicles (UAVs) and other aircraft, has revolutionized fields such as transportation, agriculture, and environmental monitoring. In the upcoming six-generation (6G) era, UAV-assisted mobile edge computing (MEC) is particularly crucial in challenging environments such as mountainous or disaster-stricken areas. The computation task offloading problem is one of the key issues in UAV-assisted MEC, primarily addressing the trade-off between minimizing the task delay and the energy consumption of the UAV. In this paper, we consider a UAV-assisted MEC system where the UAV carries the edge servers to facilitate task offloading for ground devices (GDs), and formulate a calculation delay and energy consumption multi-objective optimization problem (CDECMOP) to simultaneously improve the performance and reduce the cost of the system. Then, by modeling the formulated problem as a multi-objective Markov decision process (MOMDP), we propose a multi-objective deep reinforcement learning (DRL) algorithm within an evolutionary framework to dynamically adjust the weights and obtain non-dominated policies. Moreover, to ensure stable convergence and improve performance, we incorporate a target distribution learning (TDL) algorithm. Simulation results demonstrate that the proposed algorithm can better balance multiple optimization objectives and obtain superior non-dominated solutions compared to other methods. Copyright © 2025, The Authors. All rights reserved.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

A Survey on Performance Optimization of High-Level Synthesis Tools

引用

Journal of Computer Science & Technology 2020年第3期35卷 697-720页

作者： Lan Huang Da-Lin Li Kang-Ping Wang Teng Gao Adriano Tavares College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012China Zhuhai Laboratory of Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Zhuhai College of Jilin University Zhuhai 519041China Algorithm Center University of MinhoGuimaraes 4800058Portugal

Field-programmable gate arrays(FPGAs)have recently evolved as a valuable component of the heterogeneous *** register transfer level(RTL)design flows demand the designers to be experienced in hardware,resulting in a possible failure of ***-level synthesis(HLS)permits designers to work at a higher level of abstraction through synthesizing high-level language programs to RTL *** provides a promising approach to solve these ***,the performance of HLS tools still has *** example,designers remain exposed to various aspects of hardware design,development cycles are still time consuming,and the quality of results(QoR)of HLS tools is far behind that of RTL *** this paper,we survey the literature published since 2014 focusing on the performance optimization of HLS *** with previous work,we extend the scope of the performance of HLS tools,and present a set of three-level evaluation criteria,covering from ease of use of the HLS tools to promotion on specific metrics of *** also propose performance evaluation equations for describing the relation between the performance optimization and the *** find that it needs more efforts on the ease of use for efficient HLS *** suggest that it is better to draw an analogy between the HLS development process and the embedded system design process,and to provide more elastic HLS methodology which integrates FPGAs virtual machines.

关键词： evaluation criterion field-programmable gate array(FPGA) high-level synthesis(HLS) performance optimization quality of results(QoR)

来源：评论

学校读者我要写书评

暂无评论

CMRM: Collaborative Multi-agent Reinforcement Learning for Multi-objective Traffic Signal Control

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Nie, Lei Qi, Dandan Liu, Bingyi Li, Peng Bao, Haizhou He, Heng Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430065 China Wuhan University of Technology School of Computer Science and Artificial Intelligence Wuhan430070 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China

Efficient traffic signal control is a cost-effective way to ease urban traffic congestion. Multi-agent reinforcement learning (MARL) has become a widely adopted method for optimizing traffic signal control (TSC). However, existing MARL-based methods often focus on a single optimization objective, lacking a comprehensive consideration of traffic efficiency, environmental pollution, and traffic safety. Simultaneously, these methods often fail to effectively capture the dynamic and complex interactions among agents in multi-intersection scenarios, which negatively impacts traffic efficiency. In this article, we propose a collaborative MARL-based method for multi-objective TSC, called CMRM. First, we introduce a multi-objective reward mechanism that integrates traffic efficiency, environmental impact, and safety to guide agents toward more comprehensive optimization. Second, we design a cooperation enhancement module (CEM) based on the graph attention mechanism to dynamically capture neighboring agents’ state information. This mitigates the partial observability problem in independent proximal policy optimization (IPPO) and enhances the model’s ability to capture dynamic and complex interactions among agents. Finally, we assess the performance of the proposed CMRM method using SUMO on two real traffic networks. Experimental results demonstrate that our method significantly improves traffic efficiency while reducing environmental pollution and enhancing traffic safety, compared to the best performing baseline, our method reduces CO2 emission by approximately 17.53% and 9.57%, and lowers vehicle collision risks by 44.39% and 42.85% in two different traffic networks. © 1975-2011 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

Unknown Task Selection and Worker Recruitment Using Two-Stage Multi-Armed Bandit in Crowdsensing

引用

IEEE Internet of Things Journal 2025年

作者： Song, Haoyuan Li, Peng Du, Rui Yu, Hai Huang, Weiyi Nie, Lei Bao, Haizhou Liu, Qin Wuhan University of Science and Technology School of Computer Science and Technology Wuhan430065 China Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan430065 China Hubei Polytechnic University School of Computer Huangshi435003 China Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Wuhan University School of Cyber Science and Engineering Wuhan430072 China

Mobile Crowdsensing (MCS) faces significant challenges in selecting tasks with expected high revenue and recruiting workers with expected high qualities to maximize overall utility. Existing approaches often assume the revenue of posting tasks or the quality of workers is determined, which limits their practical applicability. This paper tackles these challenges by modeling the long-term multi-task, multi-worker selection problem as a Two-Stage Multi-Armed Bandit (TS-MAB) problem under uncertainty. In each round, the MCS platform selects a long-term task from a pool and recruits the necessary workers, determining payments accordingly. We model the task selection phase as a MAB problem, and the worker recruitment phase, influenced by the task selection, as a Combinatorial MAB (CMAB) problem. We propose an extended Upper Confidence Bound (UCB)-based strategy and develop an incentive mechanism based on Auction theory, combined with TS-MAB (i.e., ATS-MAB), for unknown task selection and worker recruitment. Our mechanism theoretically guarantees truthfulness and individual rationality, with a theoretical analysis of its regret bounds. Furthermore, we introduce an adaptive incentive mechanism called AATS-MAB, which improves worker recruitment and quality updates, achieving higher total sensing quality and lower regret. Extensive simulations demonstrate the effectiveness and scalability of the proposed methods. © 2014 IEEE.

关键词： Personnel selection

来源：评论

学校读者我要写书评

暂无评论

TC-GAT: Graph Attention Network for Temporal Causality Discovery

arXiv

引用

arXiv 2023年

作者： Yuan, Xiaosong Chen, Ke Zuo, Wanli Zhang, Yijia College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering MOE Changchun China *** Inc Beijing China College of Electronic Countermeasures National University of Defense Technology Hefei China

The present study explores the intricacies of causal relationship extraction, a vital component in the pursuit of causality knowledge. Causality is frequently intertwined with temporal elements, as the progression from cause to effect is not instantaneous but rather ensconced in a temporal dimension. Thus, the extraction of temporal causality holds paramount significance in the field. In light of this, we propose a method for extracting causality from the text that integrates both temporal and causal relations, with a particular focus on the time aspect. To this end, we first compile a dataset that encompasses temporal relationships. Subsequently, we present a novel model, TC-GAT, which employs a graph attention mechanism to assign weights to the temporal relationships and leverages a causal knowledge graph to determine the adjacency matrix. Additionally, we implement an equilibrium mechanism to regulate the interplay between temporal and causal relations. Our experiments demonstrate that our proposed method significantly surpasses baseline models in the task of causality extraction. Copyright © 2023, The Authors. All rights reserved.

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Structure- and Logic-Aware Heterogeneous Graph Learning for Recommendation

Structure- and Logic-Aware Heterogeneous Graph Learning for ...

引用

International Conference on Data engineering

作者： Anchen Li Bo Yang Huan Huo Farookh Khadeer Hussain Guandong Xu College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education China Aalto University Espoo Finland School of Computer Science University of Technology Sydney Sydney Australia Education University of Hong Kong Hong Kong China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Recently, there has been a surge in recommendations based on heterogeneous information networks (HINs), attributed to their ability to integrate complex and rich semantics. Despite this advancement, most HIN-based recommenders overlook two critical aspects. First, they often fail to consider HIN's heterophily nature, hindering the capture of non-local structures in HINs. Second, most methods lack the capability for logical reasoning. In this paper, we propose a novel structure- and logic-aware heterogeneous graph learning framework for recommender systems (SLHRec). Our SLHRec contains a structure-aware module and a logic-aware module. The former uses network geometry to construct non-local neighborhoods for nodes in HINs, and then introduces a graph neural network to integrate constructed neighbors for modeling the heterophily of HINs. The logic-aware module uses the Markov logic network (MLN) to infuse logic rules into heterogeneous graph learning, thereby boosting logic reasoning in recommendations. Furthermore, we utilize contrastive learning to model cooperative signals between modules, enabling them to complement each other. In the prediction stage, both modules contribute to generating recommendations. Compared with several strong recommender baselines, our SLHRec achieves superior performance on four real-world datasets.

关键词： Geometry Semantics Contrastive learning Data engineering Boosting Cognition Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Multi-Agent Deep Reinforcement Learning Method for Fully Noisy Observations

SSRN

引用

SSRN 2023年

作者： Wang, Kaiyu Zhang, Menglin Qu, Bohao Wang, Xianchang College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin Changchun130012 China School of Artificial Intelligence Jilin University Jilin Changchun130012 China Chengdu Kestrel Artificial Intelligence Institute Chengdu611730 China

Multi-agent reinforcement learning (MARL) algorithms have achieved great breakthroughs in many aspects. The MARL algorithms can learn effective policies in ideal simulation environments. But different from the ideal simulation environments, noise is unavoidable in the real world. MARL algorithms need to learn effective policies in unavoidable fully noisy environments. In this paper, we consider a challenging multi-agent reinforcement learning problem: All agents cannot observe any noiseless observations from environments during the whole training process and MARL algorithms cannot learn effective policies in these fully noisy observation environments. To solve this problem, we propose a method called Robust Policy Learning under Fully Noisy Observation viA DeNoising REpresentation NeTwork (PLANET), which enables MARL algorithms learning effective policies in fully noisy observation environments. The PLANET method learns the effective policy through two steps. (1) Extracting the noise characteristics and motion laws information from fully noisy observation histories. (2) Making MARL algorithms extract information from the noise characteristics and motion laws information and learn effective policies. The results of a series of exhaustive experiments show that our method can eliminate the effects of noise and learn effective policies in fully noisy observation environments. © 2023, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Bayesian Network Structure Learning and Application

引用

Mobile Information Systems 2022年 2022卷

作者： Zhang, Liwei Liu, Dayou Wang, Zheng Wang, Xinlu College of Computer Science and Technology Jilin University Jilin130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin130012 China Department of Computer Aviation University of Air Force Jilin130022 China Engineering Training Center Changchun Institute of Engineering Jilin130012 China

With the continuous development of artificial intelligence technology and information technology, a large number of background data are constantly generated. How to obtain effective and useful data in a large and complex data group becomes important and meaningful. The traditional Bayesian network can represent the probability distribution of data variables from a large number of data based on graphical models. It has relatively clear and reliable reasoning ability and decision-making mechanism. However, the traditional Bayesian network structure has serious shortcomings in the recognition accuracy of corresponding key data, so the efficiency of the corresponding algorithm is seriously low. Based on this, this study adds an adaptive genetic algorithm with causality to the original Bayesian structure, so as to optimize the strategy of its structure operation, quantitatively describe the order of the corresponding data nodes, creatively arrange the corresponding data nodes in order by using the node priority, and initialize the initial architecture of Bayesian network based on this. Finally, the network is initialized through information exchange and data score correction, so as to get the final learning results. In this study, the convolution neural network algorithm in a database is verified in the experiment. The experimental results show that the accuracy of the experimental results given by the Bayesian network structure proposed in this study is about 10% higher than the traditional accuracy, and its corresponding learning results basically cover the important algorithms, hypotheses, and verification of convolution neural network, from this level;the algorithm proposed in this study has obvious advantages in bibliometrics. © 2022 Liwei Zhang et al.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：