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

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

来源：评论

学校读者我要写书评

暂无评论

Frontiers of Artificial Intelligent and Quantitative Management: Preface for ITQM 2024

引用

Procedia Computer Science 2024年 242卷 1-8页

作者： Filip, Florin Gheorghe Shi, Yong Pocatilu, Paul Ciurea, Cristian-Eugen Li, Jianping Tien, James M. Berg, Daniel Romanian Academy Information Science and Technology Section Bucharest Romania Research Centre on Fictitious Economy and Data Science Chinese Academy of Sciences Beijing100190 China Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States Bucharest University of Economic Studies Bucharest Romania College of Engineering University of Miami Coral GablesFL33124 United States

来源：评论

学校读者我要写书评

暂无评论

Enabling Efficient Random Access to Hierarchically-Compressed data

Enabling Efficient Random Access to Hierarchically-Compresse...

引用

International Conference on data engineering

作者： Feng Zhang Jidong Zhai Xipeng Shen Onur Mutlu Xiaoyong Du Key Laboratory of Data Engineering and Knowledge Engineering (MOE) and School of Information Renmin University of China Department of Computer Science and Technology Tsinghua University BNRist Computer Science Department North Carolina State University Department of Computer Science ETH Zürich

ISBN: (数字)9781728129037

ISBN: (纸本)9781728129044

Recent studies have shown the promise of direct data processing on hierarchically-compressed text documents. By removing the need for decompressing data, the direct data processing technique brings large savings in both time and space. However, its benefits have been limited to data traversal operations; for random accesses, direct data processing is several times slower than the state-of-the-art baselines. This paper presents a set of techniques that successfully eliminate the limitation, and for the first time, establishes the feasibility of effectively handling both data traversal operations and random data accesses on hierarchically-compressed data. The work yields a new library, which achieves 3.1× speedup over the state-of-the-art on random data accesses to compressed data, while preserving the capability of supporting traversal operations efficiently and providing large (3.9×) space savings.

关键词： Indexing data processing data structures Technological innovation Dictionaries Law data mining

来源：评论

学校读者我要写书评

暂无评论

Automatic Retinal Nerve Fiber Trajectory Simulation and Quasi-polar Transformation for Detecting Retinal Nerve Fiber Layer Defect in Fundus Images

Automatic Retinal Nerve Fiber Trajectory Simulation and Quas...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Yanni Wang Gang Yang Dayong Ding Jianchun Zhao School of Information Renmin University of China Beijing China Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing China Vistel AI Lab Beijing Office Visionary Intelligence Ltd. Beijing China

The retinal nerve fiber layer defects (RNFLD) provide early objective evidence for many retinal abnormalities, especially early glaucoma. The recent success of deep learning has led to exciting prospects in automating the detection of RNFLD, but it is highly dependent on the availability of large-scale datasets carefully annotated by experienced ophthalmologists, which is both time-consuming and cost-prohibitive. Most previous works on RNFLD detection lack a unified annotation scheme. In addition, they fail to exploit the intrinsic morphological characteristics of retinal nerve fiber bundles (RNFB). This work presents an automatic RNFB tracing method that is applicable not only in automating the RNFLD annotation process, but also in performing a quasi-polar transformation on fundus images for subsequent RNFLD detection tasks. Also, our proposed method paves the way for alleviating the problem of inter-annotator variation incurred merely by different annotation habits among annotators and reducing the noise before the input stage. Experiments reveal that our proposed quasi-polar transformation provides a significant boost to the existing RNFLD detection method and surpasses the state-of-the-art F1 by 4.2%, and that our method also offers a more accurate and reasonable description of RNFLD detection results, which demonstrates the orientation of RNFLD rather than vague position indication.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Static vulnerabilities detection method based on security state tracing and checking

引用

Jisuanji Xuebao/Chinese Journal of Computers 2009年第5期32卷 899-909页

作者： Liang, Bin Hou, Kan-Kan Shi, Wen-Chang Liang, Zhao-Hui School of Information Renming University of China Beijing 100872 China MOE Key Laboratory of Data Engineering and Knowledge Engineering Beijing 100872 China

The main problem of existing static vulnerability detection methods based source code analysis is their high false positive and false negative rates. One main reason is lack of accurate and effective identification and analysis of security-related program elements, e.g. data validation checking, tainted data source, etc. A static vulnerability detection method based on data security state tracing and checking is proposed. In this method, the state space of state machine model is extended;the security state of a variable is identified by a vector that may correspond to multiple security-related properties rather than by a single property;Fine-grained state transition is provided to support accurate recognition of program security-related behaviors;The recognition of validation checking is introduced in vulnerability state machine to reduce false positives;and a systematic discrimination mechanism for tainted data is constructed to prevent false negatives result from neglecting tainted data sources. The experimental results of a prototype system show that this method can effectively detect buffer overflow and other type's vulnerabilities in software systems, and with obviously lower false positive than existing mainstream static detection methods and avoid some serious false negatives of these methods.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Constant approximation for virtual backbone construction with Guaranteed Routing Cost in wireless sensor networks

Constant approximation for virtual backbone construction wit...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE Computer and Communications Societies

作者： Hongwei Du Qiang Ye Weili Wu Wonjun Lee Deying Li Dingzhu Du Stephen Howard Department of Computer Science and Information Technology University of Prince Edward Island Canada Department of Computer Science University of Texas Dallas USA Department of Computer Science and Engineering Korea University Seoul South Korea Key Laboratory of Data Engineering and Knowledge Engineering MOE Renmin University of China China

ISBN: (纸本)9781424499199

In wireless sensor networks, virtual backbone construction based on connected dominating set is a competitive issue for routing efficiency and topology control. Assume that a sensor networks is defined as a connected unit disk graph (UDG). The problem is to find a minimum connected dominating set of given UDG with minimum routing cost for each node pair. We present a constant approximation scheme which produces a connected dominating set D, whose size |D| is within a factor α from that of the minimum connected dominating set and each node pair exists a routing path with all intermediate nodes in D and with length at most 5 · d(u,v), where d(u,v) is the length of shortest path of this node pair. A distributed algorithm is also provided with analogical performance. Extensive simulation shows that our distributed algorithm achieves significantly than the latest solution in research direction.

关键词： Routing Approximation methods Distributed algorithms Wireless sensor networks Polynomials Computer science Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Developing Global Digital Economy after COVID-19: Preface for ITQM 2020 & 2021

引用

Procedia Computer Science 2021年 199卷 1-9页

作者： Liu, Yubin Shi, Yong Wang, Yong Ergu, Daji Berg, Daniel Tien, James Li, Jianping Tian, Yingjie Southwest Minzu University Sichuan Chengdu610041 China College of Information Science and Technology University of Nebraska at Omaha OmahaNE68182 United States Key Lab of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing100190 China College of Engineering University of Miami Coral GablesFL33124 United States School of Economics and Management University of Chinese Academy of Sciences Beijing100190 China

Welcome to the Eighth International Conference on Information Technology and Quantitative Management (ITQM 2020 & 2021), July 9-11, Chengdu, China. The theme of ITQM 2020 & 2021 is “Developing Global Digital Economy after COVID-19”. ITQM 2020 & 2021 is organized by International Academy of Information Technology and Quantitative Management (IAITQM), Southwest Minzu University, Chinese Academy of Sciences and University of Nebraska at Omaha. IAITQM was formally inaugurated on June 3, 2012 with more than 50 founding members from China, United States, Australia, Japan, Lithuania, Poland, Romania, Spain, Singapore, South Korea, The Netherlands, Turkey and other countries. The International Conference on Information Technology and Quantitative Management (ITQM), established by IAITQM, is a global forum for exchanging research findings and case studies that bridge the latest information technology and quantitative management techniques. It explores how the use of information technology techniques to improve quantitative management and how the development of management tools can reshape the development of information technology. The First International Conference on Information Technology and Quantitative Management (ITQM 2013) took place in Suzhou, China. The Second International Conference on Information Technology and Quantitative Management (ITQM 2014) was held in Moscow, Russia. The Third International Conference on Information Technology and Quantitative Management (ITQM 2015) was held at Rio de Janeiro, Brazil. The Forth International Conference on Information Technology and Quantitative Management (ITQM 2016) was held at Asan, Korea. The Fifth International Conference on Information Technology and Quantitative Management (ITQM 2017) was held at New Delhi, India. The Sixth International Conference on Information Technology and Quantitative Management (ITQM 2018) was hosted at Omaha, USA. The Seventh International Conference on Information Technology and Quantitative

关键词：

来源：评论

学校读者我要写书评

暂无评论

The research on three-dimensional simulation of forest fire by FARSITE for GIS application

引用

Energy Education Science and Technology Part A: Energy Science and Research 2014年第5期32卷 3231-3240页

作者： Li, Jian Wei Huang, Shiwu Chen, Chongcheng Xu, Qifeng Fuzhou University and Key Lab of Spatial Data Mining & Information Sharing of MOE Spatial Information Research Center FuzhouFujian China Fzuzhou university and College of Physics and Information Engineering FuzhouFujian China

Wildfire spread is a complex process affected by many elements. FARSITE (Fire Area Simulator) is a forest fire spread simulation system widely applied and recognized in the world. This paper briefly describes the principles of the forest fire spread models as well as the instruction and treatment of the data required in FARSITE. The three-dimensional forest fire spread simulation system is then introduced, which uses the OSG (Open Scene Graph) as the three-dimensional graphic engine, the particle system for rendering simulation, and the FARSITE as the calculation engine. The three-dimensional simulation system displays the forest fire spread process in three dimensions, which can be used for predicting the edge of the forest fire and assessing the lose and damage as the burned area, and contributing to a more intuitive understanding of the elements affecting the forest fire spread. © Sila Science. All rights reserved.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Are Large Language Models Really Good Logical Reasoners? A Comprehensive Evaluation and Beyond

arXiv

引用

arXiv 2023年

作者： Xu, Fangzhi Lin, Qika Han, Jiawei Zhao, Tianzhe Liu, Jun Cambria, Erik The School of Computer Science and Technology Xi’an Jiao-tong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering National Engineering Lab for Big Data Analytics Shaanxi Xi’an710049 China The School of Computer Science and Engineering Nanyang Technological University Singapore

Logical reasoning consistently plays a fundamental and significant role in the domains of knowledge engineering and artificial intelligence. Recently, Large Language Models (LLMs) have emerged as a noteworthy innovation in natural language processing (NLP). However, the question of whether LLMs can effectively address the task of logical reasoning, which requires gradual cognitive inference similar to human intelligence, remains unanswered. To this end, we aim to bridge this gap and provide comprehensive evaluations in this paper. Firstly, to offer systematic evaluations, we select fifteen typical logical reasoning datasets and organize them into deductive, inductive, abductive and mixed-form reasoning settings. Considering the comprehensiveness of evaluations, we include 3 early-era representative LLMs and 4 trending LLMs. Secondly, different from previous evaluations relying only on simple metrics (e.g., accuracy), we propose fine-level evaluations in objective and subjective manners, covering both answers and explanations, including answer correctness, explain correctness, explain completeness and explain redundancy. Additionally, to uncover the logical flaws of LLMs, problematic cases will be attributed to five error types from two dimensions, i.e., evidence selection process and reasoning process. Thirdly, to avoid the influences of knowledge bias and concentrate purely on benchmarking the logical reasoning capability of LLMs, we propose a new dataset with neutral content. Based on the in-depth evaluations, this paper finally forms a general evaluation scheme of logical reasoning capability from six dimensions (i.e., Correct, Rigorous, Self-aware, Active, Oriented and No hallucination). It reflects the pros and cons of LLMs and gives guiding directions for future works. © 2023, CC BY.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Learning Two-Stream CNN for Multi-Modal Age-related Macular Degeneration Categorization

arXiv

引用

arXiv 2020年

作者： Wang, Weisen Li, Xirong Xu, Zhiyan Yu, Weihong Zhao, Jianchun Ding, Dayong Chen, Youxin The MoE Key Lab of Data Engineering and Knowledge Engineering Renmin University of China Beijing100872 China Aimc Lab School of Information Renmin University of China Beijing100872 China Vistel Ai Lab Visionary Intelligence Ltd. Beijing100872 China The Key Lab of Ocular Fundus Disease Chinese Academy of Medical Sciences Dept. of Ophthalmology Peking Union Medical College Hospital Beijing100730 China

This paper tackles automated categorization of Agerelated Macular Degeneration (AMD), a common macular disease among people over 50. Previous research efforts mainly focus on AMD categorization with a single-modal input, let it be a color fundus photograph (CFP) or an OCT B-scan image. By contrast, we consider AMD categorization given a multi-modal input, a direction that is clinically meaningful yet mostly unexplored. Contrary to the prior art that takes a traditional approach of feature extraction plus classifier training that cannot be jointly optimized, we opt for end-to-end multi-modal Convolutional Neural Networks (MM-CNN). Our MM-CNN is instantiated by a two-stream CNN, with spatially-invariant fusion to combine information from the CFP and OCT streams. In order to visually interpret the contribution of the individual modalities to the final prediction, we extend the class activation mapping (CAM) technique to the multi-modal scenario. For effective training of MM-CNN, we develop two data augmentation methods. One is GAN-based CFP/OCT image synthesis, with our novel use of CAMs as conditional input of a high-resolution image-to-image translation GAN. The other method is Loose Pairing, which pairs a CFP image and an OCT image on the basis of their classes instead of eye identities. Experiments on a clinical dataset consisting of 1,094 CFP images and 1,289 OCT images acquired from 1,093 distinct eyes show that the proposed solution obtains better F1 and Accuracy than multiple baselines for multimodal AMD categorization. Code and data are available at https://***/li-xirong/mmc-amd. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：