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

arXiv 2022年

作者： Su, Tong Li, Yueyan Wang, Qianqian Zhao, Weiwei Cao, Liemao Ang, Yee Sin Sauvage Laboratory for Smart Materials School of Materials Science and Engineering Harbin Institute of Technology Shenzhen518055 China Shenzhen Key Laboratory of Flexible Printed Electronics Technology Harbin Institute of Technology Shenzhen518055 China Science Mathematics and Technology Singapore University of Technology and Design Singapore487372 Singapore School of Information Management Nanjing University Nanjing210023 China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing210023 China College of Physics and Electronic Engineering Hengyang Normal University Hengyang421002 China

Recent experiment has uncovered semimetal bismuth (Bi) as an excellent electrical contact to monolayer MoS2 with ultralow contact resistance. The contact physics of the broader semimetal/monolayer-semiconductor family beyond Bi/MoS2, however, remains largely unexplored thus far. Here we perform a comprehensive first-principle density functional theory investigation on the electrical contact properties between six archetypal two-dimensional (2D) transition metal dichalcogenide (TMDC) semiconductors, i.e. MoS2, WS2, MoSe2, WSe2, MoTe2 and WTe2, and two representative types of semimetals, Bi and antimony (Sb). As Bi and Sb work functions energetically aligns well with the TMDC conduction band edge, Ohmic or nearly-Ohmic n-type contacts are prevalent. The interlayer distance of semimetal/TMDC contacts are significantly larger than that of the metal/TMDC counterparts, which results in only weak metalization of TMDC upon contact formation. Intriguingly, such weak metalization generates semimetal-induced gap states (MIGS) that extends below the conduction band minimum, thus offering an effective mechanism to reduce or eliminate the n-type Schottky barrier height (SBH) while still preserving the electronic structures of 2D TMDC. A modified Schottky-Mott rule that takes into account SMIGS, interface dipole potential, and Fermi level shifting is proposed, which provides an improved agreement with the DFT-simulated SBH. We further show that the tunneling-specific resistivity of Sb/TMDC contacts are generally lower than the Bi counterparts, thus indicating a better charge injection efficiency can be achieved through Sb contacts. Our findings reveal the promising potential of Bi and Sb as excellent companion electrode materials for advancing 2D semiconductor device technology. Copyright © 2022, The Authors. All rights reserved.

关键词： Molybdenum compounds

来源：评论

学校读者我要写书评

暂无评论

An MRC Framework for Semantic Role Labeling

arXiv

引用

arXiv 2021年

作者： 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 China Zhejiang University China Tsinghua University China University of Leeds United Kingdom Amazon Alexa AI United States

Semantic Role Labeling (SRL) aims at recognizing the predicate-argument structure of a sentence and can be decomposed into two subtasks: 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. © 2021, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Social Group Query Based on Multi-fuzzy-constrained Strong Simulation

arXiv

引用

arXiv 2021年

作者： Liu, Guliu Li, Lei Liu, Guanfeng Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education China School of Computer Science and Information Engineering Hefei University of Technology China Department of Computing Macquarie University Australia Mininglamp Academy of Sciences Mininglamp Technology China

Traditional social group analysis mostly uses interaction models, event models, or other methods to identify and distinguish groups. This type of method can divide social participants into different groups based on their geographic location, social relationships, and/or related events. However, in some applications, it is necessary to make more specific restrictions on the members and the interaction between members of the group. Generally, graph pattern matching (GPM) is used to solve this problem. However, the existing GPM methods rarely consider the rich contextual information of nodes and edges to measure the credibility between members. In this paper, a social group query problem that needs to consider the trust between members of the group is proposed. To solve this problem, we propose a Strong Simulation GPM algorithm (NTSS) based on the exploration of pattern Node Topological ordered sequence. Aiming at the inefficiency of the NTSS algorithm when matching pattern graph with multiple nodes with zero in-degree and the problem of repeated calculation of matched edges shared by multiple matching subgraphs, two optimization strategies are proposed. Finally, we conduct verification experiments on the effectiveness and efficiency of the NTSS algorithm and the algorithms with the optimization strategies on four social network datasets in real applications. Experimental results show that the NTSS algorithm is significantly better than the existing multi-constrained GPM algorithm, and the NTSS_Inv_EdgC algorithm, which combines two optimization strategies, greatly improves the efficiency of the NTSS algorithm. Copyright © 2021, The Authors. All rights reserved.

关键词： Constrained optimization

来源：评论

学校读者我要写书评

暂无评论

An ontology automation construction scheme for Chinese e-government thesaurus optimizing

引用

Proceedings of the Association for Information Science and Technology 2020年第1期57卷

作者： Wang, Hao Zhang, Wei Deng, Sanhong Zhang, Baolong School of Information Management Nanjing University Nanjing China Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing China

To optimize the term hierarchy in the manual e-government thesaurus, we combine the mainstream knowledge organization technology to form a complete set of ontology automation construction scheme. We build an e-government knowledge base by using subject words in the Comprehensive E-government Thesaurus as the term set and encyclopedia text as the corpus. The specific work includes the extraction of semantic features from the bag-of-words model, determination of the number of clusters by linear and nonlinear dimensionality reduction, division of terms by spectral clustering, social network analysis to determine the class label, and storing knowledge ontology via OWL. The recall rate of term hierarchy in the ontology is excellent, indicating the ontology has good knowledge extensibility, and also proving the efficiency of the scheme proposed in this work. Besides, the application model of a term hierarchy in information retrieval can show a richer semantic relation than the original thesaurus to guide the retrieval extension of government information resources. 83rd Annual Meeting of the Association for Information Science & Technology October 25-29, 2020. Author(s) retain copyright, but ASIS&T receives an exclusive publication license.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Sampling topic representative users by integrating node degree and edge weight 5

Sampling topic representative users by integrating node degr...

引用

5th IEEE International Conference on data Science in Cyberspace, DSC 2020

作者： Wang, Jiangwen Ban, Zhijie Inner Mongolia A.R. Key Laboratory of Data Mining and Knowledge Engineering College of Computer Science Inner Mongolia University Huhhot China China Banking and Insurance Information Technology Management Co. Ltd Beijing China

ISBN: (纸本)9781728195582

Finding a subset of users to statistically represent the original social network in terms of attributes has received a lot of attention recently. The existing literature had proved that the problem is NP-Hard and proposed some sampling models, but representative degrees aren't systematically studied. Taking node degree and edge weight into account, we present a topic sampling model for the whole social network in this paper. Firstly, by statistically calculating node degrees for one real dataset, we find that one node is more likely to be a representative user if its degree is high. We then give some definitions about representative degrees. Based on statistical stratified sample, we finally give a sampling model of topic representative users who are from most or all attribute groups in the network. Experimental results show that our algorithm significantly outperforms other six baseline methods and is also effective in terms of time complexity. © 2020 IEEE.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

knowledge Fragment Cleaning in a Genealogy knowledge Graph

Knowledge Fragment Cleaning in a Genealogy Knowledge Graph

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Guliu Liu Lei Li Key Laboratory of Knowledge Engineering with Big Data (Heifei Unversity of Technology) Ministry of Education Heifei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

As an important topic of artificial intelligence, knowledge graphs have a wide range of applications such as semantic search, intelligent question answering, and visual decision support. Among them, the genealogy knowledge graph, as a kind of domain knowledge graph, has important application value in genetic disease analysis, population behavior analysis, etc. In the case of multiple data sources and multi-person collaboration, the construction of a genealogy knowledge graph involves the techniques of knowledge representation, knowledge acquisition, and knowledge fusion. In the knowledge fusion process, there are many situations such as the lack and chaos of a relationship, redundant entities, the isolation of some entities and knowledge fragments. How to effectively detect and process these problematic knowledge fragments is significant to the construction of a genealogy knowledge graph. In response to this problem, we propose a method for cleaning the problematic knowledge fragments in a genealogy knowledge graph. The method consists of three phases. In phase 1, we propose a method for detecting and analyzing the problematic knowledge fragments. In phase 2, we design a method for supplementing the entity-relationship of people for different error patterns and a method fusion method for the aligned entity. In phase 3, for the cleaning of isolated knowledge fragments, we propose an entity alignment method based on the father-son relationship and people's names and a connection method of isolated knowledge fragments. Finally, we conduct experiments on a family tree dataset of the Huapu System, and the experimental results indicate the effectiveness and practicality of the method.

关键词： Cleaning Big data knowledge acquisition Redundancy Organizations databases

来源：评论

学校读者我要写书评

暂无评论

The Development Trends of Fuel Cell Technologies Based on Patent Analysis

The Development Trends of Fuel Cell Technologies Based on Pa...

引用

2019 International Conference on Building Energy Conservation, Thermal Safety and Environmental Pollution Control, ICBTE 2019

作者： Tan Xinyu Zhang Yingxuan Deng Sanhong School of Information Management Nanjing university Key Laboratory of Data Engineering and Knowledge Services in Jiangsu Province

Fuel cells are made from fuel and *** of its low pollution,high energy conversion efficiency and high reliability,fuel cell has become the future direction of new energy application,the technological development path in the field of fuel cell research has great significance to the development of technological and energy *** the patent analysis method,this paper analyses the patent data from Derwent Innovation Index quantitively to study the state of application for patents,core technologies,highly cited patents and the main *** shows that auxiliary device and related methods were a research hotspot in recent years;as the biggest patent holder of fuel cell technologies,Toyota,Honda motor *** Nissan motor *** an *** paper has discovered some potential problems behind the phenomena and some suggestions are put forward finally.

关键词： Fuel cells

来源：评论

学校读者我要写书评

暂无评论

Neural Collaborative Recommendation with knowledge Graph

Neural Collaborative Recommendation with Knowledge Graph

引用

IEEE International Conference on Big knowledge (ICBK)

作者： Lei Sang Lei Li Key Laboratory of Knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education Hefei China

ISBN: (数字)9781728181561

ISBN: (纸本)9781728181578

knowledge Graph (KG), which commonly consists of fruitful connected facts about items, presents an unprecedented opportunity to alleviate the sparsity problem in recommender system. However, existing KG based recommendation methods mainly rely on handcrafted meta-path features or simple triple-level entity embedding, which cannot automatically capture entities' long-term relational dependencies for the recommendation. In this paper, a two-channel neural interaction method named knowledge Graph enhanced Neural Collaborative Filtering with Residual Recurrent Network (KGNCF-RRN) is proposed, which leverages both long-term relational dependencies KG context and user-item interaction for recommendation. (1) For the KG context interaction channel, we propose a Residual Recurrent Network (RRN) to construct context-based path embedding, which incorporates residual learning into traditional recurrent neural networks (RNNs) to efficiently encode the long-term relational dependencies of KG. The self-attention network is then applied to the path embedding to capture the polysemy of various user interaction behaviours. (2) For the user-item interaction channel, the user and item embeddings are fed into a newly designed two-dimensional interaction map. (3) Finally, above the two-channel neural interaction matrix, we employ a convolutional neural network to learn complex correlations between user and item. Extensive experimental results on three benchmark datasets show that our proposed approach outperforms existing state-of-the-art approaches for knowledge graph based recommendation.

关键词： Collaboration Recurrent neural networks knowledge engineering Semantics Motion pictures Context modeling Filtering

来源：评论

学校读者我要写书评

暂无评论

Context-Dependent Propagating-Based Video Recommendation in Multimodal Heterogeneous Information Networks

引用

IEEE Transactions on Multimedia 2021年 23卷 2019-2032页

作者： Lei Sang Min Xu Shengsheng Qian Matt Martin Peter Li Xindong Wu Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei China Faculty of Engineering and Information Technology University of Technology Sydney Sydney NSW Australia Institute of Automation Chinese Academy of Sciences Beijing China INTERACT Technology Sydney NSW Australia Mininglamp Academy of Sciences Mininglamp Technology Beijing China

With the emergence of online social networks (OSNs), video recommendation has come to play a crucial role in mitigating the semantic gap between users and videos. Conventional approaches to video recommendation primarily focus on exploiting content features or simple user-video interactions to model the users’ preferences. Although these methods have achieved promising results, they fail to model the complex video context interdependency, which is obscure/hidden in heterogeneous auxiliary data from OSNs. In this paper, we study the problem of video recommendation in Heterogeneous Information Networks (HINs) due to its excellence in characterizing heterogeneous and complex context information. We propose a Context-Dependent Propagating Recommendation network (CDPRec) to obtain accurate video embedding and capture global context cues among videos in HINs. The CDPRec can iteratively propagate the contexts of a video along links in a graph-structured HIN and explore multiple types of dependencies among the surrounding video nodes. Then, each video is represented as the composition of the multimodal content feature and global dependency structure information using an attention network. The learned video embedding with sequential based recommendation are jointly optimized for the final rating prediction. Experimental results on real-world YouTube video recommendation scenarios demonstrate the effectiveness of the proposed methods compared with strong baselines.

关键词： Semantics Collaboration YouTube Australia Visualization Context modeling

来源：评论

学校读者我要写书评

暂无评论

Multi-scale Graph Convolutional Neural Network for Object Recognition from Point Cloud data 2nd

Multi-scale Graph Convolutional Neural Network for Object Re...

引用

2nd International Conference on Urban Intelligence and Applications, ICUIA 2020

作者： Lu, Qiang Chen, Chao Teng, Jinfeng Zhang, Chunyuan Huang, Yi Xuan, Shanli Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Hefei University of Technology Hefei230009 China School of Computer and Information Hefei University of Technology Hefei230009 China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei230009 China

ISBN: (纸本)9789813346000

How to make robots understand the point cloud data which is collected from the 3D sensor and complete the recognition has become a hot research direction in recent years. In this paper, we propose a new approach to improve the critical robotic capability, semantic understanding of the environment (i.e., 3D object recognition). The convolutional neural network (CNN) method has a very good recognition result in the 2D image domain, but it has certain difficulty in applying irregular and unordered 3D point clouds data. The network for point cloud data generally uses the convolution to realize the extraction of point cloud features by finding the neighborhood features on the point set. Due to the different neighborhood scales caused by the irregularity of 3D point cloud data, we propose a CNN structure that combines multi-scale features. By finding multiple neighborhoods of the point set and establishing local graph extraction features, the stable expression of the local neighborhood is obtained. At the same time, the key point calibration method is added, so that the network can dynamically focus on key point features to improve the recognition result. In a series of analytical experiments, we demonstrate competing results that demonstrate the effectiveness of the network structure. © 2020, Springer Nature Singapore Pte Ltd.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：