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

Adversarial Learning for Distant Supervised Relation Extraction

Computers, Materials & Continua 2018年第4期55卷 121-136页

作者： Daojian Zeng Yuan Dai Feng Li R.Simon Sherratt Jin Wang Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation School of Computer&Communication EngineeringChangsha University of Science&TechnologyChangsha410114P.R.China Department of Biomedical Engineering University of ReadingUK. School of Computer&Communication Engineering Changsha University of Science&TechnologyChangsha410114P.R.China.

Recently,many researchers have concentrated on using neural networks to learn features for Distant Supervised Relation Extraction(DSRE).These approaches generally use a softmax classifier with cross-entropy loss,which inevitably brings the noise of artificial class NA into classification *** address the shortcoming,the classifier with ranking loss is employed to *** randomly selecting a relation or heuristically selecting the highest score among all incorrect relations are two common methods for generating a negative class in the ranking loss ***,the majority of the generated negative class can be easily discriminated from positive class and will contribute little towards the *** by Generative Adversarial Networks(GANs),we use a neural network as the negative class generator to assist the training of our desired model,which acts as the discriminator in *** the alternating optimization of generator and discriminator,the generator is learning to produce more and more discriminable negative classes and the discriminator has to become better as *** framework is independent of the concrete form of generator and *** this paper,we use a two layers fully-connected neural network as the generator and the Piecewise Convolutional Neural Networks(PCNNs)as the *** results show that our proposed GAN-based method is effective and performs better than state-of-the-art methods.

关键词： Relation extraction generative adversarial networks distant supervision piecewise convolutional neural networks pair-wise ranking loss

来源：评论

学校读者我要写书评

暂无评论

Automatic Knowledge Graph Construction: A Report on the 2019 ICDM/ICBK Contest

Automatic Knowledge Graph Construction: A Report on the 2019...

引用

IEEE International Conference on data Mining (ICDM)

作者： Xindong Wu Jia Wu Xiaoyi Fu Jiachen Li Peng Zhou Xu Jiang Mininglamp Academy of Sciences Mininglamp Technology Beijing China Key Laboratory of Knowledge Engineering with Big Data (Hefei Univ. of Technology) Ministry of Education Hefei China Department of Computing Macquarie University Sydney Australia School of Computer Science and Technology Anhui University Hefei China

Automatic knowledge graph construction seeks to build a knowledge graph from unstructured text in a specific domain or cross multiple domains, without human intervention. IEEE ICDM 2019 and ICBK 2019 invited teams from both degree-granting institutions and industrial labs to compete in the 2019 Knowledge Graph Contest by automatically constructing knowledge graphs in at least two different domains. This article reports the outcomes of the Contest. The participants were expected to build a model to extract knowledge represented as triplets from text data and develop a web application to visualize the triplets. Awards were given to five teams. Their models and key techniques used to construct knowledge graphs are summarized.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Schema-driven performance evaluation for highly concurrent scenarios 23rd

Schema-driven performance evaluation for highly concurrent s...

引用

23rd International Conference on database Systems for Advanced Applications, DASFAA 2018

作者： Zhang, Jingwei Feng, Li Yang, Qing Lin, Yuming Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangxi Key Laboratory of Automatic Measurement Technology and Instrument Guilin University of Electronic Technology Guilin541004 China

ISBN: (纸本)9783319914541

Online applications needs to support highly concurrent access and to response to users as soon as possible. Two primary factors make the above requirements to be a technical challenge, one is the large user base, the other is the sharp rise in traffic caused by some specific activities, such as ticketing on *** during Spring Festival season, shopping on *** during its dual 11 promotions, etc. For the latter, a core focus is how to expand the performance of those existing hardware and software and then to ensure the quality of services when a sharp rise on access happened. Since database schemas have a direct link with data access granularity, etc., this paper considers database schemas as an important factor for performance optimization on highly concurrent access and also covers other elements affecting access performance, such as cache, concurrency, etc., to analyze the performance factors for databases. Extensive experiments are designed to conduct both performance testing and analyzing under different schemas. The experimental results show that a reasonable configuration can contribute a good database performance, which provides factual basis for optimizing highly concurrent applications. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： database systems

来源：评论

学校读者我要写书评

暂无评论

Insight-HXMT and GECAM-C observations of the brightest-of-all-time GRB 221009A

arXiv

引用

arXiv 2023年

作者： An, Zheng-Hua Antier, S. Bi, Xing-Zi Bu, Qing-Cui Cai, Ce Cao, Xue-Lei Camisasca, Anna-Elisa Chang, Zhi Chen, Gang Chen, Li Chen, Tian-Xiang Chen, Wen Chen, Yi-Bao Chen, Yong Chen, Yu-Peng Coughlin, Michael W. Cui, Wei-Wei Dai, Zi-Gao Hussenot-Desenonges, T. Du, Yan-Qi Du, Yuan-Yuan Du, Yun-Fei Fan, Cheng-Cheng Frontera, Filippo Gao, He Gao, Min Ge, Ming-Yu Gong, Ke Gu, Yu-Dong Guan, Ju Guo, Dong-Ya Guo, Zhi-Wei Guidorzi, Cristiano Han, Da-Wei He, Jian-Jian He, Jun-Wang Hou, Dong-Jie Huang, Yue Huo, Jia Ji, Zhen Jia, Shu-Mei Jiang, Wei-Chun Kann, David Alexander Klotz, A. Kong, Ling-Da Lan, Lin Li, An Li, Bing Li, Chao-Yang Li, Cheng-Kui Li, Gang Li, Mao-Shun Li, Ti-Pei Li, Wei Li, Xiao-Bo Li, Xin-Qiao Li, Xu-Fang Li, Yan-Guo Li, Zheng-Wei Liang, Jing Liang, Xiao-Hua Liao, Jin-Yuan Lin, Lin Liu, Cong-Zhan Liu, He-Xin Liu, Hong-Wei Liu, Jia-Cong Liu, Xiao-Jing Liu, Ya-Qing Liu, Yu-Rong Lu, Fang-Jun Lu, Hong Lu, Xue-Feng Luo, Qi Luo, Tao Ma, Bin-Yuan Ma, Fu-Li Ma, Rui-Can Ma, Xiang Maccary, Romain Mao, Ji-Rong Meng, Bin Nie, Jian-Yin Orlandini, Mauro Ou, Ge Peng, Jing-Qiang Peng, Wen-Xi Qiao, Rui Qu, Jin-Lu Ren, Xiao-Qin Shi, Jing-Yan Shi, Qi Song, Li-Ming Song, Xin-Ying Su, Ju Sun, Gong-Xing Sun, Liang Sun, Xi-Lei Tan, Wen-Jun Tan, Ying Tao, Lian Tuo, You-Li Turpin, Damien Wang, Jin-Zhou Wang, Chen Wang, Chen-Wei Wang, Hong-Jun Wang, Hui Wang, Jin Wang, Ling-Jun Wang, Peng-Ju Wang, Ping Wang, Wen-Shuai Wang, Xiang-Yu Wang, Xi-Lu Wang, Yu-Sa Wang, Yue Wen, Xiang-Yang Wu, Bo-Bing Wu, Bai-Yang Wu, Hong Xiao, Sheng-Hui Xiao, Shuo Xiao, Yun-Xiang Xie, Sheng-Lun Xiong, Shao-Lin Xiong, Sen-Lin Xu, Dong Xu, He Xu, Yan-Jun Xu, Yan-Bing Xu, Ying-Chen Xu, Yu-Peng Xue, Wang-Chen Yang, Sheng Yang, Yan-Ji Yang, Zi-Xu Ye, Wen-Tao Yi, Qi-Bin Yi, Shu-Xu Yin, Qian-Qing You, Yuan Yu, Yun-Wei Yu, Wei Yu, Wen-Hui Zeng, Ming Zhang, Bing Zhang, Bin-Bin Zhang, Da-Li Zhang, Fan Zhang, Hong-Mei Zhang, Juan Key Laboratory of Particle Astrophysics Institute of High Energy Physics Chinese Academy of Sciences 19B Yuquan Road Beijing100049 China Institut für Astronomie und Astrophysik Kepler Center for Astro and Particle Physics Eberhard Karls Universität Sand 1 Tübingen72076 Germany College of Physics Hebei Key Laboratory of Photophysics Research and Application Hebei Normal University Hebei Shijiazhuang050024 China Department of Physics and Earth Science University of Ferrara Via Saragat 1 Ferrara44122 Italy Department of Astronomy Beijing Normal University Beijing100875 China CAS Key Laboratory for Research in Galaxies and Cosmology Department of Astronomy University of Science and Technology of China Hefei230026 China Department of Astronomy Tsinghua University Beijing100084 China Southwest Jiaotong University Chengdu610092 China INAF Osservatorio di Astrofisica e Scienza dello Spazio di Bologna Via Piero Gobetti 101 Bologna40129 Italy University of Chinese Academy of Sciences Chinese Academy of Sciences Beijing100049 China College of physics Sciences Technology Hebei University No. 180 Wusi Dong Road Lian Chi District Hebei Baoding071002 China INFN - Sezione di Ferrara Via Saragat 1 Ferrara44122 Italy Physics and Space Science College China West Normal University China Yunnan Observatories Chinese Academy of Sciences Yunnan Province Kunming650011 China Key Laboratory of Space Astronomy and Technology National Astronomical Observatories Chinese Academy of Sciences Beijing100012 China School of Astronomy and Space Science Nanjing University Nanjing210093 China School of Physics and Optoelectronics Xiangtan University Yuhu District Hunan Xiangtan411105 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550001 China Institute of Astrophysics Central China Normal University Wuhan430079 China Nevada Center for Astrophysics Department of Physics and Astronomy University of

GRB 221009A is the brightest gamma-ray burst ever detected since the discovery of this kind of energetic explosions. However, an accurate measurement of the prompt emission properties of this burst is very challenging due to its exceptional brightness. With joint observations of Insight-HXMT and GECAM-C, we made an unprecedentedly accurate measurement of the emission during the first ∼1800 s of GRB 221009A, including its precursor, main emission (ME, which dominates the burst in flux), flaring emission and early afterglow, in the hard X-ray to soft gamma-ray band from ∼ 10 keV to ∼ 6 MeV. Based on the GECAM-C unsaturated data of the ME, we measure a record-breaking isotropic equivalent energy (Eiso) of ∼ 1.5 × 1055 erg, which is about eight times the total rest-mass energy of the Sun. The early afterglow data require a significant jet break between 650 s and 1100 s, most likely at ∼ 950 s from the afterglow starting time TAG, which corresponds to a jet opening angle of ∼ 0.7◦ (ηγn)1/8, where n is the ambient medium density in units of cm−3 and ηγ is the ratio between γ-ray energy and afterglow kinetic energy. The beaming-corrected total γ-ray energy Eγ is ∼ 1.15 × 1051 (ηγn)1/4 erg, which is typical for long GRBs. These results suggest that this GRB may have a special central engine, which could launch and collimate a very narrowly beamed jet with an ordinary energy budget, leading to exceptionally luminous gamma-ray radiation per unit solid angle. Alternatively, more GRBs might have such a narrow and bright beam, which are missed by an unfavorable viewing angle or have been detected without distance measurement. Copyright © 2023, The Authors. All rights reserved.

关键词： Gamma rays

来源：评论

学校读者我要写书评

暂无评论

Time-based trajectory data partitioning for efficient range query 23rd

Time-based trajectory data partitioning for efficient range ...

引用

23rd International Conference on database Systems for Advanced Applications, DASFAA 2018

作者： Yue, Zhongwei Zhang, Jingwei Zhang, Huibing Yang, Qing Guangxi Key Laboratory of Trusted Software Guilin University of Electronic Technology Guilin541004 China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guilin University of Electronic Technology Guilin541004 China Guangxi Key Laboratory of Automatic Measurement Technology and Instrument Guilin University of Electronic Technology Guilin541004 China

ISBN: (纸本)9783319914541

The popularity of mobile terminals has given rise to an extremely large number of trajectories of moving objects. As a result, it is critical to provide effective and efficient query operations on large-scale trajectory data for further retrieval and analysis. Considering data partition has a great influence on processing large-scale data, we present a time-based partitioning technique on trajectory data. This partitioning technique can be applied on the distributed framework to improve the performance of range queries on massive trajectory data. Furthermore, the proposed method adopts time-based hash strategy to ensure both the partition balancing and less partitioning time. Especially, existing trajectory data are not required to be repartitioned when new data arrive. Extensive experiments on three real data sets demonstrated that the performance of the proposed technique outperformed other partitioning techniques. © Springer International Publishing AG, part of Springer Nature 2018.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for ECG Signal Classification via One-Dimensional Convolutional Neural Network

arXiv

引用

arXiv 2020年

作者： Hua, Xuan Han, Jungang Zhao, Chen Tang, Haipeng He, Zhuo Tang, Jinshan Chen, Qing-Hui Tang, Shaojie Zhou, Weihua College of Electronic Engineering Xi’an University of Posts and Telecommunications Xi’an710121 China Key Laboratory of Network Data Analysis and Intelligent Processing in Shaanxi Xi’an710121 China College of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an710121 China College of Computing Michigan Technological University HoughtonMI49931 United States School of Computing University of Southern Mississippi Long Beach39560 United States Deprtment of Kinesiology and Integrative Physiology Michigan Technological University HoughtonMI49931 United States School of Automation Xi’an University of Posts and Telecommunications Xi’an710121 China

This paper presents an end-to-end ECG signal classification method based on a novel segmentation strategy via 1D Convolutional Neural Networks (CNN) to aid the classification of ECG signals. The ECG segmentation strategy named R-R-R strategy (i.e., retaining ECG data between the R peaks just before and after the current R peak) for segmenting the original ECG data into segments in order to train and test the 1D CNN models. The novel strategy mimics physicians in scanning ECG to a greater extent, and maximizes the inherent information of ECG segments. The performance of the classification models for 5-class and 6-class are verified with ECG signals from 48 records of the MIT-BIH arrhythmia database. As the heartbeat types are divided into 5 classes (i.e., normal beat, left bundle branch block beat, right bundle branch block beat, ventricular ectopic beat, and paced beat) in the MIT-BIH, the best classification accuracy, the area under the curve (AUC), the sensitivity and the F1-score reach 99.24%, 0.9994, 0.99 and 0.99, respectively. As the heartbeat types are divided into 6 classes (i.e., normal beat, left bundle branch block beat, right bundle branch block beat, ventricular ectopic beat, paced beat and other beats) in the MIT-BIH, the beat classification accuracy, the AUC, the sensitivity, and the F1-score reach 97.02%, 0.9966, 0.97, and 0.97, respectively. Meanwhile, according to the recommended practice from the Association for Advancement of Medical Instrumentation (AAMI), the heartbeat types are divided into 5 classes (i.e., normal beat, supraventricular ectopic beats, ventricular ectopic beats, fusion beats, and unclassifiable beats), the beat classification accuracy, the sensitivity, and the F1-score reach 97.45%, 0.97, and 0.97, respectively. The experimental results show that the proposed method achieves better performance than the state-of-the-art methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Correction to: New theoretical ISM‑K2 Bayesian network model for evaluating vaccination effectiveness

引用

Journal of Ambient Intelligence and Humanized computing 2022年第10期14卷 14383-14383页

作者： Xie, Xiaoliang Xie, Bingqi Xiong, Dan Hou, Muzhou Zuo, Jinxia Wei, Guo Chevallier, Julien School of Mathematics and Statistics Hunan University of Technology and Busin Ess Changsha China Key Laboratory of Hunan Province for Statistical Learning and Intelligent Computation Hunan University of Technology and Business Changsha China Institute of Big Data and Internet Innovation Hunan University of Technology and Business Changsha China School of Mathematics and Statistics Central South University Changsha China Department of Mathematics and Computer Science University of North Carolina at Pembroke Pembroke USA IPAG Business School (IPAG Lab) Paris France University Paris 8 (LED) Saint-Denis France

来源：评论

学校读者我要写书评

暂无评论

FIMI： A Constant Frugal Incentive Mechanism for Time WindowCoverage in Mobile Crowdsensing

引用

Journal of Computer Science & Technology 2017年第5期32卷 919-935页

作者： Jia Xu Jian-Ren Fu De-Jun Yang Li-Jie Xu Lei Wang Tao Li School of Computer Science Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing 210023 China Department of Computer Science Colorado School of Mines Golden 80401 U.S.A.

Mobile crowdsensing has become an efficient paradigm for performing large-scale sensing tasks. An incentive mechanism is important for a mobile crowdsensing system to stimulate participants and to achieve good service quality. In this paper, we explore truthful incentive mechanisms that focus on minimizing the total payment for a novel scenario, where the platform needs the complete sensing data in a requested time window (RTW). We model this scenario as a reverse auction and design FIMI, a constant frugal incentive mechanism for time window coverage. FIMI consists of two phases, the candidate selection phase and the winner selection phase. In the candidate selection phase, it selects two most competitive disjoint feasible user sets. Afterwards, in the winner selection phase, it finds all the interchangeable user sets through a graph-theoretic approach. For every pair of such user sets, FIMI chooses one of them by the weighted cost. Further, we extend FIMI to the scenario where the RTW needs to be covered more than once. Through both rigorous theoretical analysis and extensive simulations, we demonstrate that the proposed mechanisms achieve the properties of RTW feasibility (or RTW multi-coverage), computation efficiency, individual rationality, truthfulness, and constant frugality.

关键词： crowdsensing incentive mechanism constant frugality

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Control Method for Arterial Signal Coordination Based on Deep Reinforcement Learning*

An Adaptive Control Method for Arterial Signal Coordination ...

引用

International Conference on intelligent Transportation

作者： Peng Chen Zemao Zhu Guangquan Lu Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Hai Dian District Beijing Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University Hai Dian District Beijing

ISBN: (纸本)9781538670255

Traffic signal control is a complex problem and it is difficult to determine an optimal strategy to control multi-directional traffic at multiple intersections. Recent years have witnessed numerous successes of deep learning neural networks in the fields of artificial intelligence. Motivated by the dominant performance of neural networks, this study attempts to develop a novel adaptive signal control approach by fusing deep learning (DL) and reinforcement learning (RL), i.e., deep reinforcement learning (DRL), for arterial signal coordination. DRL can considerably improve the ability to deal with large amounts of data processing, systematic perception and expression, which is key to coordinated control of arterial intersections. The proposed algorithm is implemented by utilizing real-time traffic detection data and aims to optimize the hybrid global and local reward functions. The experimental results obtained by traffic simulation software SUMO demonstrate the advantage of the proposed approach, as well as its efficiency and effectiveness compared with fixed-time and actual signal control methods.

关键词： Aerospace electronics Machine learning Adaptive control Traffic control Roads Optimization

来源：评论

学校读者我要写书评

暂无评论

Advanced Variations of Two-Dimensional Principal Component Analysis for Face Recognition

arXiv

引用

arXiv 2019年

作者： Zhao, Meixiang Jia, Zhigang Cai, Yunfeng Chen, Xiao Gong, Dunwei School of Information and Control Engineering China University of Mining and Technology Xuzhou221116 China School of Mathematics and Statistics Jiangsu Key Laboratory of Education Big Data Science and Engineering Jiangsu Normal University Xuzhou221116 China Cognitive Computing Lab Baidu Research Beijing100193 China

The two-dimensional principal component analysis (2DPCA) has become one of the most powerful tools of artificial intelligent algorithms. In this paper, we review 2DPCA and its variations, and propose a general ridge regression model to extract features from both row and column directions. To enhance the generalization ability of extracted features, a novel relaxed 2DPCA (R2DPCA) is proposed with a new ridge regression model. R2DPCA generates a weighting vector with utilizing the label information, and maximizes a relaxed criterion with applying an optimal algorithm to get the essential features. The R2DPCA-based approaches for face recognition and image reconstruction are also proposed and the selected principle components are weighted to enhance the role of main components. Numerical experiments on well-known standard databases indicate that R2DPCA has high generalization ability and can achieve a higher recognition rate than the state-of-the-art methods, including in the deep learning methods such as CNNs, DBNs, and DNNs. Copyright © 2019, The Authors. All rights reserved.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：