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

Proceedings of the 30th International Conference on Parallel architectures and Compilation Techniques

作者： Wanling Gao Fei Tang Jianfeng Zhan Xu Wen Lei Wang Zheng Cao Chuanxin Lan Chunjie Luo Xiaoli Liu Zihan Jiang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences BenchCouncil (International Open Benchmark Council) and University of Chinese Academy of Sciences State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences and University of Chinese Academy of Sciences Alibaba State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences

ISBN: (纸本)9781665442787

Modern real-world application scenarios like Internet services consist of a diversity of AI and non-AI modules with huge code sizes and long and complicated execution paths, which raises serious benchmarking or evaluating challenges. Using AI components or micro benchmarks alone can lead to error-prone conclusions. This paper presents a methodology to attack the above challenge. We formalize a real-world application scenario as a Directed Acyclic Graph-based model and propose the rules to distill it into a permutation of essential AI and non-AI tasks, which we call a scenario benchmark. Together with seventeen industry partners, we extract nine typical scenario benchmarks. We design and implement an extensible, configurable, and flexible benchmark framework. We implement two Internet service AI scenario benchmarks based on the framework as proxies to two real-world application *** consider scenario, component, and micro benchmarks as three indispensable parts for evaluating. Our evaluation shows the advantage of our methodology against using component or micro AI benchmarks alone. The specifications, source code 1, testbed, and results are publicly available from https://***/aibench/scenario/.

关键词： AI

来源：评论

学校读者我要写书评

暂无评论

VmPTP: Precise Time Protocol for Inter-VM Communication in Embedded Virtualized Systems

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2025年第3期44卷 897-910页

作者： Zhao, Sirong Xie, Guoqi Ma, Wenhong Ren, Wei Li, Kenli Hunan University Key Laboratory for Embedded and Network Computing of Hunan Province College of Computer Science and Electronic Engineering Hunan Changsha410082 China Huawei Technology Co. Ltd. Central Software Institute Guangdong Shenzhen518129 China

System virtualization techniques are gradually applied to embedded systems with the performance improvement of embedded devices;however, there is a large time offset (i.e., deviation) of hundreds of ms between virtual machines (VMs) due to the drift of the virtualization abstraction layer and the jitter phenomenon. It is urgent to significantly reduce this offset by time synchronization techniques. Unfortunately, the current mainstream time synchronization software (e.g., Chrony and LinuxPTP) cannot be used in the embedded virtualized system connected by the fieldbus, such as controller area network (CAN);meanwhile, drift correction-based time synchronization techniques dedicated to CAN bus cannot be utilized for virtualized systems. In this study, we design a general vmPTP, which is a precise time protocol (PTP) for inter-VM communication in embedded virtualized systems based on Linux kernel-based VM (KVM). This is the first time synchronization work focused on embedded virtualized systems. We implement two vmPTP versions based on VirtIO and inter-VM shared memory (IVSHMEM) according to the four message (i.e., packet) exchanges of PTP. We propose an asymmetry compensation strategy to solve the problem of asymmetric rate of I/O operations in the message exchange process, which optimizes the offset computation. We further produce a convergence stopping approach which can continuously converge the offset until the offset is within the given bound and stop. We conduct experimental evaluations on both X86-64 and ARM64 architectures. For two versions of vmPTP, the experimental results show that: 1) the offsets are always within 1μ s on two architectures;2) the offsets are less than that of LinuxPTP and Chrony;and 3) the vmPTP's CPU and memory utilization on the X86-64 architecture are merely 0.3% and 0.1%, respectively, whereas those on the ARM64 architecture are 3.8% and 0.1%, respectively. We experiment with vmPTP in real-time application and the result demonstrates th

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

Tetris:A Heuristic Static Memory Management Framework for Uniform Memory Multicore Neural Network Accelerators

引用

Journal of computer Science & technology 2022年第6期37卷 1255-1270页

作者： Xiao-Bing Chen Hao Qi Shao-Hui Peng Yi-Min Zhuang Tian Zhi Yun-Ji Chen Distinguished Member,CCF State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China University of Chinese Academy of Sciences Beijing 100049China School of Computer Science and Technology University of Science and Technology of ChinaHeFei230026China Chinese Academy of Sciences Center for Excellence in Brain Science and Intelligence Technology Shanghai200031China 不详

Uniform memory multicore neural network accelerators(UNNAs)furnish huge computing power to emerging neural network ***,with neural network architectures going deeper and wider,the limited memory capacity has become a constraint to deploy models on UNNA *** how to efficiently manage memory space and how to reduce workload footprints are urgently *** this paper,we propose Tetris:a heuristic static memory management framework for UNNA *** reconstructs execution flows and synchronization relationships among cores to analyze each tensor’s liveness *** the memory management problem is converted to a sequence permutation *** uses a genetic algorithm to explore the permutation space to optimize the memory management strategy and reduce memory *** evaluate several typical neural networks and the experimental results demonstrate that Tetris outperforms the state-of-the-art memory allocation methods,and achieves an average memory reduction ratio of 91.9%and 87.9%for a quad-core and a 16-core Cambricon-X platform,respectively.

关键词： multicore neural network accelerators liveness analysis static memory management memory reuse genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Competition on robust deep learning

引用

National Science Review 2023年第6期10卷 13-15页

作者： Yinpeng Dong Chang Liu Wenzhao Xiang Hang Su Jun Zhu Department of Computer Science and Technology Institute for AI Tsinghua-Bosch Joint ML Center THBI Lab BNRist Center Tsinghua University Institute of Image Communication and Networks Engineering in the Department of Electronic Engineering (EE) Shanghai Jiao Tong University Key Laboratory of Intelligent Information Processing of Chinese Academy of Sciences (CAS) Institute of Computing Technology CAS Peng Cheng Laboratory Pazhou Laboratory (Huangpu)

PROBLEM In recent years,the rapid development of artificial intelligence (AI) technology,especially machine learning and deep learning, is profoundly changing human production and *** various fields,such as robotics,face recognition,autonomous driving and healthcare,AI is playing an important ***,although AI is promoting the technological revolution and industrial progress,its security risks are often *** studies have found that the wellperforming deep learning models are extremely vulnerable to adversarial examples [1-3].The adversarial examples are crafted by applying small,humanimperceptible perturbations to natural examples,but can mislead deep learning models to make wrong *** vulnerability of deep learning models to adversarial examples can raise security and safety threats to various realworld applications.

关键词： robustness adversarial example adversarial training deep learning

来源：评论

学校读者我要写书评

暂无评论

Leveraging Knowledge Distillation for Improved Event Extraction in QA Models 6

Leveraging Knowledge Distillation for Improved Event Extract...

引用

6th International Conference on Frontier Technologies of Information and computer, ICFTIC 2024

作者： Zhou, Peiyao Hu, Zhikui Zi, Kangli Zhang, Dawei School of Computer Science Jiangsu University of Science and Technology Zhenjiang China Institute of Computing Technology Chinese Academy of Sciences Key Laboratory of Intelligent Information Processing Beijing China

ISBN: (纸本)9798331541750

Event extraction is an important task in natural language processing, and it is widely utilized in intelligence domains such as business and military for information extraction. Recently, many works have successfully transformed document-level event extraction into Question-answering (QA) tasks with remarkable results. This approach embeds event argument information within the questions, introducing prior knowledge into the process. Jin et al. highlighted the importance of high-quality QA pairs for practical QA tasks, emphasizing that constructing these pairs remains a key challenge[1]. In this study, we propose a Prompt-based question generation method to automatically generate questions containing event arguments, which converts event extraction into a QA task. We introduce an event ontology-based information retrieval module to enhance answer accuracy and select the most relevant document segments as input text. Additionally, we employ knowledge distillation to build the QA model, transferring knowledge from a large pre-trained model to a more compact and efficient one, improving the student model's performance. Experiments show that our model performs strongly in mainstream benchmarks, with 4.8 improvements on WikiEvents. © 2024 IEEE.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Rail Transit Event Extraction based on the Fusion of Semantic and Local Dependency Features 15

Rail Transit Event Extraction based on the Fusion of Semanti...

引用

15th IEEE International Conference on Knowledge Graph, ICKG 2024

作者： Chen, Qiang Meng, Haining Bao, Yihao Yang, Mingsong Tong, Xinyu Zhao, Qin Khan, Muhammad Bilal Hei, Xinhong Xi'an University of Technology School of Computer Science and Engineering Xi'an China Xi'an University of Technology School of Computer Science and Engineering Shaanxi Key Laboratory of Network Computing and Security Technology Xi'an China Xi'an University of Technology School of Civil Engineering and Architecture Xi'an China

ISBN: (纸本)9798331508821

Event extraction in rail transit plays a vital role in all stages of design, construction, and final acceptance. Event extraction is a key part of building event logic graph (ELG). However, the difficulty in obtaining semantic features and event local dependencies poses a challenge to accurate event extraction, which hinders the informatization and intelligent development of rail transit projects. To address these challenges, we proposes an event extraction method that fuses semantic and local dependency features. The study initially preprocesses the rail transit design codes dataset and performs sequence labeling. Then, the event trigger words are mined by combining the term frequency-inverse document frequency (TF-IDF) and minimum edit distance (MED) algorithms. Based on the semantic similarity measurement method and the trigger word mining results, the features representation of event semantic information is enhanced by using the Bidirectional Encoder Representations from Transformers (BERT) model and Bi-directional Long Short-Term Memory (BiLSTM) model. At the same time, event arguments are mined and a local dependency graph is generated based on their mining results, and then the enhanced local dependency features are obtained by using the graph convolutional network (GCN). Finally, the event semantic features and local dependency features are fused, and the conditional random field (CRF) is used to predict the labels to obtain the event extraction results. Through the comparison with five baseline methods on the datasets of rail transit design codes, it is found that the Precision, Recall, and F1 score of the proposed method are improved, with an average improvement of 9.604% on Precision, 9.342% on Recall, and 9.730% on F1 score, respectively. The contribution of the sub-modules to the overall performance is further evaluated through ablation experiments, which confirms the effectiveness and feasibility of the proposed method. © 2024 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Conditional selection with CNN augmented transformer for multimodal affective analysis

引用

CAAI Transactions on Intelligence technology 2024年第4期9卷 917-931页

作者： Jianwen Wang Shiping Wang Shunxin Xiao Renjie Lin Mianxiong Dong Wenzhong Guo College of Computer and Data Science Fuzhou UniversityFuzhouChina College of Computer and Cyber Security Fujian Normal UniversityFuzhouChina Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhouChina Digital Fujian Institute of Big Data Security Technology Fujian Normal UniversityFuzhouChina Department of Sciences and Informatics Muroran Institute of TechnologyMuroranJapan

Attention mechanism has been a successful method for multimodal affective analysis in recent years. Despite the advances, several significant challenges remain in fusing language and its nonverbal context information. One is to generate sparse attention coefficients associated with acoustic and visual modalities, which helps locate critical emotional se-mantics. The other is fusing complementary cross‐modal representation to construct optimal salient feature combinations of multiple modalities. A Conditional Transformer Fusion Network is proposed to handle these problems. Firstly, the authors equip the transformer module with CNN layers to enhance the detection of subtle signal patterns in nonverbal sequences. Secondly, sentiment words are utilised as context conditions to guide the computation of cross‐modal attention. As a result, the located nonverbal fea-tures are not only salient but also complementary to sentiment words directly. Experi-mental results show that the authors’ method achieves state‐of‐the‐art performance on several multimodal affective analysis datasets.

关键词： affective computing data fusion information fusion multimodal approaches

来源：评论

学校读者我要写书评

暂无评论

CroPrompt: Cross-task Interactive Prompting for Zero-shot Spoken Language Understanding

CroPrompt: Cross-task Interactive Prompting for Zero-shot Sp...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Qin, Libo Wei, Fuxuan Chen, Qiguang Zhou, Jingxuan Huang, Shijue Si, Jiasheng Lu, Wenpeng Che, Wanxiang School of Computer Science and Engineering Central South University China Key Laboratory of Data Intelligence and Advanced Computing in Provincial Universities Soochow University China Research Center for Social Computing and Information Retrieval Harbin Institute of Technology China Harbin Institute of Technology Shenzhen China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

ISBN: (纸本)9798350368741

Slot filling and intent detection are two highly correlated tasks in spoken language understanding (SLU). Recent SLU research attempts to explore zero-shot prompting techniques in large language models to alleviate the data scarcity problem. Nevertheless, the existing prompting work ignores the cross-task interaction information for SLU, which leads to sub-optimal performance. To solve this problem, we present the pioneering work of Cross-task Interactive Prompting (CroPrompt) for SLU, which enables the model to interactively leverage the information exchange across the correlated tasks in SLU. Additionally, we further introduce a multi-task self-consistency mechanism to mitigate the error propagation caused by the intent information injection. We conduct extensive experiments on the standard SLU benchmark and the results reveal that CroPrompt consistently outperforms the existing prompting approaches. In addition, the multi-task self-consistency mechanism can effectively ease the error propagation issue, thereby enhancing the performance. We hope this work can inspire more research on cross-task prompting for SLU. © 2025 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An algorithm/hardware co-optimized method to accelerate CNNs with compressed convolutional weights on FPGA

An algorithm/hardware co-optimized method to accelerate CNNs...

引用

作者： Shang, Jiangwei Zhang, Zhan Zhang, Kun Li, Chuanyou Qian, Lei Liu, Hongwei School of Computer Science and Technology Harbin Institute of Technology Harbin China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China School of Computer Science and Engineering Southeast University Nanjing China

Convolutional neural networks (CNNs) have shown remarkable advantages in a wide range of domains at the expense of huge parameters and computations. Modern CNNs still tend to be more complex and larger to achieve better inference accuracy. However, the complex and large structures of CNNs could slow down the inference speed. Recently, Compressing the convolutional weights to be sparse by pruning the unimportant parameters has been demonstrated as an efficient way to reduce the computations of CNNs. On the other hand, field-programmable gate arrays (FPGAs) have been a popular hardware platform to accelerate CNN inference. In this paper, we propose an algorithm/hardware co-optimized method for accelerating CNN inference on FPGAs. For the algorithm, we take advantage of unstructured and structured parameter sparsifying methods to achieve high sparsity and keep the regularity of convolutional weights. Correspondingly, hardware-friendly index representations of sparse convolutional weights are proposed. For the hardware architecture, we propose row-wise input-stationary dataflow, which is tightly coupled with the algorithm. A row-wise computing engine (RConv Engine) is proposed, which is based on the dataflow. Inside the RConv Engine, the scalar-vector structure is applied to implement the basic processing elements (PEs). To flexibly calculate the feature map with various sizes, the PEs are organized in a 2D structure with two work modes. The experimental results demonstrate that our co-optimized method implements high sparsity of convolutional weights, and the computing engine achieves high computation efficiency. Compared with other accelerators, our co-optimized method implements a 10.9 (Formula presented.) speedup on FPS at most with the highest sparsity of convolutional weights and negligible accuracy loss. © 2024 John Wiley & Sons Ltd.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

Single-cell Curriculum Learning-based Deep Graph Embedding Clustering

Single-cell Curriculum Learning-based Deep Graph Embedding C...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Li, Huifa Fu, Jie Ling, Xinpeng Sun, Zhiyu Wang, Kuncan Chen, Zhili East China Normal University Shanghai Key Laboratory of Trustworthy Computing Shanghai China Stevens Institute of Technology Department of Computer Science Hoboken United States

ISBN: (纸本)9798350386226

The swift advancement of single-cell RNA sequencing (scRNA-seq) technologies enables the investigation of cellular-level tissue heterogeneity. Cell annotation significantly contributes to the extensive downstream analysis of scRNA-seq data. However, The analysis of scRNA-seq for biological inference presents challenges owing to its intricate and indeterminate data distribution, characterized by a substantial volume and a high frequency of dropout events. Furthermore, the quality of training samples varies greatly, and the performance of the popular scRNA-seq data clustering solution GNN could be harmed by two types of low-quality training nodes: 1) nodes on the boundary;2) nodes that contribute little additional information to the graph. To address these problems, we propose a single-cell curriculum learning-based deep graph embedding clustering (scCLG). We first propose a Chebyshev graph convolutional autoencoder with multi-criteria (ChebAE) that combines three optimization objectives, including topology reconstruction loss of cell graphs, zero-inflated negative binomial (ZINB) loss, and clustering loss, to learn cell-cell topology representation. Meanwhile, we employ a selective training strategy to train GNN based on the features and entropy of nodes and prune the difficult nodes based on the difficulty scores to keep the high-quality graph. Empirical results on a variety of gene expression datasets show that our model outperforms state-of-the-art methods. The code of scCLG will be made publicly available at https://***/LFD-byte/scCLG. © 2024 IEEE.

关键词： Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：