The sparse interactions between users and items have aggravated the difficulty of their representations in recommender systems. Existing methods leverage tags to alleviate the sparsity problem but ignore prevalent log...
详细信息
The rapid development of Internet of Things (IoT) technology has driven the intelligent transformation of various industries, including manufacturing, agriculture, and healthcare, etc., significantly enhancing their m...
详细信息
Diffusion models are initially designed for image generation. Recent research shows that the internal signals within their backbones, named activations, can also serve as dense features for various discriminative task...
Python’s dynamic typing system offers flexibility and expressiveness but can lead to type-related errors, prompting the need for automated type inference to enhance type hinting. While existing learning-based approac...
详细信息
With the rapid development of computers, Internet of Things (IoT) technology is becoming more and more closely integrated with the healthcare sector. This article introduces two major applications of IoT in healthcare...
详细信息
Automated API recommendation technology can help developers quickly find target APIs that meet their require-ments. Some retrieval-based API recommendation approaches, such as BIKER and CLEAR, adopt an indirect API re...
详细信息
ISBN:
(数字)9798331534011
ISBN:
(纸本)9798331534028
Automated API recommendation technology can help developers quickly find target APIs that meet their require-ments. Some retrieval-based API recommendation approaches, such as BIKER and CLEAR, adopt an indirect API recommen-dation strategy. Although these approaches have shown good performance, we observed two limitations in these approaches: (1) These approaches heavily relies on the coverage of the collected question titles proposed by developers; (2) These approaches ignore the API source code information. To overcome the two limitations, we propose an approach named AnsAPIRec (Answer- directed API Recommendation), which leverages a pre-trained model and joint-attention mechanism in this paper. In addition to the fully qualified name of the API, AnsAPIRec extracts the corresponding source code from the JDK as an additional feature. AnsAPIRec adopts a direct API recommendation strategy, which directly calculates the similarity between user queries and API features, i.e., API fully qualified name and API source code, to find the target API, alleviating the reliance on question titles. To further enhance AnsAPIRec's ability to understand the semantics of the inputs, we propose a joint-attention mechanism to learn the interdependent representations between the queries and API features. This deep semantic fusion mechanism enables AnsAPIRec to perform well in understanding user intent and API functionality. We reused the APIBench-Q dataset, containing 5885 queries for training and 653 queries for testing. The experimental result shows that AnsAPIRec achieved an MRR of 0.473, significantly outperforming the baseline approaches, BIKER and CLEAR.
In the real world, due to various challenging lighting conditions such as low light, underexposure, and overexposure, captured images often exhibit undesirable appearances. Given that images with different exposure le...
详细信息
ISBN:
(数字)9781665410205
ISBN:
(纸本)9781665410212
In the real world, due to various challenging lighting conditions such as low light, underexposure, and overexposure, captured images often exhibit undesirable appearances. Given that images with different exposure levels require different correction processes, a single neural network struggles to produce satisfactory results. We propose a coarse-to-fine exposure correction model for learning exposure consistency representation to address underexposure and overexposure issues. Building upon the bilateral activation mechanism, we introduce the Fourier transform to capture global information and fuse it with locally extracted information through convolution to achieve superior feature representation. Additionally, we employ Laplacian pyramids to decompose the source image into different spatial frequency bands, then the image details are enhanced by denoising high-frequency layers. Experimental results on the MSEC and SICE datasets demonstrate the superiority of our proposed method over current state-of-the-art approaches. Our code will be made available on GitHub.
作者:
Bian, YuanLiu, MinWang, XuepingMa, YunfengWang, YaonanHunan University
National Engineering Research Center of Robot Visual Perception and Control Technology College of Electrical and Information Engineering Hunan Changsha China Hunan Normal University
Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Changsha China
Deep learning-based person re-identification (reid) models are widely employed in surveillance systems and inevitably inherit the vulnerability of deep networks to adversarial attacks. Existing attacks merely consider...
详细信息
Due to the widespread application of multi-robot systems, the efficient task assignment for a team of robots has become particularly critical for performing complex tasks. This paper studies the task assignment proble...
详细信息
ISBN:
(数字)9789887581581
ISBN:
(纸本)9798350366907
Due to the widespread application of multi-robot systems, the efficient task assignment for a team of robots has become particularly critical for performing complex tasks. This paper studies the task assignment problem for multiple robots to visit a group of target locations with precedence constraints, which determine the order/sequence in which certain target locations need to be visited before others. A marginal-cost-based heuristic algorithm is developed to minimize the time for the robots to visit the last target location. The algorithm first uses a timestamp strategy to update the anticipated visiting time of each assigned target and the corresponding earliest time that each successor target can be visited under the precedence constraints. Then, it utilizes the topological sorting technique and the marginal-cost-based mechanism to insert the feasible target that induces the minimum marginal cost into the robots' current routes. Numerical simulations demonstrate the effectiveness of the proposed algorithm compared with the popular greedy algorithm and the existing simple iterative auction algorithm.
暂无评论