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

A Sharding Scheme Based on Graph Partitioning Algorithm for Public Blockchain

Computer Modeling in Engineering & sciences 2024年第6期139卷 3311-3327页

作者： Shujiang Xu Ziye Wang Lianhai Wang Miodrag J.Mihaljevi′c Shuhui Zhang Wei Shao Qizheng Wang Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science CenterQilu University of Technology(Shandong Academy of Sciences)Jinan250014China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan250014China Mathematical Institute The Serbian Academy of Sciences and ArtsBelgrade11000Serbia

Blockchain technology,with its attributes of decentralization,immutability,and traceability,has emerged as a powerful catalyst for enhancing traditional industries in terms of optimizing business ***,transaction performance and scalability has become the main challenges hindering the widespread adoption of *** to its inability to meet the demands of high-frequency trading,blockchain cannot be adopted in many *** improve the transaction capacity,researchers have proposed some on-chain scaling technologies,including lightning networks,directed acyclic graph technology,state channels,and shardingmechanisms,inwhich sharding emerges as a potential scaling ***,excessive cross-shard transactions and uneven shard workloads prevent the sharding mechanism from achieving the expected *** paper proposes a graphbased sharding scheme for public blockchain to efficiently balance the transaction *** crossshard transactions and evening-out workloads among shards,the scheme reduces transaction confirmation latency and enhances the transaction capacity of the ***,the scheme can achieve a high-frequency transaction as well as a better blockchain *** results show that the scheme effectively reduces the cross-shard transaction ratio to a range of 35%-56%and significantly decreases the transaction confirmation latency to 6 s in a blockchain with no more than 25 shards.

关键词： Blockchain sharding graph partitioning algorithm

来源：评论

学校读者我要写书评

暂无评论

KnowCoder: Coding Structured Knowledge into LLMs for Universal Information Extraction

arXiv

引用

arXiv 2024年

作者： Li, Zixuan Zeng, Yutao Zuo, Yuxin Ren, Weicheng Liu, Wenxuan Su, Miao Guo, Yucan Liu, Yantao Li, Xiang Hu, Zhilei Bai, Long Li, Wei Liu, Yidan Yang, Pan Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

In this paper, we propose KnowCoder, a Large Language Model (LLM) to conduct Universal Information Extraction (UIE) via code generation. KnowCoder aims to develop a kind of unified schema representation that LLMs can easily understand and an effective learning framework that encourages LLMs to follow schemas and extract structured knowledge accurately. To achieve these, KnowCoder introduces a code-style schema representation method to uniformly transform different schemas into Python classes, with which complex schema information, such as constraints among tasks in UIE, can be captured in an LLM-friendly manner. We further construct a code-style schema library covering over 30,000 types of knowledge, which is the largest one for UIE, to the best of our knowledge. To ease the learning process of LLMs, KnowCoder contains a two-phase learning framework that enhances its schema understanding ability via code pretraining and its schema following ability via instruction tuning. After code pretraining on around 1.5B automatically constructed data, KnowCoder already attains remarkable generalization ability and achieves relative improvements by 49.8% F1, compared to LLaMA2, under the few-shot setting. After instruction tuning, KnowCoder further exhibits strong generalization ability on unseen schemas and achieves up to 12.5% and 21.9%, compared to sota baselines, under the zero-shot setting and the low resource setting, respectively. Additionally, based on our unified schema representations, various human-annotated datasets can simultaneously be utilized to refine KnowCoder, which achieves significant improvements up to 7.5% under the supervised setting. Copyright © 2024, The Authors. All rights reserved.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Type-Representation Enhanced Event Detection via Structure Encoder 1

Type-Representation Enhanced Event Detection via Structure E...

引用

1st IEEE International Conference on Medical Artificial Intelligence, MedAI 2023

作者： Feng, Yuming Huang, Linmeng Liang, Haozhe Jin, Xiaolong Guan, Saiping Guo, Jiafeng School of Computer Science and Technology University of Chinese Academy of Sciences China Institute of Computing Technology Chinese Academy of Sciences Key Lab of Network Data Science and Technology China Institute of Systems Engineering Academy of Military Science Beijing China

ISBN: (纸本)9798350358780

Event detection, aiming to detect whether a sentence contains the type of events of interest, is one of the important tasks in information Extraction. There exist many methods for event detection, which usually treat event detection as a classification problem. These existing methods suffer from the imbalanced training data of different event types. To relieve this problem, this paper proposes a new Type-Representation-Enhanced Event Detection (TREED) method, which introduce hierarchical event type representations to enhance classification accuracy. Specifically, TREED first models the hierarchical relationship among event types in the dataset;Next, upon interactions between the representations of trigger words and event types, it obtains the new representations of trigger words integrating event type information. Finally, TREED classifies the events based on the obtained more accurate trigger word representations. Experimental results on a commonly used benchmark dataset, ACE-2005, demonstrate that the proposed model can improve both accuracy and recall of the event detection task. © 2023 IEEE.

关键词： Signal encoding

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-modal Self-perception Enhanced Large Language Model for 3D Region-of-Interest Captioning with Limited data

引用

IEEE Transactions on Multimedia 2025年 27卷 2935-2948页

作者： Shi, Lu Kan, Shichao Jin, Yi Zhang, Linna Cen, Yigang Bejing Jiaotong University and the Beijing Key Laboratory of Advanced Information Science and Network Technology Institute of Information Science Beijing100044 China Central South University School of Computer Science and Engineering Hunan Changsha0410083 China Beijing Jiaotong University Key Laboratory of Big Data and Artificial Intelligence in Transportation Ministry of Education and the School of Computer and lnformation Technology Beijing100044 China Guizhou University School of Mechanical Engineering Guiyang550025 China

3D Region-of-Interest (RoI) Captioning involves translating a model's understanding of specific objects within a complex 3D scene into descriptive captions. Recent advancements in Large Language Models (LLMs) have shown great potential in this area. Existing methods capture the visual information from RoIs as input tokens for LLMs. However, this approach may not provide enough detailed information for LLMs to generate accurate region-specific captions. In this paper, we introduce Self-RoI, a Large Language Model with multi-modal self-perception capabilities for 3D RoI captioning. To ensure LLMs receive more precise and sufficient information, Self-RoI incorporates Implicit Textual Info. Perception to construct a multi-modal vision-language information. This module utilizes a simple mapping network to generate textual information about basic properties of RoI from vision-following response of LLMs. This textual information is then integrated with the RoI's visual representation to form a comprehensive multi-modal instruction for LLMs. Given the limited availability of 3D RoI-captioning data, we propose a two-stage training strategy to optimize Self-RoI efficiently. In the first stage, we align 3D RoI vision and caption representations. In the second stage, we focus on 3D RoI vision-caption interaction, using a disparate contrastive embedding module to improve the reliability of the implicit textual information and employing language modeling loss to ensure accurate caption generation. Our experiments demonstrate that Self-RoI significantly outperforms previous 3D RoI captioning models. Moreover, the Implicit Textual Info. Perception can be integrated into other multi-modal LLMs for performance enhancement. We will make our code available for further research. © 1999-2012 IEEE.

关键词： Digital elevation model

来源：评论

学校读者我要写书评

暂无评论

Discriminative feature encoding for intrinsic image decomposition

引用

Computational Visual Media 2023年第3期9卷 597-618页

作者： Zongji Wang Yunfei Liu Feng Lu Key Laboratory of Network Information System Technology(NIST) Aerospace Information Research InstituteChinese Academy of SciencesBeijing 100190China State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Peng Cheng Laboratory Shenzhen 518000China

Intrinsic image decomposition is an important and long-standing computer vision *** an input image,recovering the physical scene properties is *** physically motivated priors have been used to restrict the solution space of the optimization problem for intrinsic image *** work takes advantage of deep learning,and shows that it can solve this challenging computer vision problem with high *** focus lies in the feature encoding phase to extract discriminative features for different intrinsic layers from an input *** achieve this goal,we explore the distinctive characteristics of different intrinsic components in the high-dimensional feature embedding *** define feature distribution divergence to efficiently separate the feature vectors of different intrinsic *** feature distributions are also constrained to fit the real ones through a feature distribution *** addition,a data refinement approach is provided to remove data inconsistency from the Sintel dataset,making it more suitable for intrinsic image *** method is also extended to intrinsic video decomposition based on pixel-wise correspondences between adjacent *** results indicate that our proposed network structure can outperform the existing state-of-the-art.

关键词： intrinsic image decomposition deep learning feature distribution data refinement

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

CausalDiff: causality-inspired disentanglement via diffusion model for adversarial defense 24

CausalDiff: causality-inspired disentanglement via diffusion...

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Mingkun Zhang Keping Bi Wei Chen Quanrun Chen Jiafeng Guo Xueqi Cheng CAS Key Laboratory of AI Safety Institute of Computing Technology CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology CAS School of Statistics University of International Business and Economics

ISBN: (纸本)9798331314385

Despite ongoing efforts to defend neural classifiers from adversarial attacks, they remain vulnerable, especially to unseen attacks. In contrast, humans are difficult to be cheated by subtle manipulations, since we make judgments only based on essential factors. Inspired by this observation, we attempt to model label generation with essential label-causative factors and incorporate label-non-causative factors to assist data generation. For an adversarial example, we aim to discriminate the perturbations as non-causative factors and make predictions only based on the label-causative factors. Concretely, we propose a casual diffusion model (CausalDiff) that adapts diffusion models for conditional data generation and disentangles the two types of casual factors by learning towards a novel casual information bottleneck objective. Empirically, CausalDiff has significantly outperformed state-of-the-art defense methods on various unseen attacks, achieving an average robustness of 86.39% (+4.01%) on CIFAR-10, 56.25% (+3.13%) on CIFAR-100, and 82.62% (+4.93%) on GTSRB (German Traffic Sign Recognition Benchmark). The code is available at https://***/CAS-AISafetyBasicResearchGroup/CausalDiff.

关键词：

来源：评论

学校读者我要写书评

暂无评论

What makes a successful rebuttal in computer science conferences?: A perspective on social interaction

What makes a successful rebuttal in computer science confere...

引用

作者： Huang, Junjie Huang, Win-bin Bu, Yi Cao, Qi Shen, Huawei Cheng, Xueqi Data Intelligence System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China Department of Information Management Peking University Beijing China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China

With an exponential increase in submissionsto top-tier Computer science (CS) conferences, more and more conferences have introduced a rebuttal stage to the conference peer review process. The rebuttal stage can be modeled as social interactions between authors and reviewers. A successful rebuttal often results in an increased review score after the rebuttal stage. In this paper, we conduct an empirical study to determine the factors contributing to a successful rebuttal using over 3000 papers and 13,000 reviews from ICLR2022, one of the most prestigious computer science conferences. First, we observe a significant difference in review scores before and after the rebuttal stage, which is crucial for paper acceptance. Furthermore, we investigate factors from the reviewer's perspective using signed social network analysis. A notable finding is the increase in balanced network structure after the rebuttal stage. Subsequently, we evaluate several quantifiable author rebuttal strategies and their effects on review scores. These strategies can help authors in improving their review scores. Finally, we used machine learning models to predict rebuttal success and validated the impact of potential factors analyzed in this paper. Our experiments demonstrate that the utilization of all features proposed in this study can aid in predicting the success of the rebuttal. In summary, this work presents a study on the impact factors of successful rebuttals from both reviewers’ and authors’ perspectives and lays the foundation for analyzing rebuttals with social network analysis. © 2023 Elsevier Ltd

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Enhanced Self-Supervised Prototypical network for Few-Shot Event Detection

Knowledge-Enhanced Self-Supervised Prototypical Network for ...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences China

Prototypical network based joint methods have attracted much attention in few-shot event detection, which carry out event detection in a unified sequence tagging framework. However, these methods suffer from the inaccurate prototype representation problem, due to two main reasons: the number of instances for calculating prototypes is limited;And, they do not well capture the relationships among event prototypes. To deal with this problem, we propose a Knowledge-Enhanced self-supervised Prototypical network, called KE-PN, for few-shot event detection. KE-PN adopts hybrid rules, which can automatically align event types to an external knowledge base, i.e., FrameNet, to obtain more instances. It proposes a self-supervised learning method to filter out noisy data from enhanced instances. KE-PN is further equipped with an auxiliary event type relationship classification module, which injects the relationship information into representations of event prototypes. Extensive experiments on three benchmark datasets, i.e., FewEvent, MAVEN, and ACE2005 demonstrate the state-of-the-art performance of KE-PN. © 2022 Association for Computational Linguistics.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：