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

arxiv 2025年

作者： Zhang, Jian Wei, Bifan Qi, Shihao Zhu, Haiping Liu, Jun Lin, Qika School of Computer Science and Technology Xi’an Jiaotong University Xi’an China School of Continuing Education Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China National University of Singapore Singapore

The construction of Generalized Knowledge Graph (GKG), including knowledge graph, event knowledge graph and commonsense knowledge graph, is fundamental for various natural language processing tasks. Current studies typically construct these types of graph separately, overlooking holistic insights and potential unification that could be beneficial in computing resources and usage perspectives. However, a key challenge in developing a unified framework for GKG is obstacles arising from task-specific differences. In this study, we propose a unified framework for constructing generalized knowledge graphs to address this challenge. First, we collect data from 15 sub-tasks in 29 datasets across the three types of graphs, categorizing them into in-sample, counter-task, and out-of-distribution (OOD) data. Then, we propose a three-stage curriculum learning fine-tuning framework, by iteratively injecting knowledge from the three types of graphs into the Large Language Models. Extensive experiments show that our proposed model improves the construction of all three graph types across in-domain, OOD and counter-task data. Copyright © 2025, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Factual Serialization Enhancement: A key Innovation for Chest X-ray Report Generation

arXiv

引用

arxiv 2024年

作者： Liu, Kang Ma, Zhuoqi Liu, Mengmeng Jiao, Zhicheng Kang, xiaolu Miao, Qiguang xie, Kun The School of Computer Science and Technology Xidian University Shaanxi Xi’an710071 China The Xi'an Key Laboratory of Big Data and Intelligent Vision Shaanxi Xi’an710071 China The Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an710071 China The School of Artificial Intelligence Xidian University Xi’an710071 China The Department of Diagnostic Imaging Brown University ProvidenceRI02903-4923 United States

A radiology report comprises presentation-style vocabulary, which ensures clarity and organization, and factual vocabulary, which provides accurate and objective descriptions based on observable findings. While manually writing these reports is time-consuming and labor-intensive, automatic report generation offers a promising alternative. A critical step in this process is to align radiographs with their corresponding reports. However, existing methods often rely on complete reports for alignment, overlooking the impact of presentation-style vocabulary. To address this issue, we propose FSE, a two-stage Factual Serialization Enhancement method. In Stage 1, we introduce factuality-guided contrastive learning for visual representation by maximizing the semantic correspondence between radiographs and corresponding factual descriptions. In Stage 2, we present evidence-driven report generation that enhances diagnostic accuracy by integrating insights from similar historical cases structured as factual serialization. Experiments on MIMIC-CXR and IU X-ray datasets across specific and general scenarios demonstrate that FSE outperforms state-of-the-art approaches in both natural language generation and clinical efficacy metrics. Ablation studies further emphasize the positive effects of factual serialization in Stage 1 and Stage 2. The code is available at https://***/mk-runner/FSE. Copyright © 2024, The Authors. All rights reserved.

关键词： Report generators

来源：评论

学校读者我要写书评

暂无评论

Learning from Semi-Factuals: A Debiased and Semantic-Aware Framework for Generalized Relation Discovery

arXiv

引用

arxiv 2024年

作者： Wang, Jiaxin Zhang, Lingling Liu, Jun Guo, Tianlin Wu, Wenjun The School of Computer Science and Technology Xi’an Jiaotong University Shaanxi Xi’an710049 China The Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Shaanxi Xi’an710049 China National Engineering Lab for Big Data Analytics Xi’an Jiaotong University Shaanxi Xi’an710049 China

We introduce a novel task, called Generalized Relation Discovery (GRD), for open-world relation extraction. GRD aims to identify unlabeled instances in existing pre-defined relations or discover novel relations by assigning instances to clusters as well as providing specific meanings for these clusters. The key challenges of GRD are how to mitigate the serious model biases caused by labeled pre-defined relations to learn effective relational representations and how to determine the specific semantics of novel relations during classifying or clustering unlabeled instances. We then propose a novel framework, SFGRD, for this task to solve the above issues by learning from semi-factuals in two stages. The first stage is semi-factual generation implemented by a tri-view debiased relation representation module, in which we take each original sentence as the main view and design two debiased views to generate semi-factual examples for this sentence. The second stage is semi-factual thinking executed by a dual-space tri-view collaborative relation learning module, where we design a cluster-semantic space and a class-index space to learn relational semantics and relation label indices, respectively. In addition, we devise alignment and selection strategies to integrate two spaces and establish a self-supervised learning loop for unlabeled data by doing semi-factual thinking across three views. Extensive experimental results show that SFGRD surpasses state-of-the-art models in terms of accuracy by 2.36% ∼5.78% and cosine similarity by 32.19%∼ 84.45% for relation label index and relation semantic quality, respectively. To the best of our knowledge, we are the first to exploit the efficacy of semi-factuals in relation extraction. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

DualConvNet: Enhancing CNN Inference Efficiency Through Compressed Convolutions and Reparameterization

DualConvNet: Enhancing CNN Inference Efficiency Through Comp...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Haipeng Du Muyan Jiao Jiageng Zhang xin Lv Jie Zhang School of Computer Science and Technology Xi’an Jiaotong University Xi’an China Shaanxi Province Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University Xi’an China School of Continuing Education Xi’an Jiaotong University Xi’an China Network Information Center Xi’an Jiaotong University Xi’an China School of Computer Science and Engineering Xi’an University of Technology Xi’an China

ISBN: (数字)9798331506209

ISBN: (纸本)9798331506216

Convolutional Neural Networks (CNNs) have significantly advanced computer vision tasks, but their increasing complexity poses challenges for efficient inference, particularly on resource-constrained devices. We present DualConvNet, a novel CNN architecture that enhances inference efficiency through two key innovations: compressed convolutions and reparameterization. Compressed convolutions reduce computational complexity by selectively processing input channel subsets during both training and inference. For inference, we introduce a reparameterization technique that merges the multi-branch structure into a single, efficient operation, significantly improving speed. Experiments on CIFAR-10, CIFAR-100, and ImageNet-1k demonstrate DualConvNet’s effectiveness, consistently outperforming state-of-the-art models in both accuracy and inference speed. On the COCO dataset, DualConvNet shows competitive accuracy in object detection and instance segmentation tasks while substantially reducing GPU latency. Ablation studies validate the impact of our dual-strategy approach, revealing significant improvements in both accuracy and computational efficiency compared to alternative designs. These results demonstrate DualConvNet’s effectiveness in improving inference efficiency while maintaining high accuracy across various tasks and datasets, making it particularly suitable for real-time applications in resource-constrained scenarios.

关键词： Training Technological innovation Accuracy Image coding Computational modeling computer architecture Transformers Computational efficiency Convolutional neural networks Computational complexity

来源：评论

学校读者我要写书评

暂无评论

M-procedures robust to structural changes detection under strong mixing heavy-tailed time series models

引用

Journal of Statistical Planning and Inference 2025年 239卷

作者： Jin, Hao Hu, Jiating Zhu, Ling Tian, Shiyu Zhang, Si School of Computer Science and Technology Xi'an University of Science and Technology Xi'an 710054 China School of Sciences Xi'an University of Science and Technology Xi'an 710054 China Chongqing College of Mobile Communication Chongqing Key Laboratory of Public Big Data Security Technology Chongqing 401420 China

Many tests of change points resort to least squares estimation method, but it can lead to bias if these observations are heavy-tailed processes. The aim of this paper is to construct a ratio-typed test based on M-estimation, which avoids the long-range variance estimation and is robust to structural change detection under strong mixing series with heavy-tailed. The proposed test consisting of M-procedures has more utility in that it allows processes in the domain of attraction of a stable law with index κ∈(0,2), not limited to (1,2). Under some regular conditions, asymptotic distribution under the null hypothesis of no change is functional of a Brownian motion, and the divergent rate under the alternative hypothesis is also provided. Furthermore, the convergence rate of a ratio-typed change point estimator is established. Simulation study illustrates there is no distortion in empirical sizes, and empirical powers have satisfactory performance. Finally, two practical applications to real examples are presented as well. © 2025 Elsevier B.V.

关键词： Asymptotic distribution Heavy-tailed M-procedures Ratio-typed tests Structural change

来源：评论

学校读者我要写书评

暂无评论

Structural Entities Extraction and Patient Indications Incorporation for Chest X-ray Report Generation

arXiv

引用

arxiv 2024年

作者： Liu, Kang Ma, Zhuoqi Kang, xiaolu Zhong, Zhusi Jiao, Zhicheng Baird, Grayson Bai, Harrison Miao, Qiguang School of Computer Science and Technology Xidian University Xi’an China Xi’an Key Laboratory of Big Data and Intelligent Vision Xi’an China Key Laboratory of Collaborative Intelligence Systems Ministry of Education Xidian University Xi’an China Warren Alpert Medical School Brown University Providence United States School of Electronic Engineering Xidian University Xi’an China Department of Radiology and Radiological Sciences Johns Hopkins University School of Medicine Baltimore United States

The automated generation of imaging reports proves invaluable in alleviating the workload of radiologists. A clinically applicable reports generation algorithm should demonstrate its effectiveness in producing reports that accurately describe radiology findings and attend to patient-specific indications. In this paper, we introduce a novel method, Structural Entities extraction and patient indications Incorporation (SEI) for chest X-ray report generation. Specifically, we employ a structural entities extraction (SEE) approach to eliminate presentation-style vocabulary in reports and improve the quality of factual entity sequences. This reduces the noise in the following cross-modal alignment module by aligning X-ray images with factual entity sequences in reports, thereby enhancing the precision of cross-modal alignment and further aiding the model in gradient-free retrieval of similar historical cases. Subsequently, we propose a cross-modal fusion network to integrate information from X-ray images, similar historical cases, and patient-specific indications. This process allows the text decoder to attend to discriminative features of X-ray images, assimilate historical diagnostic information from similar cases, and understand the examination intention of patients. This, in turn, assists in triggering the text decoder to produce high-quality reports. Experiments conducted on MIMIC-CXR validate the superiority of SEI over state-of-the-art approaches on both natural language generation and clinical efficacy metrics. Copyright © 2024, The Authors. All rights reserved.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

NcoVis: A Visual Analysis Framework for Exploring Academic Collaboration Networks under New Collaborative Relationships 25

NcoVis: A Visual Analysis Framework for Exploring Academic C...

引用

25th IEEE International Conference on computer Supported Cooperative Work in Design, CSCWD 2022

作者： Yu, Ye Wu, Yao Liang, xi Ma, Cheng Lu, Qiang Key Laboratory of Knowledge Engineering with Big Data Hefei University of Technology Ministry of Education Hefei China School of Computer Science and Information Hefei University of Technology Hefei China Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China

ISBN: (纸本)9781665405270

Academic collaboration has become one of the topics of large-scale social network analysis. The information extracted from academic collaboration also shows the contextual value in combination with other data. For academic collaborative social networks with intricate collaborative relationships, previous research methods mainly focused on network structure and community discovery, lacking in mining the characteristics of relationships in collaborative networks. There were some limitations in the research perspective. In this work, we propose a collaborative relationship representation method that is more suitable for academic collaborative social networks. It marks the attribute characteristics of nodes in collaborative relationships and highlights collaborative relationships in visualization. By adopting this new representation of collaborative relationships, we designed a visual analysis framework NcoVis, to visualize academic collaborative social networks. We further visually analyze the link relationship groups guided by nodes, and explore the potential representation of the structure and attribute characteristics of link relationships, so that analysts can explore the theme and structural change characteristics of link relationships, communities and the whole network in collaborative social networks. To prove the proposed framework, we conducted a case study on the academic collaboration literature data set, and analyzed the questionnaire with Likert scale through the user evaluation experiment, which verified the effectiveness of our method and the practicability of NcoVis. © 2022 IEEE.

关键词： Visualization

来源：评论

学校读者我要写书评

暂无评论

ALFLAT: Chinese NER Using ALBERT, Flat-Lattice Transformer, Word Segmentation and Entity Dictionary 2nd

ALFLAT: Chinese NER Using ALBERT, Flat-Lattice Transformer, ...

引用

2nd EAI International Conference on Applied Cryptography in computer and Communications, AC3 2022

作者： Lv, Haifeng Ding, Yong School of Data Science and Software Engineering Wuzhou University Wuzhou China Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University Wuzhou China

ISBN: (纸本)9783031170805

Recently, the character-word lattice structure has been proved to be effective for Chinese named entity recognition (NER) by incorporating the word information. However, one hand, since the lattice structure is dynamic and complex, although some existing lattice-based models are effectively utilize the parallel computation of GPUs, they do not fully utilize word segmentation boundary tags that as features are helpful for NER task. On the other hand, the character-word vector needs to be trained, and the user-defined entity dictionary cannot be effectively used. In this paper, we propose ALFLAT: based on a flat-lattice Transformer to incorporate ALBERT pre-trained model, word segmentation information and user-defined entity dictionary for Chinese NER. ALFLAT converts the lattice structure into a flat structure consisting of spans, integrate word segmentation embedding with the output of flat-lattice Transformer model, then modifies the emission scores according to the user-defined entity dictionary, finally utilize Viterbi decoding of the CRF layer to obtain the correct entity results. Each span corresponds to a character or latent word and its position in the original lattice. With the power of ALBERT pre-trained model, Transformer and position encoding, ALFLAT can fully leverage the lattice, word segmentation and user-defined entity dictionary information. Experiments on MSRA dataset show ALFLAT outperforms other lexicon-based models in performance and efficiency. © 2022, ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Towards Exploratory Query Optimization for Template-Based SQL Workloads

Towards Exploratory Query Optimization for Template-Based SQ...

引用

International Conference on data Engineering

作者： Jieming Feng Zhanhuai Li Qun Chen School of Computer Science and Engineering Northwestern Polytechnical University Xi'an Shaanxi China Ministry of Industry and Information Technology Key Laboratory of Big Data Storage and Management Northwestern Polytechnical University Xi'an Shaanxi China

ISBN: (数字)9798350317152

ISBN: (纸本)9798350317169

SQL query optimization aims to choose an optimal Query Execution Plan (QEP) for a query. The existing optimizers usually choose the plan with the minimal execution cost. However, in some real scenarios (e.g., cloud OLAP), it is a business imperative to minimize the cost of an entire workload. Unfortunately, the greedy optimizers are prone to generating execution plans that are only suboptimal from the workload perspective. In this paper, we propose a novel QEP optimization approach for template-based SQL that aims to minimize the execution cost of an entire workload instead of individual queries. While choosing an execution plan for a query, the proposed approach considers a plan's impact on future query execution as well as its own execution cost. We first define an exploratory metric, Plan Exploration Value (PEV), to measure a plan's potential benefit to future query execution. Then, we model exploratory plan selection as an optimization problem with cost constraints, and present an efficient algorithm based on dynamic programming for its solution. Finally, we evaluate the performance of the proposed approach by a comparative study on benchmark workloads. Our extensive experiments have shown that it generates more efficient workload execution plans than the existing alternatives.

关键词： Measurement Maximum likelihood estimation Costs Query processing Heuristic algorithms Current measurement Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

An Efficient Pairing-Free Certificateless Signcryption Scheme Under the Standard Model for VANET

引用

IEEE Internet of Things Journal 2025年

作者： Liu, xianxiang Zhou, Yanwei Yang, Bo Zhu, Tianqing Zhang, Mingwu Shaanxi Normal University School of Computer Science Xi'an710119 China Sichuan University Key Laboratory of Data Protection and Intelligent Management Ministry of Education Chengdu610065 China City University of Macau Faculty of Data Science Macau999078 China Hubei University of Technology School of Computer Wuhan430068 China

With the rapid advancement of the Internet of Things (IoT), its applications are becoming increasingly essential in actual application. Specifically, the recent surge in electric vehicles has spurred significant advancements in vehicle ad hoc networks (VANET). Therefore, efficient data transmission is a critical challenge in IoT, especially VANET. The certificateless signcryption (CLS) scheme has high authentication efficiency, which has become increasingly important in IoT. However, most existing schemes rely on bilinear pairing, resulting in high calculation costs or failure to achieve their claimed security. Furthermore, the security of some CLS schemes is proved in the random oracle, which limits the usefulness of the CLS scheme. To further address these issues, we propose an efficient and secure CLS scheme in the standard model for VANET, which enhances its practical applicability in VANET. Our construction employs formal security proofs and cost simulations to ensure the scheme's security and low calculation costs, making it suitable for VANET. Finally, the security and efficiency analyses prove that our scheme offers enhanced security features and superior performance compared to existing schemes. © 2014 IEEE.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：