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

Constraining ultralight vector dark matter with the Parkes Pulsar Timing Array second data release

Physical Review D 2022年第8期106卷 L081101-L081101页

作者： Yu-Mei Wu Zu-Cheng Chen Qing-Guo Huang Xingjiang Zhu N. D. Ramesh Bhat Yi Feng George Hobbs Richard N. Manchester Christopher J. Russell R. M. Shannon School of Fundamental Physics and Mathematical Sciences Hangzhou Institute for Advanced Study UCAS Hangzhou 310024 China School of Physical Sciences University of Chinese Academy of Sciences No. 19A Yuquan Road Beijing 100049 China CAS Key Laboratory of Theoretical Physics Institute of Theoretical Physics Chinese Academy of Sciences Beijing 100190 China Department of Astronomy Beijing Normal University Beijing 100875 China Advanced Institute of Natural Sciences Beijing Normal University Zhuhai 519087 China International Centre for Radio Astronomy Research Curtin University Bentley Western Australia 6102 Australia Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou 311100 China Australia Telescope National Facility CSIRO Astronomy and Space Science P.O. Box 76 Epping New South Wales 1710 Australia CSIRO Scientific Computing Australian Technology Park Locked Bag 9013 Alexandria New South Wales 1435 Australia Centre for Astrophysics and Supercomputing Swinburne University of Technology Hawthorn Victoria 3122 Australia Australian Research Council Centre of Excellence in Gravitational Wave Discovery (OzGrav)

Composed of ultralight bosons, fuzzy dark matter provides an intriguing solution to challenges that the standard cold dark matter model encounters on subgalactic scales. The ultralight dark matter with mass m∼10−23 eV will induce a periodic oscillation in gravitational potentials with a frequency in the nanohertz band, leading to observable effects in the arrival times of radio pulses from pulsars. Unlike scalar dark matter, pulsar timing signals induced by the vector dark matter are dependent on the oscillation direction of the vector fields. In this work, we search for ultralight vector dark matter in the mass range of [2×10−24,2×10−22] eV through its gravitational effect in the Parkes Pulsar Timing Array (PPTA) second data release. Since no statistically significant detection is made, we place 95% upper limits on the local dark matter density as ρVF≲5 GeV/cm3 for m≲10−23 eV. As no preferred direction is found for the vector dark matter, these constraints are comparable to those given by the scalar dark matter search with an earlier 12-year dataset of PPTA.

关键词： Dark matter Gravitational waves

来源：评论

学校读者我要写书评

暂无评论

MatchZoo: A Learning, Practicing, and Developing System for Neural Text Matching

arXiv

引用

arXiv 2019年

作者： Guo, Jiafeng Fan, Yixing Ji, Xiang Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Beijing Institute of Technology University Beijing China

Text matching is the core problem in many natural language processing (NLP) tasks, such as information retrieval, question answering, and conversation. Recently, deep leaning technology has been widely adopted for text matching, making neural text matching a new and active research domain. With a large number of neural matching models emerging rapidly, it becomes more and more difficult for researchers, especially those newcomers, to learn and understand these new models. Moreover, it is usually difficult to try these models due to the tedious data pre-processing, complicated parameter configuration, and massive optimization tricks, not to mention the unavailability of public codes sometimes. Finally, for researchers who want to develop new models, it is also not an easy task to implement a neural text matching model from scratch, and to compare with a bunch of existing models. In this paper, therefore, we present a novel system, namely MatchZoo, to facilitate the learning, practicing and designing of neural text matching models. The system consists of a powerful matching library and a user-friendly and interactive studio, which can help researchers: 1) to learn state-of-the-art neural text matching models systematically, 2) to train, test and apply these models with simple configurable steps;and 3) to develop their own models with rich APIs and assistance. Copyright © 2019, The Authors. All rights reserved.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Transferring knowledge distillation for multilingual social event detection

arXiv

引用

arXiv 2021年

作者： Ren, Jiaqian Peng, Hao Jiang, Lei Wu, Jia Tong, Yongxin Wang, Lihong Bai, Xu Wang, Bo Yang, Qiang Institute of Information Engineering Chinese Academy of Sciences The School of Cyber Security University of Chinese Academy of Sciences Beijing100041 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100083 China The School of Cyber Science and Technology Beihang University Beijing100083 China Institute of Information Engineering Chinese Academy of Sciences Beijing100041 China The Department of Computing Macquarie University Sydney Australia The State Key Laboratory of Software Development Environment The School of Computer Science and Engineering Beihang University Beijing100083 China The National Computer Network Emergency Response Technical Team Coordination Center of China Beijing100029 China The Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong AI Group WeBank Co. Ltd. China

Recently published graph neural networks (GNNs) show promising performance at social event detection tasks. However, most studies are oriented toward monolingual data in languages with abundant training samples. This has left the more common multilingual settings and lesser-spoken languages relatively unexplored. Thus, we present a GNN that incorporates cross-lingual word embeddings for detecting events in multilingual data streams. The first exploit is to make the GNN work with multilingual data. For this, we outline a construction strategy that aligns messages in different languages at both the node and semantic levels. Relationships between messages are established by merging entities that are the same but are referred to in different languages. Non-English message representations are converted into English semantic space via the cross-lingual word embeddings. The resulting message graph is then uniformly encoded by a GNN model. In special cases where a lesser-spoken language needs to be detected, a novel cross-lingual knowledge distillation framework, called CLKD, exploits prior knowledge learned from similar threads in English to make up for the paucity of annotated data. Experiments on both synthetic and real-world datasets show the framework to be highly effective at detection in both multilingual data and in languages where training samples are scarce. © 2021, CC BY.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

SetRank: Learning a permutation-invariant ranking model for information retrieval

arXiv

引用

arXiv 2019年

作者： Pang, Liang Xu, Jun Ai, Qingyao Lan, Yanyan Cheng, Xueqi Wen, Jirong CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Renmin University of China Beijing China University of Utah United States

In learning-to-rank for information retrieval, a ranking model is automatically learned from the data and then utilized to rank the sets of retrieved documents. Therefore, an ideal ranking model would be a mapping from a document set to a permutation on the set, and should satisfy two critical requirements: (1) it should have the ability to model cross-document interactions so as to capture local context information in a query;(2) it should be permutation-invariant, which means that any permutation of the inputted documents would not change the output ranking. Previous studies on learning-to-rank either design uni-variate scoring functions that score each document separately, and thus failed to model the cross-document interactions;or construct multivariate scoring functions that score documents sequentially, which inevitably sacrifice the permutation invariance requirement. In this paper, we propose a neural learning-to-rank model called SetRank which directly learns a permutation-invariant ranking model defined on document sets of any size. SetRank employs a stack of (induced) multi-head self attention blocks as its key component for learning the embeddings for all of the retrieved documents jointly. The self-attention mechanism not only helps SetRank to capture the local context information from cross-document interactions, but also to learn permutation-equivariant representations for the inputted documents, which therefore achieving a permutation-invariant ranking model. Experimental results on three large scale benchmarks showed that the SetRank significantly outperformed the baselines include the traditional learning-to-rank models and state-of-the-art Neural IR models. Copyright © 2019, The Authors. All rights reserved.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

Cake cutting on graphs: A discrete and bounded proportional protocol

arXiv

引用

arXiv 2019年

作者： Bei, Xiaohui Sun, Xiaoming Wu, Hao Zhang, Jialin Zhang, Zhijie Zi, Wei School of Physical and Mathematical Sciences Nanyang Technological University CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences

The classical cake cutting problem studies how to find fair allocations of a heterogeneous and divisible resource among multiple agents. Two of the most commonly studied fairness concepts in cake cutting are proportionality and envy-freeness. It is well known that a proportional allocation among n agents can be found efficiently via simple protocols [16]. For envy-freeness, in a recent breakthrough, Aziz and Mackenzie [5] proposed a discrete and bounded envy-free protocol for any number of players. However, the protocol suffers from high multiple-exponential query complexity and it remains open to find simpler and more efficient envy-free protocols. In this paper we consider a variation of the cake cutting problem by assuming an underlying graph over the agents whose edges describe their acquaintance relationships, and agents evaluate their shares relatively to those of their neighbors. An allocation is called locally proportional if each agent thinks she receives at least the average value over her neighbors. Local proportionality generalizes proportionality and is in an interesting middle ground between proportionality and envy-freeness: its existence is guaranteed by that of an envy-free allocation, but no simple protocol is known to produce such a locally proportional allocation for general graphs. Previous works showed locally proportional protocols for special classes of graphs, and it is listed in both [1] and [8] as an open question to design simple locally proportional protocols for more general classes of graphs. In this paper we completely resolved this open question by presenting a discrete and bounded locally proportional protocol for any given graph. Our protocol has a query complexity of only single exponential, which is significantly smaller than the six towers of n query complexity of the envy-free protocol given in [5]. Copyright © 2019, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

MMCGAN: Generative Adversarial network with explicit manifold prior

arXiv

引用

arXiv 2020年

作者： Zheng, Guanhua Sang, Jitao Xu, Changsheng University of Science and Technology of China School of Computer and Information Technology Beijing Key Laboratory of Traffic Data Analysis and Mining Beijing Jiaotong University Beijing100044 China National Lab of Pattern Recognition Institute of Automation CAS University of Chinese Academy of Sciences Beijing100190 China

Generative Adversarial network(GAN) provides a good generative framework to produce realistic samples, but suffers from two recognized issues as mode collapse and unstable training. In this work, we propose to employ explicit manifold learning as prior to alleviate mode collapse and stabilize training of GAN. Since the basic assumption of conventional manifold learning fails in case of sparse and uneven data distribution, we introduce a new target, Minimum Manifold Coding (MMC), for manifold learning to encourage simple and unfolded manifold. In essence, MMC is the general case of the shortest Hamiltonian Path problem and pursues manifold with minimum Riemann volume. Using the standardized code from MMC as prior, GAN is guaranteed to recover a simple and unfolded manifold covering all the training data. Our experiments on both the toy data and real datasets show the effectiveness of MMCGAN in alleviating mode collapse, stabilizing training, and improving the quality of generated samples. Copyright © 2020, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Multi-graph Convolution network with Jump Connection for Event Detection

Multi-graph Convolution Network with Jump Connection for Eve...

引用

International Conference on Tools for Artificial Intelligence (ICTAI)

作者： Xiangbin Meng Pengfei Wang Haoran Yan Liutong Xu Jiafeng Guo Yixing Fan School of Computer Science Beijing University of Posts and Telecommunications Beijing China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

Event detection is an important information extraction task in nature language processing. Recently, the method based on syntactic information and graph convolution network has been wildly used in event detection task and achieved good performance. For event detection, graph convolution network (GCN) based on dependency arcs can capture the sentence syntactic representations and the syntactic information, which is from candidate triggers to arguments. However, existing methods based on GCN with dependency arcs suffer from imbalance and redundant information in graph. To capture important and refined information in graph, we propose Multi-graph Convolution network with Jump Connection (MGJ-ED). The multi-graph convolution network module adds a core subgraph splitted from dependency graph which selects important one-hop neighbors' syntactic information in breadth via GCN. Also the jump connection architecture aggregate GCN layers' representation with different attention score, which learns the importance of neighbors' syntactic information of different hops away in depth. The experimental results on the widely used ACE 2005 dataset shows the superiority of the other state-of-the-art methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Optimizing network resource allocation with graph pointer neural network in large-scale AI systems

引用

Digital Communications and networks 2024年

作者： Peiying Zhang Yilin Li Athanasios V. Vasilakos Konstantin Igorevich Kostromitin Jianyong Zhang Mohsen Guizani Qingdao Institute of Software College of Computer Science and Technology China University of Petroleum (East China) Qingdao 266580 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an 710071 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan 250013 China Department of Networks and Communications College of Computer Science and Information Technology Imam Abdulrahman Bin Faisal University P.O. Box 1982 Dammam 31441 Saudi Arabia Department of Physics of Nanoscale Systems South Ural State University Chelyabinsk 454080 the Russian Federation Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Key Lab of All Optical Network and Advanced Telecommunication of EMC Institute of Lightwave Technology Beijing Jiaotong University Beijing 100044 China Machine Learning Department Mohamed Bin Zayed University of Artificial Intelligence (MBZUAI) Abu Dhabi 999041 United Arab Emirates

For increasingly complex communication demands of large-scale AI communication systems, the Space-Air-Ground Integrated network (SAGIN) better caters to demands but also raises concerns about resource scarcity and diversity. This paper innovatively combines Graph Pointer Neural networks (GPNN) and Reinforcement Learning (RL) to enhance resource allocation efficiency. The method leverages the advantages of GPNN in handling graph data and RL in optimizing decisions in dynamic environments. It also targets the optimization goal of maximizing resource allocation while minimizing deployment latency. This paper begins by modeling SAGIN and elucidating the SAGIN logical architecture based on Software-defined networking (SDN). Subsequently, it introduces an SFC deployment algorithm aimed at joint optimization of resource allocation and latency. The algorithm leverages GPNN and RL to deploy virtual nodes and links, with the goal of optimizing resource allocation and deployment latency. Experiment findings conclusively demonstrate that the efficacy of proposed algorithm in effectively weighing limited heterogeneous resources and minimum mapping delay. Notably, when compared to three other SFC mapping algorithms MLRL, NFVdeep, and RL, the proposed algorithm consistently outperforms them, with an average improvement of 10.17% in long-term average reward/cost, 11.21% in link resource utilization ratio, 15.34% in node resource utilization ratio, and 16.38% in acceptance ratio.

关键词： Space-air-ground integrated network Topological structure Reinforcement learning Service function chain Graph pointer neural network

来源：评论

学校读者我要写书评

暂无评论

Research on unified recognition model and algorithm for multi-modal gestures

引用

The Journal of China Universities of Posts and Telecommunications 2019年第2期26卷 30-42页

作者： Guo Xiaopei Feng Zhiquan Sun Kaiyun Liu Hong Xie Wei Bi Jianping School of Information Science and Engineering University of JinanJinan 250022China Shandong Provincial Key Laboratory of Network-based Intelligent Computing Jinan 250022China School of Information Science and Engineering Shandong Normal UniversityJinan 250014China School of Information and Electrical Engineering Harbin Institute of Technology at WeihaiWeihai 264209China Affiliated Hospital of Shandong University of Traditional Chinese Medicine Jinan 250022China

In gesture recognition,static gestures,dynamic gestures and trajectory gestures are collectively known as multi-modal *** solve the existing problem in different recognition methods for different modal gestures,a unified recognition algorithm is *** angle change data of the finger joints and the movement of the centroid of the hand were acquired respectively by data glove and *** the preprocessing of the multi-source heterogeneous data,all hand gestures were considered as curves while solving hand shaking,and a uniform hand gesture recognition algorithm was established to calculate the Pearson correlation coefficient between hand gestures for gesture *** this way,complex gesture recognition was transformed into the problem of a simple comparison of curves *** main innovations:1) Aiming at solving the problem of multi-modal gesture recognition,an unified recognition model and a new algorithm is proposed;2) The Pearson correlation coefficient for the first time to construct the gesture similarity operator is *** testing 50 kinds of gestures,the experimental results showed that the method presented could cope with intricate gesture interaction with the 97.7% recognition rate.

关键词： Kinect data glove multi-modal gesture gesture interaction

来源：评论

学校读者我要写书评

暂无评论

Deep Learning for Password Guessing and Password Strength Evaluation, A Survey

Deep Learning for Password Guessing and Password Strength Ev...

引用

IEEE International Conference on Trust, Security and Privacy in computing and Communications (TrustCom)

作者： Tao Zhang Zelei Cheng Yi Qin Qiang Li Lin Shi Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin China Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis Guangxi University for Nationalities Nanning China Department of Computer and Information Technology Purdue University West Lafayette USA PLA Information Engineering University Zhengzhou China Henan Key Laboratory of Network Cryptography Technology Zhengzhou China Cloud Computing and Big Data Research Institute China Academy of Information and Communications Technology Beijing China

ISBN: (数字)9781665403924

ISBN: (纸本)9781665403931

Text passwords are the most widely used authentication methods and will also be used in the future. Text passwords can be regarded as meaningful strings, and deep learning methods have an advantage of text processing. LSTM, RNN, GAN and other deep learning models have been using in password guessing and password strength measurements. In the paper, we make a survey on state-of-the-art deep learning methods for password guessing and password strength evaluation, including password pattern extraction, candidate password generation and password strength measurement. Compared with traditional methods, neural networks based methods can achieve better results and performance.

关键词： Deep learning Training Transfer learning Security Gallium nitride Password Text processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：