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

arXiv 2024年

作者： Li, Xin Yuan, Kun Pei, Yajing Lu, Yiting Sun, Ming Zhou, Chao Chen, Zhibo Timofte, Radu Sun, Wei Wu, Haoning Zhang, Zicheng Jia, Jun Zhang, Zhichao Cao, Linhan Chen, Qiubo Min, Xiongkuo Lin, Weisi Zhai, Guangtao Sun, JianHui Wang, Tianyi Li, Lei Kong, Han Wang, Wenxuan Li, Bing Luo, Cheng Wang, Haiqiang Chen, Xiangguang Meng, Wenhui Pan, Xiang Shi, Huiying Zhu, Han Xu, Xiaozhong Sun, Lei Chen, Zhenzhong Liu, Shan Kong, Fangyuan Fan, Haotian Xu, Yifang Xu, Haoran Yang, Mengduo Zhou, Jie Li, Jiaze Wen, Shijie Xu, Mai Li, Da Yao, Shunyu Du, Jiazhi Zuo, Wangmeng Li, Zhibo He, Shuai Ming, Anlong Fu, Huiyuan Ma, Huadong Wu, Yong Xue, Fie Zhao, Guozhi Du, Lina Guo, Jie Zhang, Yu Zheng, Huimin Chen, Junhao Liu, Yue Zhou, Dulan Xu, Kele Xu, Qisheng Sun, Tao Ding, Zhixiang Hu, Yuhang University of Science and Technology of China China Kuaishou Technology China University of Würzburg Germany Shanghai Jiao Tong University China Nanyang Technological University Singapore Xiaohongshu China WeChat China Tencent China Wuhan University China ByteDance Shenzhen China Zhejiang University China Department of Electronic and Information Engineering Beihang University Beijing China Southern University of Science and Technology China Harbin Institute of Technology China Beijing University of Posts and Telecommunications China China Merchants Bank China Shandong Jianzhu University China Key Laboratory for Parallel and Distributed Processing Changsha China Institute of Automation CAS China University of Chinese Academy of Sciences China

This paper reviews the NTIRE 2024 Challenge on Short-form UGC Video Quality Assessment (S-UGC VQA), where various excellent solutions are submitted and evaluated on the collected dataset KVQ from popular short-form video platform, i.e., Kuaishou/Kwai Platform. The KVQ database is divided into three parts, including 2926 videos for training, 420 videos for validation, and 854 videos for testing. The purpose is to build new benchmarks and advance the development of S-UGC VQA. The competition had 200 participants and 13 teams submitted valid solutions for the final testing phase. The proposed solutions achieved state-of-the-art performances for S-UGC VQA. The project can be found at https://***/lixinustc/KVQ-Challenge-CVPR-NTIRE2024. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MilKBQA: A Complex Knowledge Base Question Answering Dataset on Chinese Military Field

MilKBQA: A Complex Knowledge Base Question Answering Dataset...

引用

IEEE International Conference on Data science in Cyberspace (DSC)

作者： Pike Xu Tiejun Li Zhen Huang Min Guo Jiezhong He Ding Sun Institute of Computer National University of Defense Technology Changsha China Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665418164

Facts in military field tend to involve elements of time, space, quantity, status, and so on. Existing methods of representing knowledge in the form of triples fail to adequately express these facts, and also cause obstacles to knowledge storage and updating. Furthermore, question answering on these facts introduces new complexity dimension, which are complicated to be supported by existing corpus. Thus, we construct a Chinese knowledge base for military field covering entities and events centric knowledge, referred as MilKB. It consists of 965 entities and 3,017 facts. Moreover, we classify the natural questions into 26 types and construct a complex question answering dataset derived from MilKB, referred as MilKBQA. It consists of 2,829 question-answer pairs, in which 600 are event-centric ones. Experiments with three recent strong baseline models demonstrate that MilKBQA requires further research.

关键词： Triples (Data structure) Conferences Knowledge based systems Cyberspace Knowledge representation Data science Cognition

来源：评论

学校读者我要写书评

暂无评论

Multi-task Pre-training Language Model for Semantic Network Completion

arXiv

引用

arXiv 2022年

作者： Li, Da Yang, Sen Xu, Kele Yi, Ming He, Yukai Wang, Huaimin Tencent Beijing100084 China Beijing Institute of Microbiology and Epidemiology Beijing100071 China State Key Laboratory of Pathogen and Biosecurity Beijing100071 China National University of Defense Technology Changsha410073 China National Key Lab of Parallel and Distributed Processing Changsha410073 China

Semantic networks, such as the knowledge graph, can represent the knowledge leveraging the graph structure. Although the knowledge graph shows promising values in natural language processing, it suffers from incompleteness. This paper focuses on knowledge graph completion by predicting linkage between entities, which is a fundamental yet critical task. Semantic matching is a potential solution for link prediction as it can deal with unseen entities, while the translational distance based methods struggle with the unseen entities. However, to achieve competitive performance as translational distance based methods, semantic matching based methods require large-scale datasets for the training purpose, which are typically unavailable in practical settings. Therefore, we employ the language model and introduce a novel knowledge graph architecture named LP-BERT, which contains two main stages: multi-task pre-training and knowledge graph fine-tuning. In the pre-training phase, three tasks are taken to drive the model to learn the relationship information from triples by predicting either entities or relations. While in the fine-tuning phase, inspired by contrastive learning, we design a triple-style negative sampling in a batch, which greatly increases the proportion of negative sampling while keeping the training time almost unchanged. Furthermore, we propose a new data augmentation method utilizing the inverse relationship of triples to improve the performance and robustness of the model. To demonstrate the effectiveness of our proposed framework, we conduct extensive experiments on three widely-used knowledge graph datasets, WN18RR, FB15k-237, and UMLS. The experimental results demonstrate the superiority of our methods, and our approach achieves state-of-the-art results on the WN18RR and FB15k-237 datasets. Significantly, the Hits@10 indicator is improved by 5% from the previous state-of-the-art result on the WN18RR dataset while reaching 100% on the UMLS dataset. Copy

关键词： Inverse problems

来源：评论

学校读者我要写书评

暂无评论

DFTracker: detecting double-fetch bugs by multi-taint parallel tracking

引用

Frontiers of Computer science 2019年第2期13卷 247-263页

作者： Pengfei WANG Kai LU Gen LI Xu ZHOU Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China College of Computer National University of Defense Technology Changsha 410073 China Collaborative Innovation Center of High Performance Computing National University of Defense Technology Changsha 410073 China

A race condition is a common trigger for concurrency bugs. As a special case, a race condition can also occur across the kernel and user space causing a doublefetch bug, which is a field that has received little research attention. In our work, we first analyzed real-world doublefetch bug cases and extracted two specific patterns for doublefetch bugs. Based on these patter ns, we proposed an approach of multi-taint parallel tracking to detect double-fetch bugs. We also implemented a prototype called DFTracker (doublefetch bug tracker), and we evaluated it with our test suite. Our experiments demonstrated that it could effectively find all the double-fetch bugs in the test suite including eight realworld cases with no false negatives and minor false positives. In addition, we tested it on Linux kernel and found a new double-fetch bug. The execution overhead is approximately 2x for single-file cases and approximately 9x for the whole kernel test, which is acceptable. To the best of the authors1 knowledge, this work is the first to introduce multi-taint parallel tracking to double-fetch bug detection—an innovative method that is specific to double-fetch bug features—and has better path coverage as well as lower runtime overhead than the widely used dynamic approaches.

关键词： multi-taint parallel tracking double fetch race condition between kernel and user time of check to time of use real-world case analysis Clang Static Analyzer

来源：评论

学校读者我要写书评

暂无评论

A distributed class-incremental learning method based on neural network parameter fusion 21

A distributed class-incremental learning method based on neu...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data science and Systems, HPCC/SmartCity/DSS 2019

作者： Guan, Hongtao Wang, Yijie Ma, Xingkong Li, Yongmou National Laboratory for Parallel and Distributed Processing College of Computer Science and Technology National University of Defense Technology Changsha Hunan China

ISBN: (纸本)9781728120584

Class-incremental learning has received considerable attention due to the better adaptability to constantly changing characteristic of online learning. The neural network is suitable for class-incremental learning because of batch training style and fine-tuning. However, as the rapid growth of data centers and data category, data isolated island problem presents a new challenge to the current machine learning model: how to provide an accurate training method in a distributed and incremental manner. Existing solutions cannot adapt to incremental classes without aggregating data. In this paper, we propose a distributed class-incremental learning framework, called DCIL, which iteratively updates new class parameters and fixes existing class parameters to achieve high training accuracy. Especially, we propose MF, a parameter fusion method to integrate the parameters of multi-nodes into a new global parameter. In order to match the requirements of identical columns corresponding to the known classes, we propose a single node class-incremental learning, called SCIL. To evaluate the performance of DCIL, we conduct experiments on 5 datasets under various parameter settings on both 2 and 4 nodes distributed scenarios. Extensive experiments confirm that DCIL outperform the general baselines and achieve classification accuracy closes to the method of data aggregating. © 2019 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Towards Precise End-to-end Semi-Supervised Human Head Detection Network

Towards Precise End-to-end Semi-Supervised Human Head Detect...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Rongchun Li Junjie Zhang Yuntao Liu Yong Dou National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (数字)9781728169262

ISBN: (纸本)9781728169279

Head detection, as a fundamental task in practice for many head-related problems, requires an enormous number of annotated boxes to maintain the performance. To alleviate the time and cost of labeling each image in the dataset, we propose an end-to-end semi-supervised head detection frame-work, which shows competitive results with only a small set of data. Specifically, under the setting of semi-supervised, we introduce a weak boxes generate branch and a weak boxes refine branch to produce pseudo ground truth label for unlabeled images with the guidance of annotated images. The weak boxes generate branch is embedded in the detection framework taking the proposals as input and outputting the initial weak boxes that coarsely locate the place of the head. Then, the weak boxes refine branch adjusts the weak boxes more accurate gradually by training a transferred sub-network with the established relation between proposals, weak boxes and labeled boxes. In the training process, we jointly train the two branches in an end-to-end manner, which can generate better pseudo bounding boxes with a small dataset online to avoid over-fitting and obtain a more precise head detector. The results on the public head detection benchmark Brainwash and SCUT-HEAD show the effectiveness of our method.

关键词： Head Proposals Training Detectors Object detection Feature extraction Task analysis

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for Highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yanlong Qiu Siqi Wang Xi Yang Xinyuan Qiu Chengkun Wu Yingbo Cui Canqun Yang Institute for Quantum Information & State Key Laboratory of High-Performance Computing College of Computer Science National University of Defense Technology Changsha P. R. China National Supercomputer Center in Tianjin Tianjin P. R. China National Key Laboratory of Parallel and Distributed Computing College of Computer Science National University of Defense Technology Changsha P. R. China Department of Biology and Chemistry College of Science National University of Defense Technology Changsha P. R. China

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Application of Heterogeneous Resonance Integral for Double Heterogeneous System

SSRN

引用

SSRN 2024年

作者： Qin, Shuai Zhang, Qian Wang, Kai Huang, Dong Li, Song Liang, Yuechao Laboratory for Advanced Nuclear Energy Theory and Applications Zhejiang Institute of Modern Physics Department of Physics Zhejiang University Zhejiang Hangzhou310027 China Zhejiang Institute of Modern Physics Department of Physics Zhejiang University Zhejiang Hangzhou310027 China School of Nuclear Science and Technology Xi’an Jiaotong University 28 West Xianning Road Shaanxi Xi’an710049 China College of Nuclear Science and Technology Naval University of Engineering Wuhan China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Hunan Changsha410073 China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Hunan Changsha410073 China

The Double Heterogeneous (DH) system, where fuel particles are randomly dispersed in the non-fissile matrix, is challenging for the reactor physics calculation. The Sanchez-Pomraning method accurately handles the DH system, but integrating it into existing reactor physics code requires code development. This study adopts the Sanchez-Pomraning coupled Ultra-Fine-Group (SP-UFG) slowing-down calculation to generate the heterogeneous Resonance Integral (RI) for DH system treatment with simple volume homogenization. Fully Ceramic Micro-encapsulated (FCM) fuel pin-cells and plates with varying configurations are calculated for verification. Effective cross-sections (XSs) and keff calculated by the heterogeneous RI are compared with SP-UFG results. Results show that the maximum bias of XSs and keff caused by the XS biases are less than 5% and 200 pcm, respectively. The maximum bias of keff when compared with Monte Carlo calculated results is -213 pcm, demonstrating that only considering the DH effect in the resonance energy region is acceptable. © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Clustering-preserving Network Flow Sketching

Clustering-preserving Network Flow Sketching

引用

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

作者： Yongquan Fu Dongsheng Li Siqi Shen Yiming Zhang Kai Chen Science and Technology Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology SING Lab Hong Kong University of Science and Technology

ISBN: (数字)9781728164120

ISBN: (纸本)9781728164137

Network monitoring is vital in modern clouds and data center networks that need diverse traffic statistics ranging from flow size distributions to heavy hitters. To cope with increasing network rates and massive traffic volumes, sketch based approximate measurement has been extensively studied to trade the accuracy for memory and computation cost, which unfortunately, is sensitive to hash *** paper presents a clustering-preserving sketch method to be resilient to hash collisions. We provide an equivalence analysis of the sketch in terms of the K-means clustering. Based on the analysis result, we cluster similar network flows to the same bucket array to reduce the estimation variance and use the average to obtain unbiased estimation. Testbed shows that the framework adapts to line rates and provides accurate query results. Real-world trace-driven simulations show that LSS remains stable performance under wide ranges of parameters and dramatically outperforms state-of-the-art sketching structures, with over 10 3 to 10 5 times reduction in relative errors for per-flow queries as the ratio of the number of buckets to the number of network flows reduces from 10% to 0.1%.

关键词： Monitoring Arrays Estimation error Adaptation models Approximation error Data centers

来源：评论

学校读者我要写书评

暂无评论

Using Configuration Semantic Features and Machine Learning Algorithms to Predict Build Result in Cloud-Based Container Environment

Using Configuration Semantic Features and Machine Learning A...

引用

International Conference on parallel and distributed Systems (ICPADS)

作者： Yiwen Wu Yang Zhang Junsheng Chang Bo Ding Tao Wang Huaimin Wang Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology China

ISBN: (数字)9781728190747

ISBN: (纸本)9781728183824

Container technologies are being widely used in large scale production cloud environments, of which Docker has become the de-facto industry standard. In practice, Docker builds often break, and a large amount of efforts are put into troubleshooting broken builds. Prior studies have evaluated the rate at which builds in large organizations fail. However, there is still a lack of early warning methods for predicting the Docker build result before the build starts. This paper provides a first attempt to propose an automatic method named PDBR. It aims to use the configuration semantic features extracted by AST and the machine learning algorithms to predict build result in the cloud-based container environment. The evaluation experiments based on more than 36,000 collected Docker builds show that PDBR achieves 73.45%-91.92% in F1 and 29.72%-72.16% in AUC. We also demonstrate that different ML classifiers have significant and large effects on the PDBR AUC performance.

关键词： Machine learning algorithms Semantics Standards organizations Production Organizations Containers Feature extraction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：