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

Overview of the CCKS 2019 knowledge graph evaluation track: Entity, relation, event and QA

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Han, Xianpei Wang, Zhichun Zhang, Jiangtao Wen, Qinghua Li, Wenqi Tang, Buzhou Wang, Qi Feng, Zhifan Zhang, Yang Lu, Yajuan Wang, Haitao Chen, Wenliang Shao, Hao Chen, Yubo Liu, Kang Zhao, Jun Wang, Taifeng Zhang, Kezun Wang, Meng Jiang, Yinlin Qi, Guilin Zou, Lei Hu, Sen Zhang, Minhao Lin, Yinnian Chinese Information Processing Laboratory Institute of Software Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence Beijing Normal University Beijing100875 China 305 Hospital of People’s Liberation Army Beijing100017 China Department of Computer Science and Technology Tsinghua University Beijing100084 China Yidu Cloud Beijing100000 China Harbin Institute of Technology Shenzhen Guangdong518055 China Baidu Beijing100193 China School of Computer Science & Technology Soochow University Suzhou Jiangsu215006 China Gowild Suzhou Jiangsu215002 China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing100190 China School of Artificial Intelligence University of Chinese Academy of Sciences Beijing100049 China Ant Financial Hangzhou Zhejiang310000 China School of Computer Science and Engineering Southeast University Nanjing Jiangsu211189 China Key Laboratory of Computer Network Information Integration Southeast University Nanjing Jiangsu211189 China Peking University Beijing100871 China

Knowledge graph models world knowledge as concepts, entities, and the relationships between them, which has been widely used in many real-world tasks. CCKS 2019 held an evaluation track with 6 tasks and attracted more than 1,600 teams. In this paper we give an overview of the knowledge graph evaluation tract at CCKS 2019. By reviewing the task definition, successful methods, useful resources, good strategies and research challenges associated with each task in CCKS 2019, this paper can provide a helpful reference for developing knowledge graph applications and conducting future knowledge graph researches. Copyright © 2020, The Authors. All rights reserved.

关键词： Knowledge graph

Combining Spectrum-Based Fault Localization and Statistical Debugging: An Empirical Study

学校读者我要写书评

暂无评论

Combining Spectrum-Based Fault Localization and Statistical ...

IEEE International Conference on Automated software Engineering (ASE)

作者： Jiajun Jiang Ran Wang Yingfei Xiong Xiangping Chen Lu Zhang Key Laboratory of High Confidence Software Technologies Ministry of Education (PKU) Department of Computer Science and Technology Peking University Beijing China Guangdong Key Laboratory for Big Data Analysis and Simulation of Public Opinion The School of Communication and Design Sun Yat-sen University Guangzhou China

Program debugging is a time-consuming task, and researchers have proposed different kinds of automatic fault localization techniques to mitigate the burden of manual debugging. Among these techniques, two popular families are spectrum-based fault localization (SBFL) and statistical debugging (SD), both localizing faults by collecting statistical information at runtime. Though the ideas are similar, the two families have been developed independently and their combinations have not been systematically explored. In this paper we perform a systematical empirical study on the combination of SBFL and SD. We first build a unified model of the two techniques, and systematically explore four types of variations, different predicates, different risk evaluation formulas, different granularities of data collection, and different methods of combining suspicious scores. Our study leads to several findings. First, most of the effectiveness of the combined approach contributed by a simple type of predicates: branch conditions. Second, the risk evaluation formulas of SBFL significantly outperform that of SD. Third, fine-grained data collection significantly outperforms coarse-grained data collection with a little extra execution overhead. Fourth, a linear combination of SBFL and SD predicates outperforms both individual approaches. According to our empirical study, we propose a new fault localization approach, PREDFL (Predicate-based Fault Localization), with the best configuration for each dimension under the unified model. Then, we explore its complementarity to existing techniques by integrating PREDFL with a state-of-the-art fault localization framework. The experimental results show that PREDFL can further improve the effectiveness of state-of-the-art fault localization techniques. More concretely, integrating PREDFL results in an up to 20.8% improvement w.r.t the faults successfully located at Top-1, which reveals that PREDFL complements existing techniques.

关键词： Debugging Data collection Instruments Runtime Systematics Computational modeling Data models

History-Guided Configuration Diversification for Compiler Test-Program Generation

学校读者我要写书评

暂无评论

History-Guided Configuration Diversification for Compiler Te...

IEEE International Conference on Automated software Engineering (ASE)

作者： Junjie Chen Guancheng Wang Dan Hao Yingfei Xiong Hongyu Zhang Lu Zhang College of Intelligence and Computing Tianjin University Tianjin China Key Laboratory of High Confidence Software Technologies Peking University) MoE Department of Computer Science and Technology EECS Peking University Beijing China The University of Newcastle NSW Australia

Compilers, like other software systems, contain bugs, and compiler testing is the most widely-used way to assure compiler quality. A critical task of compiler testing is to generate test programs that could effectively and efficiently discover bugs. Though we can configure test generators such as Csmith to control the features of the generated programs, it is not clear what test configuration is effective. In particular, an effective test configuration needs to generate test programs that are bug-revealing, i.e., likely to trigger bugs, and diverse, i.e., able to discover different types of bugs. It is not easy to satisfy both properties. In this paper, we propose a novel test-program generation approach, called HiCOND, which utilizes historical data for configuration diversification to solve this challenge. HiCOND first infers the range for each option in a test configuration where bug-revealing test programs are more likely to be generated based on historical data. Then, it identifies a set of test configurations that can lead to diverse test programs through a search method (particle swarm optimization). Finally, based on the set of test configurations for compiler testing, HiCOND generates test programs, which are likely to be bug-revealing and diverse. We have conducted experiments on two popular compilers GCC and LLVM, and the results confirm the effectiveness of our approach. For example, HiCOND detects 75.00%, 133.33%, and 145.00% more bugs than the three existing approaches, respectively. Moreover, HiCOND has been successfully applied to actual compiler testing in a global IT company and detected 11 bugs during the practical evaluation.

关键词： computer bugs Testing Program processors Generators Companies software systems

Protecting privacy of users in brain-computer interface applications

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Agarwal, Anisha Dowsley, Rafael McKinney, Nicholas D. Wu, Dongrui Lin, Chin-Teng De Cock, Martine Nascimento, Anderson C.A. School of Engineering and Technology University of Washington TacomaWA98402 United States Department of Computer Science Bar-Ilan University Israel School of Engineering and Technology University of Washington TacomaWA98402 United States Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Automation Huazhong University of Science and Technology Wuhan China School of Software University of Technology Sydney Australia Department of Applied Mathematics Computer Science and Statistics Ghent University Ghent9000 Belgium

Machine learning (ML) is revolutionizing research and industry. Many ML applications rely on the use of large amounts of personal data for training and inference. Among the most intimate exploited data sources is electroencephalogram (EEG) data, a kind of data that is so rich with information that application developers can easily gain knowledge beyond the professed scope from unprotected EEG signals, including passwords, ATM PINs, and other intimate data. The challenge we address is how to engage in meaningful ML with EEG data while protecting the privacy of users. Hence, we propose cryptographic protocols based on Secure Multiparty Computation (SMC) to perform linear regression over EEG signals from many users in a fully privacy-preserving (PP) fashion, i.e. such that each individual's EEG signals are not revealed to anyone else. To illustrate the potential of our secure framework, we show how it allows estimating the drowsiness of drivers from their EEG signals as would be possible in the unencrypted case, and at a very reasonable computational cost. Our solution is the first application of commodity-based SMC to EEG data, as well as the largest documented experiment of secret sharing based SMC in general, namely with 15 players involved in all the computations. Copyright © 2019, The Authors. All rights reserved.

关键词： Machine learning

Enhancing countries' fitness with recommender systems on the international trade network

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Liao, Hao Wu, Xing-Tong Vidmer, Alexandre Huang, Xiao-Min Liu, Ming-Kai Zhou, Mingyang Zhang, Yi-Cheng National Engineering Laboratory for Big Data System Computing Technology Guangdong Province Key Laboratory of Popular High Performance Computers College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Physics University of Fribourg Fribourg1700 Switzerland

Prediction is one of the major challenges in complex systems. The prediction methods have shown to be effective predictors of the evolution of networks. These methods can help policy makers to solve practical problems successfully and make better strategy for the future. In this work, we focus on exporting countries' data of the international trading network. A recommendation system is then used to identify the products corresponding to the production capacity of each individual country, but are somehow overlook by the country. Then, we simulate the evolution of the country's fitness if it would have followed the recommendations. The result of this work is the combination combine these two methods to provide insights to countries on how to enhance the diversification of their exported products in a scientific way and improve national competitiveness significantly, especially for developing countries. Copyright © 2019, The Authors. All rights reserved.

关键词： Recommender systems

Masked non-autoregressive image captioning

学校读者我要写书评

暂无评论

arXiv 2019年

作者： Gao, Junlong Meng, Xi Wang, Shiqi Li, Xia Wang, Shanshe Ma, Siwei Gao, Wen Peking University Shenzhen Graduate School National Key Lab for Novel Software Technology Nanjing University Institute of Digital Media Peking University Peng Cheng Laboratory Department of Computer Science City University of Hong Kong Hong Kong

Existing captioning models often adopt the encoder-decoder architecture, where the decoder uses autoregressive decoding to generate captions, such that each token is generated sequentially given the preceding generated tokens. However, autoregressive decoding results in issues such as sequential error accumulation, slow generation, improper semantics and lack of diversity. Non-autoregressive decoding has been proposed to tackle slow generation for neural machine translation but suffers from multimodality problem due to the indirect modeling of the target distribution. In this paper, we propose masked non-autoregressive decoding to tackle the issues of both autoregressive decoding and non-autoregressive decoding. In masked non-autoregressive decoding, we mask several kinds of ratios of the input sequences during training, and generate captions parallelly in several stages from a totally masked sequence to a totally non-masked sequence in a compositional manner during inference. Experimentally our proposed model can preserve semantic content more effectively and can generate more diverse captions. Copyright © 2019, The Authors. All rights reserved.

关键词： Decoding

RPC: Joint Online Reducer Placement and Coflow Bandwidth Scheduling for Clusters

学校读者我要写书评

暂无评论

RPC: Joint Online Reducer Placement and Coflow Bandwidth Sch...

International Conference on Network Protocols

作者： Yangming Zhao Chen Tian Jingyuan Fan Tong Guan Chunming Qiao Department of Computer Science and Engineering The State University of New York State Key Laboratory for Novel Software Technology Nanjing University

Reducing Coflow Completion Time (CCT) has a significant impact on application performance in data-parallel frameworks. Most existing works assume that the endpoints of constituent flows in each coflow are predetermined. We argue that CCT can be further optimized by treating flows' destinations as an additional optimization dimension via reducer placement. In this paper, we propose and implement RPC, a joint online Reducer Placement and Coflow bandwidth scheduling framework, to minimize the average CCT in cloud clusters. We first develop a 2-approximation algorithm to minimize the CCT of a single coflow, then schedule all the coflows following the Shortest Remaining Time First (SRTF) principle. We use a real testbed implementation and extensive large-scale simulations to demonstrate that RPC can reduce the average CCT by 64.98% compared with state-of-the-art technologies.

关键词： Bandwidth Task analysis Schedules Optimal scheduling Data transfer Data centers

A mobile cloud-based ehealth scheme

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Liu, Yihe Abbasi, Aaqif Afzaal Aghaei, Atefeh Abbasi, Almas Mosavi, Amir Shamshirband, Shahab Al-qaness, Mohammed A.A. Data Recovery Key Laboratory of Sichuan Province College of Computer Science and AI Neijiang Normal University Neijiang641100 China Department of Software Engineering Foundation University Islamabad44000 Pakistan Department of Communication Faculty of Social Sciences University of Tehran Tehran*** Iran Department of Computer Science International Islamic University Islamabad46000 Pakistan Institute of Research and Development Duy Tan University Da Nang550000 Viet Nam Kalman Kando Faculty of Electrical Engineering Obuda University Budapest1034 Hungary School of the Built Environment Oxford Brookes University OxfordOX3 0BP United Kingdom Department for Management of Science and Technology Development Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam School of Computer Science Wuhan University Wuhan430072 China

Mobile cloud computing is an emerging field that is gaining popularity across borders at a rapid pace. Similarly, the field of health informatics is also considered as an extremely important field. This work observes the collaboration between these two fields to solve the traditional problem of extracting Electrocardiogram signals from trace reports and then performing analysis. The developed system has two front ends, the first dedicated for the user to perform the photographing of the trace report. Once the photographing is complete, mobile computing is used to extract the signal. Once the signal is extracted, it is uploaded into the server and further analysis is performed on the signal in the cloud. Once this is done, the second interface, intended for the use of the physician, can download and view the trace from the cloud. The data is securely held using a password-based authentication method. The system presented here is one of the first attempts at delivering the total solution, and after further upgrades, it will be possible to deploy the system in a commercial *** Codes 68T05 Copyright © 2020, The Authors. All rights reserved.

关键词： Signal analysis

An implementation, empirical evaluation and proposed improvement for bidirectional splitting method for argumentation frameworks under stable semantics

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Wong, Renata Department of Computer Science and Technology Nanjing University Nanjing China State Key Laboratory for Novel Software Technology at Nanjing University Nanjing China

Abstract argumentation frameworks are formal systems that facilitate obtaining conclusions from non-monotonic knowledge systems. Within such a system, an argumentation semantics is defined as a set of arguments with some desired qualities, for example, that the elements are not in conflict with each other. Splitting an argumentation framework can efficiently speed up the computation of argumentation semantics. With respect to stable semantics, two methods have been proposed to split an argumentation framework either in a unidirectional or bidirectional fashion. The advantage of bidirectional splitting is that it is not structure-dependent and, unlike unidirectional splitting, it can be used for frameworks consisting of a single strongly connected component. Bidirectional splitting makes use of a minimum cut. In this paper, we implement and test the performance of the bidirectional splitting method, along with two types of graph cut algorithms. Experimental data suggest that using a minimum cut will not improve the performance of computing stable semantics in most cases. Hence, instead of a minimum cut, we propose to use a balanced cut, where the framework is split into two sub-frameworks of equal size. Experimental results conducted on bidirectional splitting using the balanced cut show a significant improvement in the performance of computing *** Codes 68T30 Copyright © 2018, The Authors. All rights reserved.

关键词： Knowledge representation