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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Nighttime traffic object detection via adaptively integrating event and frame domains

引用

Fundamental Research 2024年

作者： Jiang, Yu Wang, Yuehang Zhao, Minghao Zhang, Yongji Qi, Hong The College of Computer Science and Technology Jilin University Changchun 130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun 130012 China The College of Earth Sciences Jilin University Changchun 130012 China

Intelligent perception is crucial in Intelligent Transportation Systems (ITS), with vision cameras as critical components. However, traditional RGB cameras exhibit a significant decline in performance when capturing nighttime traffic scenes, limiting their effectiveness in supporting ITS. In contrast, event cameras possess a high dynamic range (140 dB vs. 60 dB for traditional cameras), enabling them to overcome frame degradation in low-light conditions. Recently, multimodal learning paradigms have made substantial progress in various vision tasks, such as image-text retrieval. Motivated by this progress, we propose an adaptive selection and fusion detection method that leverages both event and RGB frame domains to optimize nighttime traffic object detection jointly. To address the challenge of unbalanced multimodal data fusion, we design a learnable adaptive selection and fusion module. This module performs feature ranking and fusion in the channel dimension, allowing efficient multimodal fusion. Additionally, we construct a novel multi-level feature pyramid network based on multimodal attention fusion. This network extracts potential features to enhance robustness in detecting nighttime traffic objects. Furthermore, we curate a dataset for nighttime traffic scenarios comprising RGB frames and corresponding event streams. Through experiments, we demonstrate that our proposed method outperforms current state-of-the-art techniques in event-based, frame-based, and event and frame fusion methods. This highlights the effectiveness of integrating the event and frame domains in enhancing nighttime traffic object detection. © 2023 The Authors

关键词： Event camera Intelligent transportation Multimodal learning Nighttime object detection

来源：评论

学校读者我要写书评

暂无评论

CCDD: A Tractable Representation for Model Counting and Uniform Sampling

arXiv

引用

arXiv 2022年

作者： Lai, Yong Meel, Kuldeep S. Yap, Roland H.C. Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China School of Computing National University of Singapore Singapore119077 Singapore

knowledge compilation concerns with the compilation of representation languages to target languages supporting a wide range of tractable operations arising from diverse areas of computer science. Tractable target compilation languages are usually achieved by restrictions on the internal nodes (∧ or ∨) of the NNF. In this paper, we propose a new representation language CCDD, which introduces new restrictions on conjunction nodes to capture equivalent literals. We show that CCDD supports two key queries, model counting and uniform samping, in polytime. We present algorithms and a compiler to compile propositional formulas expressed in CNF into CCDD. Experiments over a large set of benchmarks show that our compilation times are better with smaller representations than state-of-art Decision-DNNF, SDD and OBDD[∧] compilers. We apply our techniques to model counting and uniform sampling, and develop model counter and uniform sampler on CNF. Our empirical evaluation demonstrates the following significant improvements: our model counter can solve 885 instances while the prior state of the art solved only 843 instances, representing an improvement of 43 instances;and our uniform sampler can solve 780 instances while the prior state of the art solved only 648 instances, representing an improvement of 132 instances. Copyright © 2022, The Authors. All rights reserved.

关键词： Program compilers

来源：评论

学校读者我要写书评

暂无评论

Tc-Sepm: Characterizing Soft Error Resilience of Cnns on Tensor Cores from Program and Microarchitecture Perspectives

SSRN

引用

SSRN 2023年

作者： Wei, Xiaohui Zhou, Changbao Yue, Hengshan Zhou, Joey Tianyi College of Computer Science and Technology Jilin University Jilin Changchun130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Jilin Changchun130012 China Singapore138632 Singapore Singapore138632 Singapore

As an architectural CNN accelerator integrated into NVIDIA's GPUs, existing research mainly focus on improving the performance of Tensor Core. However, the highly integrated Tensor Cores are vulnerable to transient faults (i.e., soft errors), causing catastrophic consequences in safety-critical applications like automatic driving. Thus, it is imperative to estimate the reliability of CNNs on Tensor Cores. However, it is expensive to obtain a statistically significant resilience profile of CNNs on Tensor Cores with the existing fault injection(FI)-based reliability estimation methods. To this end, we build TC-SEPM to predict the error resilience of CNNs on Tensor Cores instead of FI methods. To ensure the accuracy of TC-SEPM, we first investigate resilience-related features from microarchitecture and program perspectives. Then, leveraging these heuristic features, we train machine learning models to learn the hidden relationship between error resilience and the investigated features, enabling us to predict the impact of soft errors in Tensor Cores on CNN output. Experimental results show that TC-SEPM achieves high accuracy for individual soft error resiliency prediction and overall program resilience estimation while its overhead is only 1/27 of FI methods. Additionally, TC-SEPM can provide valuable insights for programmers or architects to design more robust CNN models on Tensor Cores. © 2023, The Authors. All rights reserved.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

A Novel Local Search Algorithm Based on Connectivity Method and Vertex Penalty Mechanism for Minimum Weighted Connected Dominating Set Problem

SSRN

引用

SSRN 2024年

作者： Li, Ruizhi He, Jintao Yin, Minghao Hu, Shuli Ding, Nan Jilin University of Finance and Economics Changchun130117 China Northeast Normal University Changchun130117 China Business Big Data Research Center of Jilin Province Changchun130117 China Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Jilin University Changchun130012 China

The minimum weighted connected dominating set problem is a classical NP-hard problem with wide applications in practice. In this paper, an efficient local search algorithm is proposed to solve this problem. In this algorithm, firstly, an initial solution construction method based on greedy randomized adaptive strategy is adopted, which can balance the quality and the diversity of the initial solutions. Second, two new scoring functions, Ascore and Cscore, are proposed to increase the diversity of deleted vertices. Third, a new connectivity method is proposed so that the algorithm no longer relies on the shortest path between two connected components. Fourth, a vertex penalty mechanism is introduced, which helps the algorithm to jump out of the local optimum effectively. Fifth, two scoring functions, Ascore and Cscore, are combined with the vertex penalty mechanism to propose an effective vertex selection method, which helps the algorithm to select suitable vertices to be added to or removed from the current candidate solution. Finally, the propsoed local search algorithm is compared with seven state-of-the-art algorithms on three types of benchmark instances. The experimental results show that the algorithm exhibits better performance on these three types of classical benchmark instances. © 2024, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

Independent and Collaborative Demosaicking Neural Networks 5

Independent and Collaborative Demosaicking Neural Networks

引用

5th ACM International Conference on Multimedia in Asia, MMAsia 2023

作者： Niu, Yan Zhang, Lixue Li, Chenlai State Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Jilin University Jilin Changchun China College of Computer Science and Technology Jilin University Changchun China School of Artificial Intelligence Shenzhen Polytechnic University Shenzhen China

ISBN: (纸本)9798400702051

Existing demosaicking neural models generally reconstruct the red, green and blue channels by one unified network. This has the advantage of allowing the RGB channels to share latent features. However, it is unnoticed that the training samples are severely unbalanced among the three channels. As a consequence, a unified model trained to fit the red or blue sample distributions is prone to under-fit the green samples. In this paper, we demonstrate the existence of such conflicts, and analyze the reason behind this phenomenon. To solve this disadvantage, we decouple the traditional three-in-one demosaicking to three independent but collaborative sub-tasks, respecting the distribution of samples in each spectrum. We show that, by our decoupling strategy, a very simple architecture can achieve high accuracy with high efficiency. For substantiation, we construct a model that has merely 1.3M parameters in total, and compares its accuracy to state of the art methods of similar or larger model size, across a wide variety of benchmark datasets. The proposed independent and collaborative architecture gains performance improvement over comparable models in both accuracy and inference time. © 2023 Copyright held by the owner/author(s).

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Traffic jam prediction based on analysis of residents spatial activities

Traffic jam prediction based on analysis of residents spatia...

引用

2020 International Conference on Computer Information and Big Data Applications, CIBDA 2020

作者： Lv, Zhijin Fu, Hao Tang, Wei Chen, Xiaoxu College of Software Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education Changchun130012 China

ISBN: (纸本)9781728198378

The prediction of urban traffic congestion has always been one of the important contents in the research of intelligent transportation systems. The difficulty in predicting urban traffic congestion is that urban traffic operation is essentially a collection of spatial activity planning for residents under certain conditions. The huge group of residents themselves has great complexity and uncertainty. Traditional neural networks mostly focus on road characteristic data and road condition data, and lack of in-depth exploration of the fundamental factors of traffic congestion for residents' travel. So we propose a traffic congestion prediction model based on the analysis of residents' spatial activities. Starting from the residents' activities, the simulation of urban traffic operation conditions can more realistically reflect the traffic congestion situation of the city at specific times and roads, and quickly generate model results. The experimental results show that the model analyzed by residents' spatial activities runs fast and has high prediction accuracy. The results are in line with the actual situation and have strong practical value. © 2020 IEEE.

关键词： Traffic congestion

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Independently keypoint Learning for Small Object Semantic Correspondence

SSRN

引用

SSRN 2024年

作者： Jin, Hailong Li, Huiying Jilin University College of Computer Science and Technology Jilin Province Changchun China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun130012 China

Semantic correspondence remains a challenging task for establishing correspondences between a pair of images with the same category or similar scenes due to the large intra-class appearance. In this paper, we introduce a novel problem called 'Small Object Semantic Correspondence (SOSC).' This problem is challenging due to the close proximity of keypoints associated with small objects, which results in the fusion of these respective features. It is difficult to identify the corresponding key points of the fused features, and it is also difficult to be recognized. To address this challenge, we propose the keypoint Bounding box-centered Cropping (KBC) method, which aims to increase the spatial separation between keypoints of small objects, thereby facilitating independent learning of these keypoints. The KBC method is seamlessly integrated into our proposed inference pipeline and can be easily incorporated into other methodologies, resulting in significant performance enhancements. Additionally, we introduce a novel framework, named KBCNet, which serves as our baseline model. KBCNet comprises a Cross-Scale Feature Alignment (CSFA) module and an efficient 4D convolutional decoder. The CSFA module is designed to align multi-scale features, enriching keypoint representations by integrating fine-grained features and deep semantic features. Meanwhile, the 4D convolutional decoder, based on efficient 4D convolution, ensures efficiency and rapid convergence. To empirically validate the effectiveness of our proposed methodology, extensive experiments are conducted on three widely used benchmarks: PF-PASCAL, PF-WILLOW, and SPair-71k. Our KBC method demonstrates a substantial performance improvement of 7.5\% on the SPair-71K dataset, providing compelling evidence of its efficacy. © 2024, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：