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

Resource abstraction and data placement for distributed hybrid memory pool

Frontiers of Computer Science 2021年第3期15卷 47-57页

作者： Tingting CHEN Haikun LIU Xiaofei LIAO Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Gluster and Grid Computing LabSchool of Gomputing Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Emerging byte-addressable non-volatile memory(NVM)technologies offer higher density and lower cost than DRAM,at the expense of lower performance and limited write *** have been many studies on hybrid NVM/DRAM memory management in a single physical ***,it is still an open problem on how to manage hybrid memories efficiently in a distributed *** paper proposes Alloy,a memory resource abstraction and data placement strategy for an RDMA-enabled distributed hybrid memory pool(DHMP).Alloy provides simple APIs for applications to utilize DRAM or NVM resource in the DHMP,without being aware of the hardware details of the *** propose a hotness-aware data placement scheme,which combines hot data migration,data replication and write merging together to improve application performance and reduce the cost of *** evaluate Alloy with several micro-benchmark workloads and public benchmark *** results show that Alloy can significantly reduce the DRAM usage in the DHMP by up to 95%,while reducing the total memory access time by up to 57%compared with the state-of-the-art approaches.

关键词： load balance distributed hybrid memory clouds

来源：评论

学校读者我要写书评

暂无评论

RAUIE: A Relation-Augmented Document-Level Event Extraction Model Based on UIE 5

RAUIE: A Relation-Augmented Document-Level Event Extraction ...

引用

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

作者： Liang, Yiyuan Jia, Hong Wang, Licai Huang, Yangchen Yang, Zhe Big Data Research and Development Center North China Institute of Computing Technology Beijing China Tsinghua University Department of Computer Science and Technology Beijing China The Chinese University of Hong Kong Department of Computer Science and Engineering Hong Kong

ISBN: (纸本)9798350385557

In document-level event extraction tasks, multiple event types often coexist within a document (the multi-event problem), and arguments may play different roles across different events (the argument intertwining problem). Existing methods often suffer from significantly reduced event extraction accuracy, mainly when focusing on scenarios with scarce annotated data and imbalanced event-type distributions. This paper emphasizes enhancing the correlation between event triggers and arguments to address these challenges. Therefore, we propose the Relation-Augmented UIE Model (RADIE), which introduces entity relationships into prompts using prompt-based learning and designs a relation-augmentation algorithm to improve the accuracy and completeness of event extraction. Experimental results demonstrate that this approach significantly outperforms baseline methods, mainly showcasing excellent performance on datasets with long-tail distributions. © 2024 IEEE.

关键词： document-level event extraction relation augment Universal Information Extraction

来源：评论

学校读者我要写书评

暂无评论

Efficient Modeling Attack on Multiplexer PUFs via Kronecker Matrix Multiplication

引用

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 2025年

作者： Wang, Hongfei Wan, Caixue Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China

The Physical Unclonable Function (PUF) is valued for its lightweight nature and unique functionality, making it a common choice for securing hardware products requiring authentication and key generation mechanisms. In response to the susceptibility of individual PUFs to modeling attacks, advanced PUF variants have been developed to improve security measures. One notable type in this regard is the multiplexer-based composition of arbiter PUFs, known as MPUF, which aims to meet high reliability and security standards simultaneously. Current research on attacking MPUF encounters challenges such as substantial demands for training CRPs and low success rates. In this work, we propose a novel numerical modeling attack strategy for MPUFs. Using Kronecker products from mathematical perspective, this method precisely describe the MPUF model without using complex network architectures, boosting attack accuracy and overall efficiency. Experiment comparison with state-of-the-art works demonstrates that our method achieves better performance in terms of attack accuracy, robustness, and efficiency. Our method is able to successfully attack a (512, 8)-MPUF in 32.71 minutes with 97.14% accuracy, outperforming all existing attack methods on MPUFs. More, we validate our method through experiments with hardware implementations on FPGAs. The advantages of our method also include the adaptability to be employed to attack other MPUF variations like cMPUF and rMPUF, and the capability to be integrated with an existing attack method for launching efficient attack on MPUFs leveraging reliability information. © 2025 IEEE.

关键词： modeling attack multiplexer-based PUF Physical unclonable function

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Artificial Intelligence, Networking and Information technology (AINIT), International Seminar on

作者： Siyu Wang Licai Wang Ke Zhang Big data research and development center North China Institute of Computing Technology Beijing China

ISBN: (数字)9798350385557

ISBN: (纸本)9798350385564

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.

关键词： Seminars Analytical models Accuracy Law Event detection Predictive models data models

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Artificial Intelligence, Networking and Information technology (AINIT), International Seminar on

作者： Zhidong Li Licai Wang Qibin Luo Silong Qiao Big data research and development center North China Institute of Computing Technology Beijing China

ISBN: (数字)9798350385557

ISBN: (纸本)9798350385564

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.

关键词： Seminars Knowledge engineering Accuracy Large language models Semantics Knowledge graphs Vectors

来源：评论

学校读者我要写书评

暂无评论

An Efficient Graph Accelerator with Distributed On-Chip Memory Hierarchy 22nd

An Efficient Graph Accelerator with Distributed On-Chip Mem...

引用

22nd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2022

作者： Zheng, Ran Jiang, Yingxin Wang, Yibo Su, Yongbo Zheng, Long Yao, Pengcheng Liao, Xiaofei Jin, Hai National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China

ISBN: (纸本)9783031226762

Graph processing has evolved and expanded swiftly with artificial intelligence and big data technology. High-Bandwidth Memory (HBM), which delivers terabyte-level memory bandwidth, has opened up new development possibilities for FPGA-based graph accelerators. However, despite the tremendous expansion of underlying hardware capabilities, existing graph accelerators have not benefited too much. In this paper, we observe that the uniformed on-chip memory hierarchy is the key to the low scalability of existing graph accelerators. We present a novel graph accelerator with a distributed on-chip memory hierarchy called GraphS. The on-chip memory of GraphS is divided into numerous tiny blocks, each of which is assigned to only one Processing Element (PE). Different PEs are connected through a scalable network-on-chip (NoC). For realistic graphs with power-law properties, a degree-aware preprocessing method is designed to balance the workload among different PEs. Our results with various graph algorithms demonstrate that GraphS can outperform state-of-the-art ForeGraph by up to 21.84 ×. © 2023, Springer Nature Switzerland AG.

关键词： Network-on-chip

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

Artificial Intelligence, Networking and Information technology (AINIT), International Seminar on

作者： Shuai Zhang Licai Wang Yangchen Huang Big data research and development center North China Institute of Computing Technology Beijing China

ISBN: (数字)9798350385557

ISBN: (纸本)9798350385564

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

关键词： Training Seminars Semantics Prototypes Feature extraction Rendering (computer graphics) Vectors

来源：评论

学校读者我要写书评

暂无评论

ES-Mask: Evolutionary Strip Mask for Explaining Time Series Prediction 37

ES-Mask: Evolutionary Strip Mask for Explaining Time Series ...

引用

37th AAAI Conference on Artificial Intelligence, AAAI 2023

作者： Sun, Yifei Song, Cheng Lu, Feng Li, Wei Jin, Hai Zomaya, Albert Y. National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Centre for Distributed and High Performance Computing School of Computer Science University of Sydney Australia

ISBN: (纸本)9781577358800

Machine learning models are increasingly used in time series prediction with promising results. The model explanation of time series prediction falls behind the model development and makes less sense to users in understanding model decisions. This paper proposes ES-Mask, a post-hoc and model-agnostic evolutionary strip mask-based saliency approach for time series applications. ES-Mask designs the mask consisting of strips with the same salient value in consecutive time steps to produce binary and sustained feature importance scores over time for easy understanding and interpretation of time series. ES-Mask uses an evolutionary algorithm to search for the optimal mask by manipulating strips in rounds, thus is agnostic to models by involving no internal model states in the search. The initial experiments on MIMIC-III data set show that ES-Mask outperforms state-of-the-art methods. Copyright © 2023, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

A Novel 3D Medical Image Segmentation Model Using Improved SAM

A Novel 3D Medical Image Segmentation Model Using Improved S...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Kuang, Yuansen Ma, Xitong Zhao, Jing Wang, Guangchen Zeng, Yijie Liu, Song Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

3D medical image segmentation is an essential task in the medical image field, which aims to segment organs or tumours into different labels. A number of issues exist with the current 3D medical image segmentation task: existing models cannot simultaneously obtain the space correlation and depth correlation of 3D slices;previous models suffer from local detail loss of positional embedding in 3D images;previous approaches often have blurring of boundaries in segmenting 3D images. To solve these shortcomings, we propose a 3D medical image segmentation model named TPM-SAM. In our model, we design a twinchannel image encoder to simultaneously capture the space correlation and depth correlation of 3D slices through a multi-head attention mechanism and improved adapters. Furthermore, we design a prompt encoding generator, which divides the volumetric image into small blocks and better captures the local detail information. In addition, we introduce a multi-layer aggregation decoder by employing U-Net with multi-level skip connection to solve the blurring of boundaries in processing 3D images. Finally, we experimented and evaluated our model on KiTS21 and LiTS17 datasets to compare with other baseline models. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

RAGRAPH: A General Retrieval-Augmented Graph Learning Framework 38

RAGRAPH: A General Retrieval-Augmented Graph Learning Framew...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Jiang, Xinke Qiu, Rihong Xu, Yongxin Zhang, Wentao Zhu, Yichen Zhang, Ruizhe Fang, Yuchen Chu, Xu Zhao, Junfeng Wang, Yasha School of Computer Science Peking University China University of Electronic Science and Technology of China China Center on Frontiers of Computing Studies Peking University Beijing China Big Data Technology Research Center Nanhu Laboratory Jiaxing China Peking University Information Technology Institute Binhai Tianjin China

Graph Neural Networks (GNNs) have become essential in interpreting relational data across various domains, yet, they often struggle to generalize to unseen graph data that differs markedly from training instances. In this paper, we introduce a novel framework called General Retrieval-Augmented Graph Learning (RAGRAPH), which brings external graph data into the general graph foundation model to improve model generalization on unseen scenarios. On the top of our framework is a toy graph vector library that we established, which captures key attributes, such as features and task-specific label information. During inference, the RAGRAPH adeptly retrieves similar toy graphs based on key similarities in downstream tasks, integrating the retrieved data to enrich the learning context via the message-passing prompting mechanism. Our extensive experimental evaluations demonstrate that RAGRAPH significantly outperforms state-of-the-art graph learning methods in multiple tasks such as node classification, link prediction, and graph classification across both dynamic and static datasets. Furthermore, extensive testing confirms that RAGRAPH consistently maintains high performance without the need for task-specific fine-tuning, highlighting its adaptability, robustness, and broad applicability. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：