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

International Conference on data engineering

作者： Kai Zhong Luming Sun Tao Ji Cuiping Li Hong Chen Renmin University of China China MOE Key Laboratory of Data Engineering and Knowledge Engineering China Shanghai Yunxi Technology Co. Ltd. Engineering Research Center of Database and Business Intelligence MOE China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

Various works have utilized deep learning to address the query optimization problem in database system. They either learn to construct plans from scratch in a bottom-up manner or steer the plan generation behavior of traditional optimizer using hints. While these methods have achieved some success, they face challenges in either low training efficiency or limited plan search space. To address these challenges, we introduce FOSS, a novel framework for query optimization based on deep reinforcement learning. FOSS initiates optimization from the original plan generated by a traditional optimizer and incrementally refines suboptimal nodes of the plan through a sequence of actions. Additionally, we devise an asymmetric advantage model to evaluate the advantage between two plans. We integrate it with a traditional optimizer to form a simulated environment. Leveraging this simulated environment, FOSS can bootstrap itself to rapidly generate a large amount of high-quality simulated experiences. FOSS then learns from these experiences to improve its optimization capability. We evaluate the performance of FOSS on Join Order Benchmark, TPC-DS, and Stack Overflow. The experimental results demonstrate that FOSS outperforms the state-of-the-art methods in terms of latency performance. Compared to PostgreSQL, FOSS achieves speedup ranging from 1.15x to 8.33x in total latency across different benchmarks.

关键词： Training Query processing Medical services Benchmark testing Deep reinforcement learning data engineering Distance measurement

来源：评论

学校读者我要写书评

暂无评论

Joint-Motion Mutual Learning for Pose Estimation in Video 24

Joint-Motion Mutual Learning for Pose Estimation in Video

引用

32nd ACM International Conference on Multimedia, MM 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 Singapore Georgia Institute of Technology AtlantaGA 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 of Ministry of Education Jilin University Changchun China Institute of Blockchain and Data Security Hangzhou China

ISBN: (纸本)9798400706868

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 by-product of the backbone generation. Comparatively, methods that attempt to refine the initial heatmap fail to consider any spatio-temporal 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. © 2024 ACM.

关键词： Motion estimation

来源：评论

学校读者我要写书评

暂无评论

Situation Awareness of Mars helicopter based on YOLOv7

Situation Awareness of Mars helicopter based on YOLOv7

引用

2023 International Symposium on Structural Dynamics of Aerospace, ISSDA 2023

作者： Qi, Yifan Xiao, Xueming Yao, Meibao Zhang, Lei Fu, Yuegang CVIR Lab Changchun University of Science and Technology China The Key Lab of Opto-electronic Measurement and Optical Information Transmission Technology Ministry of Education China School of Artificial Intelligence Jilin University Engineering Research Center of Knowledge-Driven Human-Machine Intelligence Ministry of Education China

Situation awareness on Mars is indispensable for various downstream applications such as navigation and path planning, mapping and scientific discover. However, current Mars rover platform suffered from the absence of global information, leading to mission reduction and the failure of global planning. Compared to the rover, Mars helicopter is a new type of attempt for Mars exploration, which can provide a wide range view of scenes to well support the above missions. To this end, in this paper we proposed a novel learning-based situation awareness model for Mars helicopter. We modified the Yolov7 model by embedding a new channel attention on its head to improve the accuracy of detection. Besides, we designed a Tiny-Scale Detection Module (TSDM) to capture small or hidden rocks in complex Martian surface. To achieve further refinement and validate our proposal, we built an open-source synthetic dataset in air view. After extensive experiments, our model achieved excellent outperforms than the baseline model in our Mars dataset. © Published under licence by IOP Publishing Ltd.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

An MRC Framework for Semantic Role labeling 29

An MRC Framework for Semantic Role Labeling

引用

29th International Conference on Computational Linguistics, COLING 2022

作者： Wang, Nan Li, Jiwei Meng, Yuxian Sun, Xiaofei Qiu, Han Wang, Ziyao Wang, Guoyin He, Jun Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China China Shannon.AI Zhejiang University China Tsinghua University China University of Leeds United Kingdom Amazon Alexa AI

Semantic Role labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two sub-tasks: predicate disambiguation and argument labeling. Prior work deals with these two tasks independently, which ignores the semantic connection between the two tasks. In this paper, we propose to use the machine reading comprehension (MRC) framework to bridge this gap. We formalize predicate disambiguation as multiple-choice machine reading comprehension, where the descriptions of candidate senses of a given predicate are used as options to select the correct sense. The chosen predicate sense is then used to determine the semantic roles for that predicate, and these semantic roles are used to construct the query for another MRC model for argument labeling. In this way, we are able to leverage both the predicate semantics and the semantic role semantics for argument labeling. We also propose to select a subset of all the possible semantic roles for computational efficiency. Experiments show that the proposed framework achieves state-of-the-art or comparable results to previous work. Code is available at https://***/ShannonAI/MRC-SRL. © 2022 Proceedings - International Conference on Computational Linguistics, COLING. All rights reserved.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Learning to Communicate Among Agents for Large-Scale Dynamic Path Planning With Genetic Programming Hyperheuristic

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第5期6卷 1269-1283页

作者： Liao, Xiao-Cheng Hu, Xiao-Min Chen, Xiang-Ling Mei, Yi Jia, Ya-Hui Chen, Wei-Neng Victoria University of Wellington Centre for Data Science and Artificial Intelligence School of Engineering and Computer Science Wellington6140 New Zealand Guangdong University of Technology School of Computer Science and Technology Guangzhou510006 China Hanyang University Department of Electrical and Electronic Engineering Ansan15588 Korea Republic of South China University of Technology School of Future Technology Guangzhou510006 China Pazhou Lab Guangzhou510005 China South China University of Technology School of Computer Science and Engineering State Key Laboratory of Subtropical Building and Urban Science Guangzhou510006 China

Genetic programming hyperheuristic (GPHH) has recently become a promising methodology for large-scale dynamic path planning (LDPP) since it can produce reusable heuristics rather than disposable solutions. However, in this methodology, the extracted local and decentralized heuristic for agents that lack a global systemic view sometimes may be problematic. Therefore, a new challenge is to strike a balance between conciseness to improve generalization ability and incorporation of more global information to obtain better performance. In this work, we target the LDPP problem and propose a communication learning mechanism (ComLGP) for GPHH to address the above difficulties. In ComLGP, a communication function is introduced to serve as a communication protocol and exist in the form of an extra terminal in GPHH. Compared to the classic terminals which are fixed in genetic programing, this communication function undergoes optimization along with the evolutionary process of GPHH. In this way, the communication function can be learned which enables agents to communicate without a predefined communication protocol. Then, a caching and lazy updating mechanism for ComLGP is presented to accelerate the calculation of communication content. Last, we verified our method on 22 scenarios including two real world road networks. The experimental results demonstrate that the proposed ComLGP can successfully learn to communicate. Although in the absence of any manually designed communication features, ComLGP is capable of achieving performance competitive to the state-of-the-art method that employs a predefined communication protocol and outperforms the remaining compared methods in most scenarios. © 2020 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

Semantic-Reconstructed Graph Transformer Network for Event Detection

Semantic-Reconstructed Graph Transformer Network for Event D...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Zhuochun Miao Xingrui Zhuo Gongqing Wu Chenyang Bu 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 Anhui China

Event detection (ED) is a key subtask of information extraction to extract key events, such as stock rise and fall and social public opinion, from news or social media. Although current GCN-based event detection methods achieve remarkable success via building graphs with dependency trees, they typically suffer from two challenges: 1) They use sequence models to learn contextual information of sentences, ignoring the longterm dependencies problem of sequence models might learn ineffective information and make it propagate in GCN layers. 2) Most methods do not exploit global dependency label information and grammatical structure information that convey rich linguistic knowledge directly, and only consider local dependency label information. To cope with these challenges, we propose a novel event detection model via semantic-reconstructed graph transformer networks (SRGTNED), which incorporates semantic reconstruction and path information collection methods. Using the semantic reconstruction method, we assign a pruned sequence to each word based on the path information to capture contextual information consistent with sentence semantics. Moreover, to better utilize global dependency label information and grammatical structure information, a Graph Transformer Network (GTN)-based heterogeneous graph embedding framework is introduced to automatically learn path information between important words by converting sentences as heterogeneous graphs. We conduct experiments on the ACE2005 dataset and the Commodity News dataset, and the experimental results demonstrate that our method significantly outperforms 11 state-of-the-art baselines in terms of the F1-score.

关键词：

来源：评论

学校读者我要写书评

暂无评论

InMu-Net: Advancing Multi-modal Intent Detection via Information Bottleneck and Multi-sensory Processing 24

InMu-Net: Advancing Multi-modal Intent Detection via Informa...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Zhihong Cheng, Xuxin Chen, Zhaorun Chen, Yuyan Zhang, Yunyan Wu, Xian Zheng, Yefeng Xing, Bowen Peking University Beijing China The University of Chicago Chicago United States Fudan University Shanghai China Jarvis Research Center Tencent YouTu Lab Shenzhen China Medical Artificial Intelligence Lab Westlake University Hangzhou China Beijing Key Laboratory of Knowledge Engineering for Materials Science School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China

ISBN: (纸本)9798400706868

Multi-modal intent detection (MID) aims to comprehend users' intentions through diverse modalities, which has received widespread attention in dialogue systems. Despite the promising advancements in complex fusion mechanisms or architecture designs, challenges remain due to: (1) various noise and redundancy in both visual and audio modalities and (2) long-tailed distributions of intent categories. In this paper, to tackle the above two issues, we propose InMu-Net, a simple yet effective framework for MID from the Information bottleneck and Multi-sensory processing perspective. Our contributions lie in three aspects. First, we devise a denoising bottleneck module to filter out the intent-irrelevant information in the fused feature;Second, we introduce a saliency preservation loss to prevent the dropping of intent-relevant information;Ultimately, kurtosis regulation is introduced to maintain representation smoothness during the filtering process, mitigating the adverse impact of the long tail distribution. Comprehensive experiments on two MID benchmark datasets demonstrate the effectiveness of InMu-Net and its vital components. Impressively, a series of analyses reveal our denoising potential and robustness in low-resource, modality corruption, cross-architecture and cross-task scenarios. © 2024 ACM.

关键词： Multicarrier modulation

来源：评论

学校读者我要写书评

暂无评论

The Discrete Approximation Problem for a Special Case of Hermite-Type Polynomial Interpolation

引用

Journal of Systems Science & Complexity 2022年第5期35卷 2004-2015页

作者： GONG Yihe JIANG Xue ZHANG Shugong College of Science Northeast Electric Power UniversityJilin 132000China School of Mathematics and Systematic Sciences Shenyang Normal UniversityShenyang 110034China Institute of Mathematics Key Lab.of Symbolic Computation and Knowledge Engineering(Ministry of Education)Jilin UniversityChangchun 130012China

Every univariate Hermite interpolation problem can be written as a pointwise limit of Lagrange ***,this property is not preserved for the multivariate *** this paper,the authors first generalize the result of *** an application,the authors consider the discrete approximation problem for a special case when the interpolation condition contains all partial derivatives of order less than n and one nth order differential *** addition,for the case of n≥3,the authors use the concept of Cartesian tensors to give a sufficient condition to find a sequence of discrete points,such that the Lagrange interpolation problems at these points converge to the given Hermite-type interpolant.

关键词： Discrete approximation problem Hermite interpolation Lagrange interpolation

来源：评论

学校读者我要写书评

暂无评论

Research on access control decision model of Internet of Things based on attribute exploration

Research on access control decision model of Internet of Thi...

引用

2021 International Conference on Signal Processing and Communication Technology, SPCT 2021

作者： Shen, XiaJiong Zhang, Peng Zhang, YanFeng Henan Key Laboratory of Big Data Analysis and Processing Henan Univ. HA Kaifeng475004 China School of Computer and Information Engineering Henan Univ. HA Kaifeng475004 China Institute of Data and Knowledge Engineering Henan Univ. HA Kaifeng475004 China

ISBN: (数字)9781510653344

ISBN: (纸本)9781510653337

With the rapid development of the Internet of things, the problem of access control has become increasingly prominent. In order to solve the problems of high redundancy and low integrity caused by the traditional Role-Based Access Control model, this paper proposes an access control model of Internet of things based on attribute exploration. Firstly, the decision model is established based on attribute exploration algorithm, and finally merged into a complete decision model. The model has the function of dynamically modifying access rights in the process of building decision model. It is a new exploration in the field of access control model. © 2022 SPIE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

Multivariate Time Series Classification via Hierarchical Graph Embedding

Multivariate Time Series Classification via Hierarchical Gra...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Wenhao Niu Xingrui Zhuo Gongqing Wu JunWei Lv Zan Zhang Chenyang Bu 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 Anhui China

Multivariate time series classification aims to determine the labels for multivariate time series samples. Although variable interaction relationships and sample similarity relationships exist in multivariate time series, the available related methods usually ignore the rich relationships and are ineffective in exploiting these. To solve this problem, we propose a Hierarchical Graph Embedding for Multivariate Time Series Classification (MTSC-HGE), which consists of a variable-wise attentive graph pooling module and a sample-wise graph convolutional module to obtain the relationships of variables and samples. Specifically, we design an attentive graph pooling module based on self-attention, which can obtain sample features fusing temporal patterns and variable interaction relationships in samples. Furthermore, we propose a graph mapping criterion that converts the MTS dataset into a graph based on dynamic time warping to explicitly reflect the similarity relationships between samples. To capture latent sample relationships, a GCN module is utilized on the sample graph to integrate sample features obtained from the attentive graph pool module. In addition, a classifier takes the rich representation output by the model to get the final predicted class. Extensive experiments on 14 public datasets show that MTSC-HGE significantly outperforms state-of-the-art baselines.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：