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

Single attribute Join Queries within latest sampling periods in sensor networks

学校读者我要写书评

暂无评论

Single attribute Join Queries within latest sampling periods...

IEEE Symposium on Computers and Communications (ISCC)

作者： Shangfeng Mo Hong Chen Yinglong Li School of Math and Computing Science Hunan University of Science and Technology Xiangtan China Key Laboratory of Data Engineering and Knowledge Engineering of MOE School of Information Renmin University of China Beijing China

Join processing in wireless sensor networks is a challenging problem. Current solutions are not involved in the join operation among tuples of the latest sampling periods. In this article, we proposed a continuous Single attribute Join Queries within latest sampling Periods (SJQP) for wireless sensor networks. The main idea of our filter-based framework is to discard non-matching tuples, and our scheme can guarantee the result is correct independent of the filters. Experiments based on real-world sensor data show that our method performs close to a theoretical optimum and consistently outperforms the centralized join algorithm.

关键词： Base stations Wireless sensor networks Probes Filtering algorithms Temperature sensors Information filters

Idea-map: A Spatiotemporal View of Research Ideas

学校读者我要写书评

暂无评论

Idea-map: A Spatiotemporal View of Research Ideas

2011 Eighth International Conference on Fuzzy System and knowledge Discovery(第八届模糊系统与知识发现国际会议 FSKD 2011)

作者： HeHu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering(Renmin University of China) MOE Beijing 100872 P. R. China School of Information Renmin University of China Beijing 100872 P. R. China

in this paper, we describe idea-map, a mash-up application building on top of Linked data Cloud. It reads in user's keywords (about research ideas) and executes a SPARQL query against DBLP endpoint. Spatial and temporal information is extracted and parsed from the query results and is further transformed to SIMILE/EXHIBIT to show a spatiotemporal map for the research ideas. Idea-map shows the feasibility of combing various techniques such as YQL, SIMILE/Exhibit and SPARQL query answering to provide an insightful interface to better understand the interested research ideas.

关键词： Link data Cloud DBLP Spatiotemoral View YQL

Injecting Numerical Reasoning Skills into knowledge Base Question Answering Models

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Feng, Yu Zhang, Jing Zhang, Xiaokang Liu, Lemao Li, Cuiping Chen, Hong Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education China School of Information Renmin University of China China Tencent AI Lab United States

Embedding-based methods are popular for knowledge Base Question Answering (KBQA), but few current models have numerical reasoning skills and thus struggle to answer ordinal constrained questions. This paper proposes a new embedding-based KBQA framework which particularly takes numerical reasoning into account. We present NumericalTransformer on top of NSM, a state-of-the-art embedding-based KBQA model, to create NT-NSM. To enable better training, we propose two pre-training tasks with explicit numerical-oriented loss functions on two generated training datasets and a template-based data augmentation method for enriching ordinal constrained QA dataset. Extensive experiments on KBQA benchmarks demonstrate that with the help of our training algorithm, NT-NSM is empowered with numerical reasoning skills and substantially outperforms the baselines in answering ordinal constrained questions. Copyright © 2021, The Authors. All rights reserved.

关键词： Embeddings

Pre-training for ad-hoc retrieval: Hyperlink is also you need

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Zhengyi Dou, Zhicheng Xu, Wei Zhang, Xinyu Jiang, Hao Cao, Zhao Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China Beijing China Distributed and Parallel Software Lab Huawei Beijing Key Laboratory of Big Data Management and Analysis Methods Beijing China Key Laboratory of Data Engineering and Knowledge Engineering MOE Beijing China

Designing pre-training objectives that more closely resemble the downstream tasks for pre-trained language models can lead to better performance at the fine-tuning stage, especially in the ad-hoc retrieval area. Existing pre-training approaches tailored for IR tried to incorporate weak supervised signals, such as query-likelihood based sampling, to construct pseudo query-document pairs from the raw textual corpus. However, these signals rely heavily on the sampling method. For example, the query likelihood model may lead to much noise in the constructed pre-training data. In this paper, we propose to leverage the large-scale hyperlinks and anchor texts to pre-train the language model for ad-hoc retrieval. Since the anchor texts are created by webmasters and can usually summarize the target document, it can help to build more accurate and reliable pre-training samples than a specific algorithm. Considering different views of the downstream ad-hoc retrieval, we devise four pre-training tasks based on the hyperlinks. We then pre-train the Transformer model to predict the pair-wise preference, jointly with the Masked Language Model objective. Experimental results on two large-scale ad-hoc retrieval datasets show the significant improvement of our model compared with the existing methods. Copyright © 2021, The Authors. All rights reserved.

关键词： Hypertext systems

USER: A unified information search and recommendation model based on integrated behavior sequence

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Yao, Jing Dou, Zhicheng Xie, Ruobing Lu, Yanxiong Wang, Zhiping Wen, Ji-Rong Gaoling School of Artificial Intelligence Renmin University of China WeChat Search Application Department Tencent China Beijing Key Laboratory of Big Data Management and Analysis Methods Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search and recommendation are the two most common approaches used by people to obtain information. They share the same goal - satisfying the user's information need at the right time. There are already a lot of Internet platforms and Apps providing both search and recommendation services, showing us the demand and opportunity to simultaneously handle both tasks. However, most platforms consider these two tasks independently - they tend to train separate search model and recommendation model, without exploiting the relatedness and dependency between them. In this paper, we argue that jointly modeling these two tasks will benefit both of them and finally improve overall user satisfaction. We investigate the interactions between these two tasks in the specific information content service domain. We propose first integrating the user's behaviors in search and recommendation into a heterogeneous behavior sequence, then utilizing a joint model for handling both tasks based on the unified sequence. More specifically, we design the Unified Information SEarch and Recommendation model (USER), which mines user interests from the integrated sequence and accomplish the two tasks in a unified way. Experiments on a dataset from a real-world information content service platform verify that our model outperforms separate search and recommendation baselines. Copyright © 2021, The Authors. All rights reserved.

关键词： Recommender systems

Second Order Enhanced Multi-glimpse Attention in Visual Question Answering 15th

学校读者我要写书评

暂无评论

Second Order Enhanced Multi-glimpse Attention in Visual Ques...

15th Asian Conference on Computer Vision, ACCV 2020

作者： Sun, Qiang Xie, Binghui Fu, Yanwei Academy for Engineering and Technology Fudan University Shanghai China School of Data Science and MOE Frontiers Center for Brain Science Shanghai Key Lab of Intelligent Information Processing Fudan University Fudan University Shanghai China

ISBN: (纸本)9783030695378

Visual Question Answering (VQA) is formulated as predicting the answer given an image and question pair. A successful VQA model relies on the information from both visual and textual modalities. Previous endeavours of VQA are made on the good attention mechanism, and multi-modal fusion strategies. For example, most models, till date, are proposed to fuse the multi-modal features based on implicit neural network through cross-modal interactions. To better explore and exploit the information of different modalities, the idea of second order interactions of different modalities, which is prevalent in recommendation system, is re-purposed to VQA in efficiently and explicitly modeling the second order interaction on both the visual and textual features, learned in a shared embedding space. To implement this idea, we propose a novel Second Order enhanced Multi-glimpse Attention model (SOMA) where each glimpse denotes an attention map. SOMA adopts multi-glimpse attention to focus on different contents in the image. With projected the multi-glimpse outputs and question feature into a shared embedding space, an explicit second order feature is constructed to model the interaction on both the intra-modality and cross-modality of features. Furthermore, we advocate a semantic deformation method as data augmentation to generate more training examples in Visual Question Answering. Experimental results on VQA v2.0 and VQA-CP v2.0 have demonstrated the effectiveness of our method. Extensive ablation studies are studied to evaluate the components of the proposed model. © 2021, Springer Nature Switzerland AG.

关键词： Embeddings

Feature re-learning with data augmentation for video relevance prediction

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Dong, Jianfeng Wang, Xun Zhang, Leimin Xu, Chaoxi Yang, Gang Li, Xirong College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou310035 China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China AI & Media Computing Lab School of Information Renmin University of China Beijing100872 China

Predicting the relevance between two given videos with respect to their visual content is a key component for content-based video recommendation and retrieval. Thanks to the increasing availability of pre-trained image and video convolutional neural network models, deep visual features are widely used for video content representation. However, as how two videos are relevant is task-dependent, such off-the-shelf features are not always optimal for all tasks. Moreover, due to varied concerns including copyright, privacy and security, one might have access to only pre-computed video features rather than original videos. We propose in this paper feature re-learning for improving video relevance prediction, with no need of revisiting the original video content. In particular, re-learning is realized by projecting a given deep feature into a new space by an affine transformation. We optimize the re-learning process by a novel negative-enhanced triplet ranking loss. In order to generate more training data, we propose a new data augmentation strategy which works directly on frame-level and video-level features. Extensive experiments in the context of the Hulu Content-based Video Relevance Prediction Challenge 2018 justify the effectiveness of the proposed method and its state-of-the-art performance for content-based video relevance prediction. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

QUANTUM LOVÁSZ LOCAL LEMMA: SHEARER’S BOUND IS TIGHT

学校读者我要写书评

暂无评论

arXiv 2018年

作者： He, Kun Li, Qian Sun, Xiaoming Zhang, Jiapeng The Key Lab of Data Engineering and Knowledge Engineering MOE Renmin University of China Beijing China Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Beijing China University of Southern California United States

The Lovász Local Lemma (LLL) is a very powerful tool in combinatorics and probability theory to show the possibility of avoiding all bad events under some weakly dependent conditions. In a seminal paper, Ambainis, Kempe, and Sattath (JACM 2012) introduced a quantum version LLL (QLLL) which shows the possibility of avoiding all "bad" Hamiltonians under some weakly dependent condition, and applied QLLL to the random k-QSAT problem. Sattath, Morampudi, Laumann, and moessner (PNAS 2015) extended Ambainis, Kempe, and Sattath’s result and showed that Shearer’s bound is a sufficient condition for QLLL, and conjectured that Shearer’s bound is indeed the tight condition for QLLL. In this paper, we affirm this conjecture. Precisely, we prove that Shearer’s bound is tight for QLLL, i.e., the relative dimension of the smallest satisfying subspace is completely characterized by the independent set polynomial. Our result implies the tightness of Gilyén and Sattath’s algorithm (FOCS 2017), and also implies that the lattice gas partition function fully characterizes quantum satisfiability for almost all Hamiltonians with large enough qudits (Sattath, Morampudi, Laumann and moessner, PNAS 2015). The commuting LLL (CLLL), which focuses on commuting local Hamiltonians, is also investigated here. We prove that the tight regions of CLLL and QLLL are different in general. This result indicates that it is possible to design an algorithm for CLLL which is still efficient beyond Shearer’s bound. Copyright © 2018, The Authors. All rights reserved.

关键词： Hamiltonians

USED: Universal Speaker Extraction and Diarization

学校读者我要写书评

暂无评论

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 33卷 96-110页

作者： Ao, Junyi Yldrm, Mehmet Sinan Tao, Ruijie Ge, Meng Wang, Shuai Qian, Yanmin Li, Haizhou The Chinese Univ. Of Hong Kong Shenzhen Research Institute Of Big Data School Of Data Science Shenzhen518172 China National University Of Singapore Department Of Electrical And Computer Engineering 119077 Singapore National University Of Singapore Saw Swee Hock School Of Public Health 117549 Singapore Shenzhen Research Institute Of Big Data Shenzhen518172 China Shanghai Jiao Tong University Auditory Cognition And Computational Acoustics Lab Department Of Computer Science And Engineering MoE Key Laboratory Of Artificial Intelligence Ai Institute Shanghai200240 China

Speaker extraction and diarization are two enabling techniques for real-world speech applications. Speaker extraction aims to extract a target speaker's voice from a speech mixture, while speaker diarization demarcates speech segments by speaker, annotating 'who spoke when'. Previous studies have typically treated the two tasks independently. In practical applications, it is more meaningful to have knowledge about 'who spoke what and when', which is captured by the two tasks. The two tasks share a similar objective of disentangling speakers. Speaker extraction operates in the frequency domain, whereas diarization is in the temporal domain. It is logical to believe that speaker activities obtained from speaker diarization can benefit speaker extraction, while the extracted speech offers more accurate speaker activity detection than the speech mixture. In this paper, we propose a unified model called Universal Speaker Extraction and Diarization (USED) to address output inconsistency and scenario mismatch issues. It is designed to manage speech mixtures with varying overlap ratios and variable number of speakers. We show that the USED model significantly outperforms the competitive baselines for speaker extraction and diarization tasks on LibriMix and SparseLibriMix datasets. We further validate the diarization performance on CALLHOME, a dataset based on real recordings, and experimental results indicate that our model surpasses recently proposed approaches. © 2014 IEEE.

关键词： Frequency domain analysis