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

XGCN:a library for large-scale graph neural network recommendations

Frontiers of Computer Science 2024年第3期18卷 247-249页

作者： Xiran SONG Hong HUANG Jianxun LIAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Microsoft Research Asia Beijing 100080China

1 Introduction Graph Neural Networks(GNNs)have gained widespread adoption in recommendation systems,and nowadays there is a pressing need to effectively manage large-scale graph data[1].When it comes to large graphs,GNNs may encounter the scalability issue stemming from their multi-layer messagepassing ***,scaling GNNs has emerged as a crucial research area in recent years,with numerous scaling strategies being proposed.

关键词： scaling gained operations

来源：评论

学校读者我要写书评

暂无评论

research on large model table question answering method based on thought of chain and vector matching filtering 3

Research on large model table question answering method base...

引用

3rd International Conference on Electronic Information Engineering and data Processing, EIEDP 2024

作者： Tang, Haichao Wang, Licai Hu, Xun Luo, Qibin Big data research and development center North China Institute of Computing Technology Beijing China

ISBN: (纸本)9781510680531

Implementing table-based question answering can fully leverage the rich information in tabular data, and the development of large language models has provided strong natural language processing and understanding capabilities. Current research on table-based question answering with large language models mainly focuses on how to improve text-to-SQL abilities and the development of table pre-training models, lacking in studies on feasible technical approaches for applying general large language models to engineering applications involving large-scale database table question answering. In response, combining techniques such as prompt learning and chain of thought,this paper constructs a database question answering chain of thought based on large language model, proposes a table filtering scheme based on vectorized matching of table structural information, specifically addressing poor table filtering effects, and constructs a database optimization chain of thought in the context of de-identification scenarios. Experimental verification shows that after adopting the chain of thought construction and vector matching filtering scheme, the database question answering capability of the large model has been effectively improved. © 2024 SPIE.

关键词： Information filtering

来源：评论

学校读者我要写书评

暂无评论

Legal Event Detection Model Based on ERNIE 3.0-CRF and Ensemble Learning 5

Legal Event Detection Model Based on ERNIE 3.0-CRF and Ensem...

引用

5th International Seminar on Artificial Intelligence, Networking and Information technology, AINIT 2024

作者： Wang, Siyu Wang, Licai Zhang, Ke North China Institute of Computing Technology Big Data Research and Development Center Beijing China

ISBN: (纸本)9798350385557

Recognizing events is a prerequisite for making judgments, so discovering events in legal documents is important for the analysis of legal case. Legal Event Detection aims to extract legal event trigger words from legal documents and categorize events and is the basis of many judicial AI applications. Oriented to the needs of understanding and analyzing legal events in the judicial trial process, and in response to the low accuracy of event detection caused by the many types of events and little sample data in the legal domain, this paper constructs a pre-training model oriented to event detection in the legal domain, which makes full use of ERNIE 3.0's powerful semantic representation learning capability and CRF's effective modeling capability for sequence annotation tasks. In addition, we further enhance the effectiveness of the model through data augmentation and ensemble learning. The experimental results show that the method works better compared to the baseline model and improves the prediction accuracy of legal event detection. © 2024 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

RIF-Proto: A Few-Shot Relation Extraction for Prototype Networks Based on Relational Information Features 5

RIF-Proto: A Few-Shot Relation Extraction for Prototype Netw...

引用

5th International Seminar on Artificial Intelligence, Networking and Information technology, AINIT 2024

作者： Zhang, Shuai Wang, Licai Huang, Yangchen North China Institute of Computing Technology Big Data Research and Development Center Beijing China

ISBN: (纸本)9798350385557

Relation extraction stands as a core task within the realm of information extraction, focusing on identifying the target relations between entities in text. While traditional relation extraction has been extensively researched, certain relations lack sufficient labeled data, rendering traditional models ineffective in practical research. Hence, the research focus in this field has shifted towards few-shot learning methods that leverage limited labeled data for training. Significant progress has been made in few-shot relation extraction, with prototype networks garnering attention from scholars for their outstanding performance in few-shot tasks. Prototype networks utilize the clustering idea to achieve relationship classification simply and efficiently, and their training process is mainly divided into three parts: generation of relationship prototypes, relationship classification, and loss calculation. The majority of current research is centered around leveraging external information to enhance the generation of prototypes and loss functions, but due to the difficulty of obtaining external data and the high complexity of data processing, it greatly increases the time cost and the difficulty of implementation. Given the aforementioned challenges, this paper introduces a method for prototype refinement leveraging relationship similarity among existing data. This approach aims to effectively address the issue of significant deviations in relationship prototypes. Initially, extract relationship vectors from the instances in both the support set and query set, followed by computing the relationship similarity between samples based on these vectors, and finally, this paper constructs a prototype correction module, which utilizes the relationship similarity to assign weights to the samples in the support set, to achieve the purpose of prototype correction. In the experiments against the standard dataset FewRel1.0., we observe that the method substantially improves the ex

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Large Language Model Based on Full-Text Retrieval for Temporal Knowledge Q&A Approach 5

Large Language Model Based on Full-Text Retrieval for Tempor...

引用

5th International Seminar on Artificial Intelligence, Networking and Information technology, AINIT 2024

作者： Li, Zhidong Wang, Licai Luo, Qibin Qiao, Silong North China Institute of Computing Technology Big Data Research and Development Center Beijing China

ISBN: (纸本)9798350385557

Knowledge Q&A is one of the hot research topics in the field of natural language processing, and temporal knowledge Q&A is a difficult area of Q&A reasoning because it also needs to consider the temporal relationship of knowledge. Today's research usually focuses on the word vector similarity between knowledge and questions as an important basis for answering, while ignoring the sentence granularity semantic information embedded in the knowledge. In this paper, we propose a method of temporal knowledge Q&A for large language models based on full-text retrieval, firstly, the sentence granularity knowledge recall is performed by Elasticsearch so that large language models can learn the knowledge that is highly relevant to the problem, and then verify the temporal knowledge Q&A ability of large language models under Zero-shot, One-shot and Few-shot. The experiments were conducted on the ICEWS05-15 dataset, and the accuracy of answers was significantly improved, demonstrating the effectiveness of the temporal knowledge Q&A method for large language models based on Elasticsearch. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

P3DC:Reducing DRAM Cache Hit Latency by Hybrid Mappings

引用

Journal of Computer Science & technology 2024年第6期39卷 1341-1360页

作者： Ye Chi Ren-Tong Guo Xiao-Fei Liao Hai-Kun Liu Jianhui Yue National Engineering Research Center for Big Data Technology and System Wuhan 430074China Services Computing Technology and System Laboratory Wuhan 430074China Cluster and Grid Computing Laboratory Wuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China School of Big Data and Internet Shenzhen Technology UniversityShenzhen 518118China Department of Computer Science Michigan Technological UniversityHoughton 49931-1295U.S.A.

Die-stacked dynamic random access memory(DRAM)caches are increasingly advocated to bridge the performance gap between the on-chip cache and the main *** fully realize their potential,it is essential to improve DRAM cache hit rate and lower its cache hit *** order to take advantage of the high hit-rate of set-association and the low hit latency of direct-mapping at the same time,we propose a partial direct-mapped die-stacked DRAM cache called *** design is motivated by a key observation,i.e.,applying a unified mapping policy to different types of blocks cannot achieve a high cache hit rate and low hit latency *** address this problem,P3DC classifies data blocks into leading blocks and following blocks,and places them at static positions and dynamic positions,respectively,in a unified set-associative *** also propose a replacement policy to balance the miss penalty and the temporal locality of different *** addition,P3DC provides a policy to mitigate cache thrashing due to block type *** results demonstrate that P3DC can reduce the cache hit latency by 20.5%while achieving a similar cache hit rate compared with typical set-associative caches.P3DC improves the instructions per cycle(IPC)by up to 66%(12%on average)compared with the state-of-the-art direct-mapped cache—BEAR,and by up to 19%(6%on average)compared with the tag-data decoupled set-associative cache—DEC-A8.

关键词： die-stacked dynamic random access memory(DRAM) cache set-associative direct-mapped hit latency

来源：评论

学校读者我要写书评

暂无评论

SAND: semi-automated adaptive network defense via programmable rule generation and deployment

引用

Science China(Information Sciences) 2022年第7期65卷 121-138页

作者： Haoyu CHEN Deqing ZOU Hai JIN Shouhuai XU Bin YUAN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabHubei Engineering Research Center on Big Data Security School of Cyber Science and EngineeringHuazhong University of Science and Technology Department of Computer Science University of Colorado at Colorado Springs

Cyber security is dynamic as defenders often need to adapt their defense postures. The state-ofthe-art is that the adaptation of network defense is done manually(i.e., tedious and error-prone). The ideal solution is to automate adaptive network defense, which is however a difficult problem. As a first step towards automation, we propose investigating how to attain semi-automated adaptive network defense(SAND). We propose an approach extending the architecture of software-defined networking, which is centered on providing defenders with the capability to program the generation and deployment of dynamic defense rules enforced by network defense tools. We present the design and implementation of SAND, as well as the evaluation of the prototype implementation. Experimental results show that SAND can achieve agile and effective dynamic adaptations of defense rules(less than 15 ms on average for each operation), while only incurring a small performance overhead.

关键词： network defense adaptive defense automated defense programmable defense security services software-defined networking security management

来源：评论

学校读者我要写书评

暂无评论

Abnormal Clustering and Cross Slicing Transformer for Insect Fine-Grained Image Classification 2

Abnormal Clustering and Cross Slicing Transformer for Insect...

引用

2nd International Conference on Algorithm, Image Processing and Machine Vision, AIPMV 2024

作者： Mei, Aokun Huo, Hua Big Data and Computing Intelligence Engineering Technology Research Center School of Information Engineering Henan University of Science and Technology Big Data Analysis Laboratory of Henan Medical Luoyang471023 China

ISBN: (纸本)9798350390254

Insect fine-grained image classification is an application scenario in fine-grained image classification. It not only has the characteristics of small inter-class differences and large intra-class differences, but also has the difficulty that some categories have multiple life-stage forms, which makes the general fine-grained image classification model difficult to play a role in insect scenes. To this end, based on the Vision Transformer, we design a fine-grained classification network for insect images based on abnormal clustering and cross slicing, called ACCS-Trans. In the first stage of the model, we use segmentation and clustering operations to distinguish the special morphology of insects in those few-shot life stages. The model can avoid the interference of few-sample abnormal morphology on the class feature extraction of the current class during training. The second stage is the cross slicing module, which uses the anchor box of the image sample segmentation region in the first stage to cut the original sample image to form the main target image, which is used as the information supplement area of the original image. Finally, the image is divided into doubling patch groups by two vertical patch operations. In the third stage, we concatenate the multiplication patch group and input it into the Vision Transformer network for class feature extraction. We fully experiment with ACCS-Trans on two insect image datasets. Compared with the current mainstream fine-grained image classification models, ACCS- Trans achieves state-of-the-art effects on both datasets, and we do ablation experiments for each module. The effect of each module on our ACCS- Trans is analyzed. The excellent performance of our ACCS- Trans in insect scenes is verified in these experiments, these provide new ideas for the task of fine-grained classification of insect images. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Evaluating RISC-V Vector Instruction Set Architecture Extension with Computer Vision Workloads

引用

Journal of Computer Science & technology 2023年第4期38卷 807-820页

作者：李若时彭平邵志远金海郑然 National Engineering Research Center for Big Data Technology and System Huazhong University of Science and Technology Wuhan 430074China Services Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074 China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

Computer vision(CV)algorithms have been extensively used for a myriad of applications *** the multimedia data are generally well-formatted and regular,it is beneficial to leverage the massive parallel processing power of the underlying platform to improve the performances of CV *** Instruction Multiple data(SIMD)instructions,capable of conducting the same operation on multiple data items in a single instruction,are extensively employed to improve the efficiency of CV *** this paper,we evaluate the power and effectiveness of RISC-V vector extension(RV-V)on typical CV algorithms,such as Gray Scale,Mean Filter,and Edge *** our examinations,we show that compared with the baseline OpenCV implementation using scalar instructions,the equivalent implementations using the RV-V(version 0.8)can reduce the instruction count of the same CV algorithm up to 24x,when processing the same input ***,the actual performances improvement measured by the cycle counts is highly related with the specific implementation of the underlying RV-V *** our evaluation,by using the vector co-processor(with eight execution lanes)of Xuantie C906,vector-version CV algorithms averagely exhibit up to 2.98x performances speedups compared with their scalar counterparts.

关键词： RISC-V vector extension single instruction multiple data(SIMD) computer vision OpenCV

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：