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

第二届先进电子材料、计算机与材料工程国际学术会议（AEMCME 2019）

作者： Yueyao Li Sanhong Deng Yue Zhang School of Information Management Nanjing University Jiangsu Key Laboratory of Data Engineering and Knowledge Service Nanjing University

Due to the lack of theoretical knowledge and practical experience, the university students have many deficiencies in contribution. We conducted semi-structured interviews with 28 undergraduate and postgraduate students of Nanjing Agricultural University. At the same time, we used descriptive statistics and cross-analysis methods to analyse the motivations of college students' initial contribution and the influencing factor of their choice. Based on this, this paper puts forward some suggestions for the initial submission of college students, and the journals are also provided for reference in the selection of manuscripts.

关键词：

The pace of artificial intelligence innovations: speed, talent, and trial- and-error1

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tang, Xuli Li, Xin Ding, Ying Song, Min Bu, Yi School of Information Management Wuhan university WuhanHubei China Information retrieval and Knowledge Mining Laboratory School of Information Management Wuhan University Wuhan Hubei China School of Information University of Texas AustinTX United States Dell Medical School University of Texas AustinTX United States Department of Library and Information Science Yonsei University Seoul Korea Republic of School of Informatics Computing and Engineering Indiana University BloomingtonIN United States

Innovations in artificial intelligence (AI) are occurring at speeds faster than ever witnessed before. However, few studies have managed to measure or depict this increasing velocity of innovations in the field of AI. In this paper, we combine data on AI from arXiv and Semantic Scholar to explore the pace of AI innovations from three perspectives: AI publications, AI players, and AI updates (trial and error). A research framework and three novel indicators, Average Time Interval (ATI), Innovation Speed (IS) and Update Speed (US), are proposed to measure the pace of innovations in the field of AI. The results show that: (1) in 2019, more than 3 AI preprints were submitted to arXiv per hour, over 148 times faster than in 1994. Furthermore, there was one deep learning–related preprint submitted to arXiv every 0.87 hours in 2019, over 1,064 times faster than in 1994. (2) For AI players, 5.26 new researchers entered into the field of AI each hour in 2019, more than 175 times faster than in the 1990s. (3) As for AI updates (trial and error), one updated AI preprint was submitted to arXiv every 41 days, with around 33% of AI preprints having been updated at least twice in 2019. In addition, as reported in 2019, it took, on average, only around 0.2 year for AI preprints to receive their first citations, which is 5 times faster than 2000–2007. This swift pace in AI illustrates the increase in popularity of AI innovation. The systematic and fine-grained analysis of the AI field enabled to portrait the pace of AI innovation and demonstrated that the proposed approach can be adopted to understand other fast-growing fields such as cancer research and nano science. Copyright © 2020, The Authors. All rights reserved.

关键词： Speed

Trustworthy preference completion in social choice

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Li, Lei Xue, Minghe H., Chen X., Wu The School of Computer Science and Technology University of Science and Technology of China China Mininglamp Academy of Sciences Mininglamp Technologies Beijing China Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology School of Computer Science and Information Engineering Hefei University of Technology Hefei China

As from time to time it is impractical to ask agents to provide linear orders over all alternatives, for these partial rankings it is necessary to conduct preference completion. Specifically, the personalized preference of each agent over all the alternatives can be estimated with partial rankings from neighboring agents over subsets of alternatives. However, since the agents’ rankings are nondeterministic, where they may provide rankings with noise, it is necessary and important to conduct the trustworthy preference completion. Hence, in this paper firstly, a trust-based anchor-kNN algorithm is proposed to find k-nearest trustworthy neighbors of the agent with trust-oriented Kendall-Tau distances, which will handle the cases when an agent exhibits irrational behaviors or provides only noisy rankings. Then, for alternative pairs, a bijection can be built from the ranking space to the preference space, and its certainty and conflict can be evaluated based on a well-built statistical measurement Probability-Certainty Density Function. Therefore, a certain common voting rule for the first k trustworthy neighboring agents based on certainty and conflict can be taken to conduct the trustworthy preference completion. The properties of the proposed certainty and conflict have been studied empirically, and the proposed approach has been experimentally validated compared to state-of-arts approaches with several data sets. © 2020, CC BY.

关键词： Nearest neighbor search

Records systems and information systems: Connecting in organizations 8th

学校读者我要写书评

暂无评论

Records systems and information systems: Connecting in organ...

8th International Joint Conference on knowledge Discovery, knowledge engineering and knowledge Management, IC3K 2016

作者： Xie, Sherry L. Fan, Guanyan Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education of China Beijing100872 China Center for Electronic Records Management Research Beijing100872 China School of Information Resource Management Renmin University of China 59 Zhongguancun Ave Haidian District Beijing100872 China

ISBN: (纸本)9783319997001

The field of information Systems (ISs) has long been recognized, so has Enterprise information Systems (EISs), a field close to it. Long existing also in organizations or enterprises is the field of records management, now predominantly digital records management (DRM), which shares the many goals of ISs and EISs in supporting the operation and success of organizations. While the DRM field recognized rather early in its battle to digital records challenges that the need to establish formal collaborations with the ISs and EISs professions, it is still rare to spot today discussions regarding such collaborations in the general information and communication technology (ICT) literature. To help bridge the gap, this chapter introduces to the ISs and EISs professions one of the major developments of the international DRM field, that is, the records systems elaborated by the InterPARES (International Research on Permanent and Authentic Records in Electronic Systems) project, for the purpose of invoking further discussions. © Springer Nature Switzerland AG 2019.

关键词： information systems

A deep belief network-based method to identify proteomic risk markers for Alzheimer’s disease

学校读者我要写书评

暂无评论

arXiv 2020年

作者： An, Ning Jin, Liuqi Ding, Huitong Yang, Jiaoyun Yuan, Jing Key Laboratory of Knowledge Engineering Big Data of Ministry of Education Hefei University of Technology Hefei China School of Computer Science and Information Engineering Hefei University of Technology Hefei China Department of Neurology Peking Union Medical College Hospital Chinese Academy of Medical Sciences Beijing China

While a large body of research has formally identified apolipoprotein E (APOE) as a major genetic risk marker for Alzheimer’s disease, accumulating evidence supports the notion that other risk markers may exist. The traditional Alzheimer’s-specific signature analysis methods, however, have not been able to make full use of rich protein expression data, especially the interaction between attributes. This paper develops a novel feature selection method to identify pathogenic factors of Alzheimer’s disease using the proteomic and clinical data. This approach has taken the weights of network nodes as the importance order of signaling protein expression values. After generating and evaluating the candidate subset, the method helps to select an optimal subset of proteins that achieved an accuracy greater than 90%, which is superior to traditional machine learning methods for clinical Alzheimer’s disease diagnosis. Besides identifying a proteomic risk marker and further reinforce the link between metabolic risk factors and Alzheimer’s disease, this paper also suggests that apidonectin-linked pathways are a possible therapeutic drug target. Copyright © 2020, The Authors. All rights reserved.

关键词： Feature extraction

Liver Segmentation in Time-resolved C-arm CT Volumes Reconstructed from Dynamic Perfusion Scans using Time Separation Technique

学校读者我要写书评

暂无评论

Liver Segmentation in Time-resolved C-arm CT Volumes Reconst...

International Image Processing, Applications and Systems Conference (IPAS)

作者： Soumick Chatterjee Hana Haseljić Robert Frysch Vojtěch Kulvait Vladimir Semshchikov Bennet Hensen Frank Wacker Inga Brüsch Thomas Werncke Oliver Speck Andreas Nürnberger Georg Rose Data and Knowledge Engineering Group Faculty of Computer Science Otto von Guericke University Magdeburg Magdeburg Germany Department of Biomedical Magnetic Resonance Faculty of Nature Science Otto von Guericke University Magdeburg Magdeburg Germany Faculty of Electrical Engineering and Information Technology Institute for Medical Engineering Otto von Guericke University Magdeburg Magdeburg Germany Faculty of Electrical Engineering and Information Technology Research Campus STIMULATE Otto von Guericke University Magdeburg Magdeburg Germany Institute of Materials Physics Helmholtz-Zentrum hereon Geesthacht Germany Institute of Diagnostic and Interventional Radiology Hannover Medical School Hannover Germany Research Campus STIMULATE Otto von Guericke University Magdeburg Magdeburg Germany Institute for Laboratory Animal Science Hannover Medical School Hannover Germany Department of Biomedical Magnetic Resonance Faculty of Nature Science Otto von Guericke University Magdeburg German Center for Neurodegenerative Disease Magdeburg Germany Center for Behavioral Brain Sciences Magdeburg Germany

ISBN: (纸本)9781665462204

Perfusion imaging is a valuable tool for diagnosing and treatment planning for liver tumours. The time separation technique (TST) has been successfully used for modelling C-arm cone-beam computed tomography (CBCT) perfusion data. The reconstruction can be accompanied by the segmentation of the liver - for better visualisation and for generating comprehensive perfusion maps. Recently introduced Turbolift learning has been seen to perform well while working with TST reconstructions, but has not been explored for the time-resolved volumes (TRV) estimated out of TST reconstructions. The segmentation of the TRVs can be useful for tracking the movement of the liver over time. This research explores this possibility by training the multi-scale attention UNet of Turbolift learning at its third stage on the TRVs and shows the robustness of Turbolift learning since it can even work efficiently with the TRVs, resulting in a Dice score of $0.864\pm 0.004$ .

关键词： Training Image segmentation Computed tomography Computational modeling Motion segmentation Liver Imaging

MDPL-net: Multi-layer Dictionary Learning Network with Added Skip Dense Connections

学校读者我要写书评

暂无评论

MDPL-net: Multi-layer Dictionary Learning Network with Added...

IEEE International Conference on data Mining (ICDM)

作者： Zhao Zhang Yulin Sun Zheng Zhang Yang Wang Lin Wu Meng Wang School of Computer Science and Technology Soochow University Suzhou China Ministry of Education Key Laboratory of Knowledge Engineering with Big Data School of Computer Science and Information Engineering Hefei University of Technology Hefei China Bio-Computing Research Center Harbin Institute of Technology (Shenzhen) Shenzhen China

ISBN: (数字)9781728183169

ISBN: (纸本)9781728183176

Dictionary learning (DL) is powerful for representation learning, while it fails to capture the deep hierarchical information hidden in data. In this paper, we propose a new generalized end-to-end mulita-layer representation learning architecture referred to as Multi-layer Dictionary Pair Learning Network (MDPL-net) for the deep sparse and hierarchical representation of images. To enable MDPL-net to conduct accurate classification, MDPL-net clearly integrates the skip connection end-to-end network and multi-layer deep sparse dictionary learning into a unified architecture. The representation learning module has several hidden DL blocks, where each hidden DL block has a dictionary pair learning (DPL) layer, a batch-norm layer and an activation function layer, and the DL blocks are connected in a feed-forward manner. To further improve the information flow and maintain the privileged features between different DL blocks, a novel skip dense connectivity pattern is deployed between hidden DL blocks, which can obtain more stable and discriminative features. The DPL layer jointly formulates the discriminative synthesis dictionary and analysis dictionary by minimizing reconstruction error within each batch over the feature maps from front layers. Extensive results on benchmark databases demonstrate the effectiveness of MDPL-net for discriminative representation and robust image classification.

关键词： Dictionaries databases Conferences Machine learning data mining Image reconstruction Image classification

Real-time Semantic Segmentation via Spatial-detail Guided Context Propagation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Hao, Shijie Zhou, Yuan Guo, Yanrong Hong, Richang Cheng, Jun Wang, Meng Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Hefei230009 China CAS Key Laboratory of Human-Machine Intelligence-Synergy Systems Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Chinese University of Hong Kong Hong Kong

Nowadays, vision-based computing tasks play an important role in various real-world applications. However, many vision computing tasks, e.g. semantic segmentation, are usually computationally expensive, posing a challenge to the computing systems that are resource-constrained but require fast response speed. Therefore, it is valuable to develop accurate and real-time vision processing models that only require limited computational resources. To this end, we propose the Spatial-detail Guided Context Propagation Network (SGCPNet) for achieving real-time semantic segmentation. In SGCPNet, we propose the strategy of spatial-detail guided context propagation. It uses the spatial details of shallow layers to guide the propagation of the low-resolution global contexts, in which the lost spatial information can be effectively reconstructed. In this way, the need for maintaining high-resolution features along the network is freed, therefore largely improving the model efficiency. On the other hand, due to the effective reconstruction of spatial details, the segmentation accuracy can be still preserved. In the experiments, we validate the effectiveness and efficiency of the proposed SGCPNet model. On the Citysacpes dataset, for example, our SGCPNet achieves 69.5% mIoU segmentation accuracy, while its speed reaches 178.5 FPS on 768×1536 images on a GeForce GTX 1080 Ti GPU card. In addition, SGCPNet is very lightweight and only contains 0.61 M parameters. The code will be released at https://***/zhouyuan888888/SGCPNet. Copyright © 2020, The Authors. All rights reserved.

关键词： Semantic Segmentation

Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

学校读者我要写书评

暂无评论

Extremely Short Chinese Text Classification Method Based on ...

作者： Yongzeng Yue Yuhong Zhang Xuegang Hu Peipei Li Key Laboratory of knowledge Engineering with Big Data (Hefei University of Technology) Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology

Short text classification methods have achieved significant progress and wide application on text data such as Twitter and Weibo. However, the extremely short chinese texts like tax invoice data are different with traditional short texts in lackness of contextual semantic information, feature sparseness and extremely short length. The existing short text classification methods are difficult to achieve a satisfactory performance in these texts. To address these problems, this paper proposes a text classification method based on bidirectional semantic extension for extremely short texts like Chinese tax invoice data. More specifically, firstly, the Chinese knowledge graph is introduced for extending bidirectional semantic of texts and label data to expand the extremely short texts and ease the problem of feature sparseness;secondly,the hash vectorization is used to avoid the semantic problem caused by the lackness of contextual information. Experimental results conducted the real tax invoice dataset demonstrate the effectiveness of our proposed method.

关键词： Extremely Short Chinese Text Classification Method Based on Bidirectional Semantic Extension

Personalizing search results using hierarchical RNN with query-aware attention

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Ge, Songwei Dou, Zhicheng Jiang, Zhengbao Nie, Jian-Yun Wen, Ji-Rong School of Information Renmin University of China DIRO Université de Montréal Beijing Key Laboratory of Big Data Management and Analysis Methods National Engineering Laboratory of Big Data System Software Beijing Institute of Technology Key Laboratory of Data Engineering and Knowledge Engineering MOE

Search results personalization has become an effective way to improve the quality of search engines. Previous studies extracted information such as past clicks, user topical interests, query click entropy and so on to tailor the original ranking. However, few studies have taken into account the sequential information underlying previous queries and sessions. Intuitively, the order of issued queries is important in inferring the real user interests. And more recent sessions should provide more reliable personal signals than older sessions. In addition, the previous search history and user behaviors should influence the personalization of the current query depending on their relatedness. To implement these intuitions, in this paper we employ a hierarchical recurrent neural network to exploit such sequential information and automatically generate user profile from historical data. We propose a query-aware attention model to generate a dynamic user profile based on the input query. Significant improvement is observed in the experiment with data from a commercial search engine when compared with several traditional personalization models. Our analysis reveals that the attention model is able to attribute higher weights to more related past sessions after fine training. Copyright © 2019, The Authors. All rights reserved.

关键词： Search engines